fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r128-smll-174876524800578
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Murphy-PT-D2N050

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524800578.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 Murphy-PT-D2N050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524800578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 12K 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 Murphy-PT-D2N050-CTLFireability-2025-00
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-01
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-02
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-03
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-04
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-05
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-06
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-07
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-08
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-09
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-10
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-11
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-12
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-13
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-14
FORMULA_NAME Murphy-PT-D2N050-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749323150979

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 19:05:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 19:05:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:05:53] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2025-06-07 19:05:53] [INFO ] Transformed 18 places.
[2025-06-07 19:05:53] [INFO ] Transformed 21 transitions.
[2025-06-07 19:05:53] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 14 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 18 cols
[2025-06-07 19:05:53] [INFO ] Computed 4 invariants in 6 ms
[2025-06-07 19:05:53] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1295ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 1319ms
[2025-06-07 19:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:05:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 19:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:05:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 19:05:54] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:05:54] [INFO ] Invariant cache hit.
[2025-06-07 19:05:54] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 763ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 764ms
Finished structural reductions in LTL mode , in 1 iterations and 2284 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2025-06-07 19:05:56] [INFO ] Flatten gal took : 35 ms
[2025-06-07 19:05:56] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:05:56] [INFO ] Input system was already deterministic with 21 transitions.
Reduction of identical properties reduced properties to check from 43 to 41
RANDOM walk for 40125 steps (8 resets) in 726 ms. (55 steps per ms) remains 9/41 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 9/9 properties
[2025-06-07 19:05:57] [INFO ] Invariant cache hit.
[2025-06-07 19:05:57] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/17 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 21/38 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/17 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 21/38 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/39 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 37 constraints, problems are : Problem set: 0 solved, 9 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1645 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:05:59] [INFO ] Invariant cache hit.
[2025-06-07 19:05:59] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 596ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 602 ms. Remains : 18/18 places, 21/21 transitions.
RANDOM walk for 40086 steps (8 resets) in 101 ms. (393 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 271415 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 9
Probabilistic random walk after 271415 steps, saw 174784 distinct states, run finished after 3007 ms. (steps per millisecond=90 ) properties seen :0
[2025-06-07 19:06:03] [INFO ] Invariant cache hit.
[2025-06-07 19:06:03] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/17 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 21/38 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2/17 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 21/38 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/39 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 37 constraints, problems are : Problem set: 0 solved, 9 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1347 ms.
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-07 19:06:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:06:05] [INFO ] Implicit Places using invariants in 32 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38 ms. Remains : 17/18 places, 21/21 transitions.
RANDOM walk for 40041 steps (8 resets) in 34 ms. (1144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 287204 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 9
Probabilistic random walk after 287204 steps, saw 185311 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
// Phase 1: matrix 21 rows 17 cols
[2025-06-07 19:06:08] [INFO ] Computed 3 invariants in 1 ms
[2025-06-07 19:06:08] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 21/37 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 26 constraints, problems are : Problem set: 0 solved, 9 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 21/37 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 9 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 841 ms.
Support contains 15 out of 17 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 17/17 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17/17 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-07 19:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:06:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-07 19:06:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:06:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 19:06:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:06:09] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-07 19:06:09] [INFO ] Invariant cache hit.
[2025-06-07 19:06:09] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/14 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/38 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 26 constraints, problems are : Problem set: 0 solved, 12 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/14 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/38 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 12/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 38 constraints, problems are : Problem set: 0 solved, 12 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 730ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 798 ms. Remains : 17/17 places, 21/21 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 9 properties.
[2025-06-07 19:06:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 19:06:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 19:06:10] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 12 ms returned sat
[2025-06-07 19:06:10] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-07 19:06:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-07 19:06:10] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-07 19:06:10] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2025-06-07 19:06:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 19:06:11] [INFO ] After 63ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:06:11] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 13 ms to minimize.
[2025-06-07 19:06:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 1
[2025-06-07 19:06:11] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2025-06-07 19:06:11] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 601 ms.
[2025-06-07 19:06:11] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:06:11] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:06:11] [INFO ] Input system was already deterministic with 21 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 18 cols
[2025-06-07 19:06:11] [INFO ] Computed 4 invariants in 1 ms
[2025-06-07 19:06:11] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 601ms
[2025-06-07 19:06:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:06:11] [INFO ] Implicit Places using invariants in 29 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 634 ms. Remains : 17/18 places, 21/21 transitions.
[2025-06-07 19:06:11] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:06:11] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:06:11] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:06:11] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:06:11] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:06:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3179818853329340940.gal : 2 ms
[2025-06-07 19:06:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1272029634770538693.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3179818853329340940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1272029634770538693.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,10.8856,148240,2,16524,5,538622,6,0,113,638123,0


Converting to forward existential form...Done !
original formula: (E((AG(((((p3_1>=1)&&(p3_2>=1))&&((p0_3>=1)&&(p1_3>=1)))&&((p2_3>=1)&&(p3_1>=1)))) * A(AF((p4_2>=1)) U (((p0_1>=3)&&(p2_1>=1))&&(p4_1>=1)...398
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,(!(E(TRUE U !(((((p3_1>=1)&&(p3_2>=1))&&((p0_3>=1)&&(p1_3>=1)))&&((p2_3>=1)&&(p3_1>=1)))))) ...1471
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-07 19:06:42] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:06:42] [INFO ] Applying decomposition
[2025-06-07 19:06:42] [INFO ] Flatten gal took : 3 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/graph15224377813818974230.txt' '-o' '/tmp/graph15224377813818974230.bin' '-w' '/tmp/graph15224377813818974230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15224377813818974230.bin' '-l' '-1' '-v' '-w' '/tmp/graph15224377813818974230.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:06:42] [INFO ] Decomposing Gal with order
[2025-06-07 19:06:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:06:42] [INFO ] Flatten gal took : 56 ms
[2025-06-07 19:06:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 19:06:42] [INFO ] Time to serialize gal into /tmp/CTLFireability697849407669626493.gal : 2 ms
[2025-06-07 19:06:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6844537213120599859.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability697849407669626493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6844537213120599859.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:07:12] [INFO ] Invariant cache hit.
[2025-06-07 19:07:12] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 771ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 771ms
[2025-06-07 19:07:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:07:13] [INFO ] Implicit Places using invariants in 40 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 814 ms. Remains : 16/18 places, 21/21 transitions.
[2025-06-07 19:07:13] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:07:13] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:07:13] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:07:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:07:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:07:13] [INFO ] Time to serialize gal into /tmp/CTLFireability10399831684710196750.gal : 1 ms
[2025-06-07 19:07:13] [INFO ] Time to serialize properties into /tmp/CTLFireability4600595013697682072.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10399831684710196750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4600595013697682072.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,26.312,291080,2,16443,5,1.00248e+06,6,0,109,1.03226e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-07 19:07:43] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:07:43] [INFO ] Applying decomposition
[2025-06-07 19:07:43] [INFO ] Flatten gal took : 2 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/graph9194029232545868663.txt' '-o' '/tmp/graph9194029232545868663.bin' '-w' '/tmp/graph9194029232545868663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9194029232545868663.bin' '-l' '-1' '-v' '-w' '/tmp/graph9194029232545868663.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:07:43] [INFO ] Decomposing Gal with order
[2025-06-07 19:07:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:07:43] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 19:07:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11927186855791287670.gal : 1 ms
[2025-06-07 19:07:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4774440076272062779.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11927186855791287670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4774440076272062779.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:08:13] [INFO ] Invariant cache hit.
[2025-06-07 19:08:13] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 545ms
[2025-06-07 19:08:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:08:13] [INFO ] Implicit Places using invariants in 37 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 587 ms. Remains : 15/18 places, 21/21 transitions.
[2025-06-07 19:08:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:08:13] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:08:13] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:08:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:08:13] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:08:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3853934936513864175.gal : 1 ms
[2025-06-07 19:08:13] [INFO ] Time to serialize properties into /tmp/CTLFireability16470351962078016730.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3853934936513864175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16470351962078016730.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,9.51709,117064,2,4826,5,432510,6,0,105,464476,0


Converting to forward existential form...Done !
original formula: AF(AG(EF(((p4_3>=1)&&(p3_1>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U ((p4_3>=1)&&(p3_1>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,1,11.4906,117064,1,0,46,432510,66,21,1449,464476,51
FORMULA Murphy-PT-D2N050-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:08:25] [INFO ] Invariant cache hit.
[2025-06-07 19:08:25] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 591ms
[2025-06-07 19:08:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:08:25] [INFO ] Implicit Places using invariants in 25 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 620 ms. Remains : 17/18 places, 21/21 transitions.
[2025-06-07 19:08:26] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:08:26] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:08:26] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:08:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:08:26] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:08:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8246610088969542611.gal : 1 ms
[2025-06-07 19:08:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13596772964973491379.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8246610088969542611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13596772964973491379.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,27.6744,317788,2,20967,5,1.09301e+06,6,0,113,1.18817e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-07 19:08:56] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:08:56] [INFO ] Applying decomposition
[2025-06-07 19:08:56] [INFO ] Flatten gal took : 2 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/graph7734553177199440536.txt' '-o' '/tmp/graph7734553177199440536.bin' '-w' '/tmp/graph7734553177199440536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7734553177199440536.bin' '-l' '-1' '-v' '-w' '/tmp/graph7734553177199440536.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:08:56] [INFO ] Decomposing Gal with order
[2025-06-07 19:08:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:08:56] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:08:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 19:08:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10266218182302018967.gal : 1 ms
[2025-06-07 19:08:56] [INFO ] Time to serialize properties into /tmp/CTLFireability781215475312130688.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10266218182302018967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability781215475312130688.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:09:26] [INFO ] Invariant cache hit.
[2025-06-07 19:09:26] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 533ms
[2025-06-07 19:09:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:09:26] [INFO ] Implicit Places using invariants in 38 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 574 ms. Remains : 15/18 places, 21/21 transitions.
[2025-06-07 19:09:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:26] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:09:26] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:09:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:26] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:09:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5392981396950456852.gal : 1 ms
[2025-06-07 19:09:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6880258288972942135.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5392981396950456852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6880258288972942135.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,9.5584,116924,2,4826,5,432510,6,0,105,464476,0


Converting to forward existential form...Done !
original formula: AX(AG((((p3_3<2)||(p4_3<1))||((p0_2>=1)&&(p1_2>=1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((((p3_3<2)||(p4_3<1))||((p0_2>=1)&&(p1_2>=1)))))] = FALSE
(forward)formula 0,1,9.55969,116924,1,0,5,432510,9,0,115,464476,0
FORMULA Murphy-PT-D2N050-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:09:36] [INFO ] Invariant cache hit.
[2025-06-07 19:09:36] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 603ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 604ms
[2025-06-07 19:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:09:36] [INFO ] Implicit Places using invariants in 29 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 16/18 places, 21/21 transitions.
[2025-06-07 19:09:36] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:36] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:36] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:09:36] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:36] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5470513555805596111.gal : 1 ms
[2025-06-07 19:09:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14156798442688087624.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5470513555805596111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14156798442688087624.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,9.77494,118904,2,10675,5,444434,6,0,109,470206,0


Converting to forward existential form...Done !
original formula: ((EF(((p3_3>=2)&&(p4_3>=1))) * AF((p5_3>=3))) * EF((AF(EX(((p0_1<1)||(p1_1<1)))) + ((((p3_2<2)||(p4_2<1))&&(p0_1>=3))&&((p2_1>=1)&&(p4_1>...163
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((p3_3>=2)&&(p4_3>=1)))))] = FALSE * [FwdG(Init,!((p5_3>=3)))] = FALSE) * [(Init * !(E(TRU...270
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,13.7544,118904,1,0,57,444434,78,31,1670,470206,64
FORMULA Murphy-PT-D2N050-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:09:50] [INFO ] Invariant cache hit.
[2025-06-07 19:09:50] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 572ms
[2025-06-07 19:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:09:51] [INFO ] Implicit Places using invariants in 34 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 612 ms. Remains : 16/18 places, 21/21 transitions.
[2025-06-07 19:09:51] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:09:51] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:51] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:09:51] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:51] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:09:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16116062540834433795.gal : 1 ms
[2025-06-07 19:09:51] [INFO ] Time to serialize properties into /tmp/CTLFireability14826130485243653141.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16116062540834433795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14826130485243653141.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,9.36579,119080,2,10675,5,444434,6,0,109,470206,0


Converting to forward existential form...Done !
original formula: EG(AG(EF((((p0_1<1)||(p1_1<1))||(p2_1<1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (((p0_1<1)||(p1_1<1))||(p2_1<1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,1,20.2225,179796,1,0,46,676159,64,22,1664,686264,54
FORMULA Murphy-PT-D2N050-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:10:11] [INFO ] Invariant cache hit.
[2025-06-07 19:10:11] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 625ms
[2025-06-07 19:10:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:10:12] [INFO ] Implicit Places using invariants in 25 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 654 ms. Remains : 17/18 places, 21/21 transitions.
[2025-06-07 19:10:12] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:10:12] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:10:12] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:10:12] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:10:12] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:10:12] [INFO ] Time to serialize gal into /tmp/CTLFireability10318588106383011182.gal : 1 ms
[2025-06-07 19:10:12] [INFO ] Time to serialize properties into /tmp/CTLFireability7578108629039357847.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10318588106383011182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7578108629039357847.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,27.2898,293352,2,22292,5,1.0144e+06,6,0,113,1.03799e+06,0


Converting to forward existential form...Done !
original formula: E(E((!(((EG((((p0_2>=1)&&(p1_2>=1))&&(p2_2>=1))) * (p0_1>=1)) * ((p1_1>=1)&&(p2_1>=1)))) * EF((p3_2>=1))) U (EG(((p3_2<1)||(!(((p0_1>=1)&...237
=> equivalent forward existential formula: [(FwdU(Init,E((!(((EG((((p0_2>=1)&&(p1_2>=1))&&(p2_2>=1))) * (p0_1>=1)) * ((p1_1>=1)&&(p2_1>=1)))) * E(TRUE U (p...289
(forward)formula 0,0,27.2955,293352,1,0,5,1.0144e+06,8,0,115,1.03799e+06,0
FORMULA Murphy-PT-D2N050-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:10:39] [INFO ] Invariant cache hit.
[2025-06-07 19:10:39] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 600ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 601ms
[2025-06-07 19:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:10:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-07 19:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:10:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 19:10:40] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:10:40] [INFO ] Invariant cache hit.
[2025-06-07 19:10:40] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 721ms
Finished structural reductions in LTL mode , in 1 iterations and 1386 ms. Remains : 18/18 places, 21/21 transitions.
[2025-06-07 19:10:41] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:10:41] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:10:41] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:10:41] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:10:41] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:10:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5220531436655452809.gal : 0 ms
[2025-06-07 19:10:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12881587085310066086.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5220531436655452809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12881587085310066086.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,28.7692,324144,2,28143,5,1.10859e+06,6,0,117,1.20586e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-07 19:11:11] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:11:11] [INFO ] Applying decomposition
[2025-06-07 19:11:11] [INFO ] Flatten gal took : 1 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/graph7873890270602754602.txt' '-o' '/tmp/graph7873890270602754602.bin' '-w' '/tmp/graph7873890270602754602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7873890270602754602.bin' '-l' '-1' '-v' '-w' '/tmp/graph7873890270602754602.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:11:11] [INFO ] Decomposing Gal with order
[2025-06-07 19:11:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:11:11] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:11:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 19:11:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12702900110119404683.gal : 1 ms
[2025-06-07 19:11:11] [INFO ] Time to serialize properties into /tmp/CTLFireability917683359088400658.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12702900110119404683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability917683359088400658.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:11:41] [INFO ] Invariant cache hit.
[2025-06-07 19:11:41] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 542ms
[2025-06-07 19:11:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:11:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-07 19:11:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:11:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 19:11:41] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:11:41] [INFO ] Invariant cache hit.
[2025-06-07 19:11:41] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 554ms
Finished structural reductions in LTL mode , in 1 iterations and 1157 ms. Remains : 18/18 places, 21/21 transitions.
[2025-06-07 19:11:42] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:11:42] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:11:42] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:11:42] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:11:42] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:11:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3585230543708669965.gal : 0 ms
[2025-06-07 19:11:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9211736501888297299.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3585230543708669965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9211736501888297299.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,28.0906,323404,2,28143,5,1.10859e+06,6,0,117,1.20586e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-07 19:12:12] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:12:12] [INFO ] Applying decomposition
[2025-06-07 19:12:12] [INFO ] Flatten gal took : 2 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/graph15794058403290001138.txt' '-o' '/tmp/graph15794058403290001138.bin' '-w' '/tmp/graph15794058403290001138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15794058403290001138.bin' '-l' '-1' '-v' '-w' '/tmp/graph15794058403290001138.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:12:12] [INFO ] Decomposing Gal with order
[2025-06-07 19:12:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:12:12] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:12:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 19:12:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3681675549668102764.gal : 0 ms
[2025-06-07 19:12:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9552404516488210803.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3681675549668102764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9552404516488210803.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:12:42] [INFO ] Invariant cache hit.
[2025-06-07 19:12:42] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 673ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 673ms
[2025-06-07 19:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:12:43] [INFO ] Implicit Places using invariants in 47 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 733 ms. Remains : 16/18 places, 21/21 transitions.
[2025-06-07 19:12:43] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:12:43] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:12:43] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:12:43] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:12:43] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:12:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8668915959742792956.gal : 1 ms
[2025-06-07 19:12:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9146285486081792972.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8668915959742792956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9146285486081792972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,9.84329,119104,2,10675,5,444434,6,0,109,470206,0


Converting to forward existential form...Done !
original formula: AF(((EF(AG(((p0_2<1)||(p1_2<1)))) * (((p0_1<3)||(p2_1<1))||(p4_1<1))) * (EG((p4_3<1)) + (p4_3>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U !(E(TRUE U !(((p0_2<1)||(p1_2<1)))))) * (((p0_1<3)||(p2_1<1))||(p4_1<1))) * (EG((p4_3<1)...181
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,0,19.3436,148724,1,0,49,560884,72,25,1674,588808,64
FORMULA Murphy-PT-D2N050-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:13:02] [INFO ] Invariant cache hit.
[2025-06-07 19:13:02] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 553ms
[2025-06-07 19:13:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:13:03] [INFO ] Implicit Places using invariants in 25 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 582 ms. Remains : 17/18 places, 21/21 transitions.
[2025-06-07 19:13:03] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:13:03] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:03] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:13:03] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:03] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9624132810041003004.gal : 0 ms
[2025-06-07 19:13:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5060370017418083934.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9624132810041003004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5060370017418083934.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,12.4859,147224,2,16524,5,538622,6,0,113,638123,0


Converting to forward existential form...Done !
original formula: E(!((((p0_3>=3)&&(p2_3>=1))&&(p4_3>=1))) U (EF(AX((p3_3>=1))) * !(E((((EX((p3_1>=1)) * (p3_1>=2)) * ((p4_1>=1)&&(p0_3>=3))) * ((p2_3>=1)&...213
=> equivalent forward existential formula: [((FwdU(Init,!((((p0_3>=3)&&(p2_3>=1))&&(p4_3>=1)))) * E(TRUE U !(EX(!((p3_3>=1)))))) * !(E((((EX((p3_1>=1)) * (...277
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,0,17.2202,147224,1,0,56,553028,68,27,1813,638123,60
FORMULA Murphy-PT-D2N050-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:13:20] [INFO ] Invariant cache hit.
[2025-06-07 19:13:20] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 491ms
[2025-06-07 19:13:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:13:21] [INFO ] Implicit Places using invariants in 28 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 522 ms. Remains : 15/18 places, 21/21 transitions.
[2025-06-07 19:13:21] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:21] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:21] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:13:21] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:21] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability15187527653058119429.gal : 0 ms
[2025-06-07 19:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8412730529466037916.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15187527653058119429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8412730529466037916.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,9.09346,116612,2,4826,5,432510,6,0,105,464476,0


Converting to forward existential form...Done !
original formula: EF(AG((((p4_3>=1)||(p5_2>=3))||(((p4_1<1)&&(p5_1>=3))&&((p0_1<1)||(p1_1<1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p4_3>=1)||(p5_2>=3))||(((p4_1<1)&&(p5_1>=3))&&((p0_1<1)||(p1_1<1))))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,0,10.9353,116612,1,0,46,432510,61,20,1449,464476,49
FORMULA Murphy-PT-D2N050-CTLFireability-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:13:32] [INFO ] Invariant cache hit.
[2025-06-07 19:13:32] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 601ms
[2025-06-07 19:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:13:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 19:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:13:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 19:13:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:13:32] [INFO ] Invariant cache hit.
[2025-06-07 19:13:32] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 528ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 528ms
Finished structural reductions in LTL mode , in 1 iterations and 1191 ms. Remains : 18/18 places, 21/21 transitions.
[2025-06-07 19:13:33] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:33] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:33] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:13:33] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:13:33] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:13:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5665496463783983839.gal : 1 ms
[2025-06-07 19:13:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14034001030381069167.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5665496463783983839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14034001030381069167.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 19:14:03] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:14:03] [INFO ] Applying decomposition
[2025-06-07 19:14:03] [INFO ] Flatten gal took : 1 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/graph9525936249634489590.txt' '-o' '/tmp/graph9525936249634489590.bin' '-w' '/tmp/graph9525936249634489590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9525936249634489590.bin' '-l' '-1' '-v' '-w' '/tmp/graph9525936249634489590.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:14:03] [INFO ] Decomposing Gal with order
[2025-06-07 19:14:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:14:03] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:14:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 19:14:03] [INFO ] Time to serialize gal into /tmp/CTLFireability11835206209870524755.gal : 0 ms
[2025-06-07 19:14:03] [INFO ] Time to serialize properties into /tmp/CTLFireability18111165872608418363.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11835206209870524755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18111165872608418363.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:14:33] [INFO ] Invariant cache hit.
[2025-06-07 19:14:33] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 522ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 523ms
[2025-06-07 19:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:14:33] [INFO ] Implicit Places using invariants in 26 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 554 ms. Remains : 16/18 places, 21/21 transitions.
[2025-06-07 19:14:33] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:14:33] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:14:33] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:14:33] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:14:33] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:14:33] [INFO ] Time to serialize gal into /tmp/CTLFireability1107885059674735511.gal : 1 ms
[2025-06-07 19:14:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15497577025651827283.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1107885059674735511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15497577025651827283.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,26.2161,290992,2,16443,5,1.00248e+06,6,0,109,1.03226e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-07 19:15:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:15:03] [INFO ] Applying decomposition
[2025-06-07 19:15:03] [INFO ] Flatten gal took : 1 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/graph8965481685020108807.txt' '-o' '/tmp/graph8965481685020108807.bin' '-w' '/tmp/graph8965481685020108807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8965481685020108807.bin' '-l' '-1' '-v' '-w' '/tmp/graph8965481685020108807.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:15:03] [INFO ] Decomposing Gal with order
[2025-06-07 19:15:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:15:03] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:15:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 19:15:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9806460811617158928.gal : 0 ms
[2025-06-07 19:15:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15364039914638822606.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9806460811617158928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15364039914638822606.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 19:15:34] [INFO ] Invariant cache hit.
[2025-06-07 19:15:34] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 487ms
[2025-06-07 19:15:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:15:34] [INFO ] Implicit Places using invariants in 28 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 16/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 519 ms. Remains : 16/18 places, 21/21 transitions.
[2025-06-07 19:15:34] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:15:34] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:15:34] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-07 19:15:34] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:15:34] [INFO ] Flatten gal took : 1 ms
[2025-06-07 19:15:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17855990433290901775.gal : 0 ms
[2025-06-07 19:15:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15812564152561185369.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17855990433290901775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15812564152561185369.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,10.0275,119560,2,10675,5,444434,6,0,109,470206,0


Converting to forward existential form...Done !
original formula: EG((A((((p0_1>=1)&&(p1_1>=1))&&(p2_1>=1)) U ((p3_1>=2)&&(p4_1>=1))) + (((p0_1>=1)&&(p1_1>=1))&&(p2_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(((p3_1>=2)&&(p4_1>=1))) U (!((((p0_1>=1)&&(p1_1>=1))&&(p2_1>=1))) * !(((p3_1>=2)&&(p4_1>=1)))...241
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
Detected timeout of ITS tools.
[2025-06-07 19:16:04] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:16:04] [INFO ] Applying decomposition
[2025-06-07 19:16:04] [INFO ] Flatten gal took : 1 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/graph18087547412768732314.txt' '-o' '/tmp/graph18087547412768732314.bin' '-w' '/tmp/graph18087547412768732314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18087547412768732314.bin' '-l' '-1' '-v' '-w' '/tmp/graph18087547412768732314.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:16:04] [INFO ] Decomposing Gal with order
[2025-06-07 19:16:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:16:04] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:16:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 19:16:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17347191716367130844.gal : 1 ms
[2025-06-07 19:16:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17963646060948661534.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17347191716367130844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17963646060948661534.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 19:16:34] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:16:34] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:16:34] [INFO ] Applying decomposition
[2025-06-07 19:16:34] [INFO ] Flatten gal took : 1 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/graph17538926968194838153.txt' '-o' '/tmp/graph17538926968194838153.bin' '-w' '/tmp/graph17538926968194838153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17538926968194838153.bin' '-l' '-1' '-v' '-w' '/tmp/graph17538926968194838153.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:16:34] [INFO ] Decomposing Gal with order
[2025-06-07 19:16:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:16:34] [INFO ] Flatten gal took : 2 ms
[2025-06-07 19:16:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 19:16:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16001074098394768352.gal : 1 ms
[2025-06-07 19:16:34] [INFO ] Time to serialize properties into /tmp/CTLFireability301975070873450907.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16001074098394768352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability301975070873450907.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,231.995,1505784,819,6374,382857,2.11917e+06,54,1.67049e+06,36,6.38746e+06,0


Converting to forward existential form...Done !
original formula: (E((AG(((((u3.p3_1>=1)&&(u5.p3_2>=1))&&((i0.u2.p0_3>=1)&&(i0.u2.p1_3>=1)))&&((i0.u2.p2_3>=1)&&(u3.p3_1>=1)))) * A(AF((u5.p4_2>=1)) U (((i...506
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,(!(E(TRUE U !(((((u3.p3_1>=1)&&(u5.p3_2>=1))&&((i0.u2.p0_3>=1)&&(i0.u2.p1_3>=1)))&&((i0.u2.p...1786
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t0, i0.u1.t1, i0.u2.t2, Intersection with reachable at each step enabled. (destroyed/r...189
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 3
(forward)formula 0,0,386.9,2312244,1,0,408054,2.11917e+06,315,1.26106e+07,643,1.64028e+07,58714
FORMULA Murphy-PT-D2N050-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: A(AX(!(((((((u5.p3_2>=2)&&(u5.p4_2>=1))||(u4.p4_3>=1))&&(u4.p3_3>=1))&&((i0.u2.p0_3>=1)&&(i0.u2.p1_3>=1)))&&(((i0.u1.p0_2>=3)&&(i0.u1.p2_...386
=> equivalent forward existential formula: [((Init * !(EG(!((EX((((((!(((i0.u1.p0_2>=3)&&(i0.u1.p2_2>=1))&&(u5.p4_2>=1)))||(u4.p3_3<1))&&(i0.u1.p0_2>=1))&&...2273
(forward)formula 1,0,638.517,3089268,1,0,763283,2.56191e+06,355,1.43521e+07,643,1.97255e+07,97996
FORMULA Murphy-PT-D2N050-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AX((((u3.p5_1>=3) + E(EG((u3.p5_1>=3)) U (u5.p4_2<1))) + ((((i0.u1.p0_2>=3)&&(i0.u1.p2_2>=1))&&(u5.p4_2>=1))||(((u3.p3_1<1)&&(((i0.u2.p0...449
=> equivalent forward existential formula: ([(((EY(Init) * !(((((i0.u1.p0_2>=3)&&(i0.u1.p2_2>=1))&&(u5.p4_2>=1))||(((u3.p3_1<1)&&(((i0.u2.p0_3<1)||(i0.u2.p...551
(forward)formula 2,0,640.725,3101428,1,0,763289,2.56191e+06,377,1.44599e+07,643,1.98333e+07,98321
FORMULA Murphy-PT-D2N050-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (EF((((((u4.p3_3>=2)&&(u4.p4_3>=1))&&((i0.u2.p0_3>=3)&&(i0.u2.p2_3>=1)))&&((u4.p4_3>=1)&&((u3.p5_1>=3)||(u4.p3_3>=1)))) + EX(((((u5.p3_2>...717
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((((u4.p3_3>=2)&&(u4.p4_3>=1))&&((i0.u2.p0_3>=3)&&(i0.u2.p2_3>=1)))&&((u4.p4_3>=1)&&((u3.p...1433
(forward)formula 3,0,640.729,3101428,1,0,763289,2.56191e+06,398,1.44599e+07,645,1.98333e+07,98326
FORMULA Murphy-PT-D2N050-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E((!(A((EG((((i0.u0.p0_1>=3)&&(i0.u0.p2_1>=1))&&(u3.p4_1>=1))) + AG((((i0.u1.p0_2>=1)&&(i0.u1.p1_2>=1))&&(i0.u1.p2_2>=1)))) U EG((((i0.u0...486
=> equivalent forward existential formula: [(((FwdU(FwdU(Init,(!(!((E(!(EG((((i0.u0.p0_1>=3)&&(i0.u0.p2_1>=1))&&(u3.p4_1>=1)))) U (!((EG((((i0.u0.p0_1>=3)&...700
(forward)formula 4,0,646.969,3110004,1,0,769936,2.56818e+06,408,1.44678e+07,645,1.98459e+07,99997
FORMULA Murphy-PT-D2N050-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX((EX(AG((((u4.p5_3<3)||(u5.p3_2<2))||(u5.p4_2<1)))) * (((((i0.u0.p0_1>=3)&&(i0.u0.p2_1>=1))&&((u3.p4_1>=1)&&((u3.p3_1<2)||(u3.p4_1<1)))...434
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(E(TRUE U !((((u4.p5_3<3)||(u5.p3_2<2))||(u5.p4_2<1))))))))] = FALSE * ([FwdG((EY(Init) * !(...959
(forward)formula 5,1,868.422,4885964,1,0,941755,3.52221e+06,188,2.54861e+07,561,3.27734e+07,12264
FORMULA Murphy-PT-D2N050-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(EF(EG(((((i0.u1.p0_2>=1)&&(i0.u1.p1_2>=1))&&((i0.u1.p2_2>=1)&&(i0.u2.p0_3>=1)))&&(i0.u2.p1_3>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(((((i0.u1.p0_2>=1)&&(i0.u1.p1_2>=1))&&((i0.u1.p2_2>=1)&&(i0.u2.p0_3>=1)))&&(i0...181
(forward)formula 6,1,893.995,4885964,1,0,941755,3.52221e+06,233,2.54861e+07,565,3.27734e+07,22682
FORMULA Murphy-PT-D2N050-CTLFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2025-06-07 19:40:07] [INFO ] Flatten gal took : 3 ms
[2025-06-07 19:40:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6146209151016989126.gal : 0 ms
[2025-06-07 19:40:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10763479339685401803.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6146209151016989126.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10763479339685401803.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15384e+10,27.7669,323752,2,28143,5,1.10859e+06,6,0,117,1.20586e+06,0


Converting to forward existential form...Done !
original formula: EG((A((((p0_1>=1)&&(p1_1>=1))&&(p2_1>=1)) U ((p3_1>=2)&&(p4_1>=1))) + (((p0_1>=1)&&(p1_1>=1))&&(p2_1>=1))))
=> equivalent forward existential formula: [FwdG(Init,(!((E(!(((p3_1>=2)&&(p4_1>=1))) U (!((((p0_1>=1)&&(p1_1>=1))&&(p2_1>=1))) * !(((p3_1>=2)&&(p4_1>=1)))...241
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...171
(forward)formula 0,1,776.49,2716232,1,0,224,1.33216e+07,13,199,1661,1.83095e+07,182
FORMULA Murphy-PT-D2N050-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2833107 ms.

BK_STOP 1749325985984

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="Murphy-PT-D2N050"
export BK_EXAMINATION="CTLFireability"
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 Murphy-PT-D2N050, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524800578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N050.tgz
mv Murphy-PT-D2N050 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;