About the Execution of ITS-Tools for DBSingleClientW-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 827201.00 | 0.00 | 0.00 | TFFFFTFFTTTTTFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063400058.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 DBSingleClientW-PT-d1m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063400058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m04-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d1m04-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748567738928
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 01:15:41] [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-05-30 01:15:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:15:42] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2025-05-30 01:15:42] [INFO ] Transformed 1440 places.
[2025-05-30 01:15:42] [INFO ] Transformed 672 transitions.
[2025-05-30 01:15:42] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 541 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Deduced a syphon composed of 1093 places in 14 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 84 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 160 place count 267 transition count 507
Iterating global reduction 1 with 59 rules applied. Total rules applied 219 place count 267 transition count 507
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 246 place count 267 transition count 480
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 282 place count 231 transition count 444
Iterating global reduction 2 with 36 rules applied. Total rules applied 318 place count 231 transition count 444
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 331 place count 218 transition count 430
Iterating global reduction 2 with 13 rules applied. Total rules applied 344 place count 218 transition count 430
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 358 place count 218 transition count 416
Applied a total of 358 rules in 177 ms. Remains 218 /347 variables (removed 129) and now considering 416/672 (removed 256) transitions.
// Phase 1: matrix 416 rows 218 cols
[2025-05-30 01:15:42] [INFO ] Computed 2 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:15:43] [INFO ] Implicit Places using invariants in 582 ms returned []
[2025-05-30 01:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:15:43] [INFO ] State equation strengthened by 224 read => feed constraints.
[2025-05-30 01:15:45] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 3080 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-05-30 01:15:45] [INFO ] Invariant cache hit.
[2025-05-30 01:15:45] [INFO ] State equation strengthened by 224 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 416/634 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 224/444 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 634/634 variables, and 444 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 416/634 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 224/444 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 415/859 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/634 variables, and 859 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 224/224 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61276ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 61304ms
Starting structural reductions in LTL mode, iteration 1 : 218/347 places, 416/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64612 ms. Remains : 218/347 places, 416/672 transitions.
Support contains 84 out of 218 places after structural reductions.
[2025-05-30 01:16:47] [INFO ] Flatten gal took : 129 ms
[2025-05-30 01:16:47] [INFO ] Flatten gal took : 71 ms
[2025-05-30 01:16:47] [INFO ] Input system was already deterministic with 416 transitions.
Support contains 83 out of 218 places (down from 84) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 65 to 63
RANDOM walk for 40000 steps (9202 resets) in 4664 ms. (8 steps per ms) remains 47/63 properties
BEST_FIRST walk for 4004 steps (189 resets) in 52 ms. (75 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (171 resets) in 49 ms. (80 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (179 resets) in 47 ms. (83 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (170 resets) in 60 ms. (65 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (421 resets) in 44 ms. (88 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (182 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (216 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (189 resets) in 23 ms. (166 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (196 resets) in 36 ms. (108 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (183 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (187 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (374 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (172 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (209 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (183 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (180 resets) in 21 ms. (182 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (186 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (181 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (175 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (196 resets) in 31 ms. (125 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (185 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (369 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (203 resets) in 67 ms. (58 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (196 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (191 resets) in 25 ms. (154 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (409 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (195 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (373 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (196 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (202 resets) in 34 ms. (114 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (192 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (202 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (204 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (371 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (170 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (186 resets) in 117 ms. (33 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (194 resets) in 43 ms. (90 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (392 resets) in 60 ms. (65 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (184 resets) in 46 ms. (85 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (621 resets) in 68 ms. (58 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (174 resets) in 43 ms. (91 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (392 resets) in 59 ms. (66 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (178 resets) in 40 ms. (97 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (401 resets) in 58 ms. (67 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (193 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (408 resets) in 54 ms. (72 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (191 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
[2025-05-30 01:16:49] [INFO ] Invariant cache hit.
[2025-05-30 01:16:49] [INFO ] State equation strengthened by 224 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/131 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 45 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 42/173 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 385/558 variables, 173/175 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 193/368 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/634 variables, and 368 constraints, problems are : Problem set: 2 solved, 45 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/218 constraints, ReadFeed: 193/224 constraints, PredecessorRefiner: 47/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 68/131 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:55] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:55] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:55] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:56] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 4/5 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:56] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:16:56] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 42/173 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 385/558 variables, 173/181 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 193/374 constraints. Problems are: Problem set: 2 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 1/375 constraints. Problems are: Problem set: 2 solved, 45 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/634 variables, and 375 constraints, problems are : Problem set: 2 solved, 45 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/218 constraints, ReadFeed: 193/224 constraints, PredecessorRefiner: 3/45 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10203ms problems are : Problem set: 2 solved, 45 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 211 transition count 405
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 211 transition count 405
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 208 transition count 402
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 208 transition count 402
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 208 transition count 399
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 207 transition count 397
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 207 transition count 397
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 207 transition count 395
Applied a total of 27 rules in 128 ms. Remains 207 /218 variables (removed 11) and now considering 395/416 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 207/218 places, 395/416 transitions.
RANDOM walk for 40000 steps (9182 resets) in 1320 ms. (30 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (185 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (164 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (175 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (180 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (195 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (185 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (176 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (166 resets) in 48 ms. (81 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (181 resets) in 27 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (175 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (389 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (193 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (191 resets) in 67 ms. (58 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (195 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (205 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (188 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (181 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (196 resets) in 39 ms. (100 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (185 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (177 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (409 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (179 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (190 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (197 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (399 resets) in 39 ms. (100 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (165 resets) in 28 ms. (138 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (363 resets) in 28 ms. (137 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (165 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (177 resets) in 44 ms. (88 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (195 resets) in 45 ms. (87 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (194 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (160 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (413 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (187 resets) in 22 ms. (174 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (190 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (188 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (391 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (607 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (203 resets) in 27 ms. (143 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (388 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (191 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (397 resets) in 42 ms. (93 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (197 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (411 resets) in 45 ms. (87 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (191 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
Probably explored full state space saw : 65323 states, properties seen :43
Probabilistic random walk after 169015 steps, saw 65323 distinct states, run finished after 1610 ms. (steps per millisecond=104 ) properties seen :43
Explored full state space saw : 65476 states, properties seen :0
Exhaustive walk after 169267 steps, saw 65476 distinct states, run finished after 1011 ms. (steps per millisecond=167 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2025-05-30 01:17:03] [INFO ] Flatten gal took : 46 ms
[2025-05-30 01:17:04] [INFO ] Flatten gal took : 45 ms
[2025-05-30 01:17:04] [INFO ] Input system was already deterministic with 416 transitions.
Support contains 76 out of 218 places (down from 77) after GAL structural reductions.
Computed a total of 5 stabilizing places and 34 stable transitions
Graph (complete) has 838 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 171 transition count 258
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 171 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 171 transition count 255
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 135 place count 133 transition count 212
Iterating global reduction 1 with 38 rules applied. Total rules applied 173 place count 133 transition count 212
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 182 place count 133 transition count 203
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 207 place count 108 transition count 160
Iterating global reduction 2 with 25 rules applied. Total rules applied 232 place count 108 transition count 160
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 244 place count 108 transition count 148
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 255 place count 97 transition count 129
Iterating global reduction 3 with 11 rules applied. Total rules applied 266 place count 97 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 268 place count 97 transition count 127
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 276 place count 89 transition count 119
Iterating global reduction 4 with 8 rules applied. Total rules applied 284 place count 89 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 287 place count 89 transition count 116
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 293 place count 83 transition count 104
Iterating global reduction 5 with 6 rules applied. Total rules applied 299 place count 83 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 302 place count 83 transition count 101
Applied a total of 302 rules in 24 ms. Remains 83 /218 variables (removed 135) and now considering 101/416 (removed 315) transitions.
// Phase 1: matrix 101 rows 83 cols
[2025-05-30 01:17:04] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:17:04] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-30 01:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:17:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 01:17:04] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-05-30 01:17:04] [INFO ] Invariant cache hit.
[2025-05-30 01:17:04] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 19809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25259ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 25262ms
Starting structural reductions in LTL mode, iteration 1 : 83/218 places, 101/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25633 ms. Remains : 83/218 places, 101/416 transitions.
[2025-05-30 01:17:29] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:17:29] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:17:29] [INFO ] Input system was already deterministic with 101 transitions.
[2025-05-30 01:17:29] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:17:29] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:17:29] [INFO ] Time to serialize gal into /tmp/CTLFireability11665551516827689262.gal : 4 ms
[2025-05-30 01:17:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8074291013879474333.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11665551516827689262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8074291013879474333.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,8831,0.301151,10740,2,2790,5,24923,6,0,433,19119,0
Converting to forward existential form...Done !
original formula: AF(AX(((s1>=1)&&(l954>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(((s1>=1)&&(l954>=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t63, t70, t71, t72, t73, t74, t75, t76, t77, t78, t...364
(forward)formula 0,0,1.68353,38936,1,0,330,149169,225,169,2961,134574,311
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-00 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 : 218/218 places, 416/416 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 173 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 173 transition count 264
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 173 transition count 260
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 128 place count 139 transition count 221
Iterating global reduction 1 with 34 rules applied. Total rules applied 162 place count 139 transition count 221
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 171 place count 139 transition count 212
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 193 place count 117 transition count 176
Iterating global reduction 2 with 22 rules applied. Total rules applied 215 place count 117 transition count 176
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 226 place count 117 transition count 165
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 235 place count 108 transition count 148
Iterating global reduction 3 with 9 rules applied. Total rules applied 244 place count 108 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 248 place count 108 transition count 144
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 254 place count 102 transition count 138
Iterating global reduction 4 with 6 rules applied. Total rules applied 260 place count 102 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 102 transition count 137
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 265 place count 98 transition count 128
Iterating global reduction 5 with 4 rules applied. Total rules applied 269 place count 98 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 98 transition count 127
Applied a total of 270 rules in 27 ms. Remains 98 /218 variables (removed 120) and now considering 127/416 (removed 289) transitions.
// Phase 1: matrix 127 rows 98 cols
[2025-05-30 01:17:31] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:17:31] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-05-30 01:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:17:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-30 01:17:32] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-05-30 01:17:32] [INFO ] Invariant cache hit.
[2025-05-30 01:17:32] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/225 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 40/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:17:37] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 141 constraints, problems are : Problem set: 0 solved, 126 unsolved in 10193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/225 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 126/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 267 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40258ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 40260ms
Starting structural reductions in LTL mode, iteration 1 : 98/218 places, 127/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41102 ms. Remains : 98/218 places, 127/416 transitions.
[2025-05-30 01:18:12] [INFO ] Flatten gal took : 17 ms
[2025-05-30 01:18:12] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:18:12] [INFO ] Input system was already deterministic with 127 transitions.
[2025-05-30 01:18:12] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:18:12] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:18:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6723955397196880110.gal : 5 ms
[2025-05-30 01:18:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12790231891786448182.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/CTLFireability6723955397196880110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12790231891786448182.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,15836,0.79009,19512,2,4540,5,47966,6,0,519,40035,0
Converting to forward existential form...Done !
original formula: E(EX(!((((AF(((s1>=1)&&(l1240>=1))) * (s1>=1)) * ((l1223>=1)&&(s1>=1))) * (l946>=1)))) U ((s1>=1)&&(l451>=1)))
=> equivalent forward existential formula: [(FwdU(Init,EX(!((((!(EG(!(((s1>=1)&&(l1240>=1))))) * (s1>=1)) * ((l1223>=1)&&(s1>=1))) * (l946>=1))))) * ((s1>=...180
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t32, t41, t47, t48, t49, t51, t57, t58, t78, t79, t86, t87, t90, t91, t...455
(forward)formula 0,1,4.66782,100564,1,0,461,451178,285,227,3533,365292,508
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 178 transition count 294
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 178 transition count 294
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 86 place count 178 transition count 288
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 119 place count 145 transition count 250
Iterating global reduction 1 with 33 rules applied. Total rules applied 152 place count 145 transition count 250
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 160 place count 145 transition count 242
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 180 place count 125 transition count 208
Iterating global reduction 2 with 20 rules applied. Total rules applied 200 place count 125 transition count 208
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 212 place count 125 transition count 196
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 222 place count 115 transition count 179
Iterating global reduction 3 with 10 rules applied. Total rules applied 232 place count 115 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 236 place count 115 transition count 175
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 242 place count 109 transition count 169
Iterating global reduction 4 with 6 rules applied. Total rules applied 248 place count 109 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 251 place count 109 transition count 166
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 255 place count 105 transition count 156
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 105 transition count 156
Applied a total of 259 rules in 14 ms. Remains 105 /218 variables (removed 113) and now considering 156/416 (removed 260) transitions.
// Phase 1: matrix 156 rows 105 cols
[2025-05-30 01:18:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:17] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-05-30 01:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-05-30 01:18:18] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2025-05-30 01:18:18] [INFO ] Invariant cache hit.
[2025-05-30 01:18:18] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 156/261 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 66/173 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:24] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:24] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:24] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:24] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:31] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/261 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:34] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:34] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 18 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 0/261 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 180 constraints, problems are : Problem set: 0 solved, 155 unsolved in 25597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 156/261 variables, 105/114 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 66/180 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 155/335 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 335 constraints, problems are : Problem set: 0 solved, 155 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55723ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 55724ms
Starting structural reductions in LTL mode, iteration 1 : 105/218 places, 156/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56360 ms. Remains : 105/218 places, 156/416 transitions.
[2025-05-30 01:19:13] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:19:13] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:19:13] [INFO ] Input system was already deterministic with 156 transitions.
[2025-05-30 01:19:13] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:19:13] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:19:13] [INFO ] Time to serialize gal into /tmp/CTLFireability12097395380149305935.gal : 3 ms
[2025-05-30 01:19:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1348824594657333446.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/CTLFireability12097395380149305935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1348824594657333446.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,17411,0.61323,22596,2,3998,5,55760,6,0,576,34939,0
Converting to forward existential form...Done !
original formula: E((((s1>=1)&&(l1218>=1)) * (AX(!(A(((s1>=1)&&(l1223>=1)) U ((s1>=1)&&(l1224>=1))))) + EG(((p80>=1)&&(l0>=1))))) U AX(AX(((EX(((s1>=1)&&(l...244
=> equivalent forward existential formula: [(FwdU(Init,(((s1>=1)&&(l1218>=1)) * (!(EX(!(!(!((E(!(((s1>=1)&&(l1224>=1))) U (!(((s1>=1)&&(l1223>=1))) * !(((s...385
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t39, t40, t41, t42, t43, t44, t45, t51, t52, t53, t57,...576
(forward)formula 0,0,4.4601,96364,1,0,450,470744,357,189,4040,275678,538
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 176 transition count 279
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 176 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 89 place count 176 transition count 274
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 123 place count 142 transition count 235
Iterating global reduction 1 with 34 rules applied. Total rules applied 157 place count 142 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 162 place count 142 transition count 230
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 183 place count 121 transition count 194
Iterating global reduction 2 with 21 rules applied. Total rules applied 204 place count 121 transition count 194
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 214 place count 121 transition count 184
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 223 place count 112 transition count 169
Iterating global reduction 3 with 9 rules applied. Total rules applied 232 place count 112 transition count 169
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 239 place count 105 transition count 162
Iterating global reduction 3 with 7 rules applied. Total rules applied 246 place count 105 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 249 place count 105 transition count 159
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 253 place count 101 transition count 150
Iterating global reduction 4 with 4 rules applied. Total rules applied 257 place count 101 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 259 place count 101 transition count 148
Applied a total of 259 rules in 14 ms. Remains 101 /218 variables (removed 117) and now considering 148/416 (removed 268) transitions.
// Phase 1: matrix 148 rows 101 cols
[2025-05-30 01:19:18] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:18] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-30 01:19:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 01:19:19] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2025-05-30 01:19:19] [INFO ] Invariant cache hit.
[2025-05-30 01:19:19] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/249 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 60/163 constraints. Problems are: Problem set: 0 solved, 147 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 163 constraints, problems are : Problem set: 0 solved, 147 unsolved in 9956 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/249 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 60/163 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 147/310 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/249 variables, and 310 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40100ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 40101ms
Starting structural reductions in LTL mode, iteration 1 : 101/218 places, 148/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40976 ms. Remains : 101/218 places, 148/416 transitions.
[2025-05-30 01:19:59] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:19:59] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:19:59] [INFO ] Input system was already deterministic with 148 transitions.
[2025-05-30 01:19:59] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:19:59] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2540671712269355992.gal : 3 ms
[2025-05-30 01:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability13166413739241521850.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/CTLFireability2540671712269355992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13166413739241521850.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,13559,0.966484,24140,2,4111,5,65439,6,0,552,41058,0
Converting to forward existential form...Done !
original formula: (AF((AX(FALSE) * E((((s1>=1)&&(l1217>=1))||((s1>=1)&&(l35>=1))) U ((s1>=1)&&(l1216>=1))))) * !(A((AX(((p107>=1)&&(l0>=1))) + !(AG(AX(((s1...267
=> equivalent forward existential formula: ([FwdG(Init,!((!(EX(!(FALSE))) * E((((s1>=1)&&(l1217>=1))||((s1>=1)&&(l35>=1))) U ((s1>=1)&&(l1216>=1))))))] = F...580
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t48, t49, t55, t56, t58, t68, t69, t70, t71, t72, t...518
(forward)formula 0,0,4.60479,91920,1,0,354,372104,338,153,4015,229307,429
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 173 transition count 268
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 173 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 93 place count 173 transition count 265
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 129 place count 137 transition count 224
Iterating global reduction 1 with 36 rules applied. Total rules applied 165 place count 137 transition count 224
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 174 place count 137 transition count 215
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 196 place count 115 transition count 176
Iterating global reduction 2 with 22 rules applied. Total rules applied 218 place count 115 transition count 176
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 229 place count 115 transition count 165
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 238 place count 106 transition count 152
Iterating global reduction 3 with 9 rules applied. Total rules applied 247 place count 106 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 249 place count 106 transition count 150
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 254 place count 101 transition count 145
Iterating global reduction 4 with 5 rules applied. Total rules applied 259 place count 101 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 262 place count 101 transition count 142
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 265 place count 98 transition count 133
Iterating global reduction 5 with 3 rules applied. Total rules applied 268 place count 98 transition count 133
Applied a total of 268 rules in 17 ms. Remains 98 /218 variables (removed 120) and now considering 133/416 (removed 283) transitions.
// Phase 1: matrix 133 rows 98 cols
[2025-05-30 01:20:04] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:20:04] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 01:20:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:20:04] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-30 01:20:04] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-05-30 01:20:04] [INFO ] Invariant cache hit.
[2025-05-30 01:20:04] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/231 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 47/147 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 147 constraints, problems are : Problem set: 0 solved, 132 unsolved in 7597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/231 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 47/147 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 132/279 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 279 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37700ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 37702ms
Starting structural reductions in LTL mode, iteration 1 : 98/218 places, 133/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38471 ms. Remains : 98/218 places, 133/416 transitions.
[2025-05-30 01:20:42] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:20:42] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:20:42] [INFO ] Input system was already deterministic with 133 transitions.
[2025-05-30 01:20:42] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:20:42] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:20:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13538030441704053192.gal : 2 ms
[2025-05-30 01:20:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4968769061420009628.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/CTLFireability13538030441704053192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4968769061420009628.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,16412,1.03697,24656,2,4649,5,66452,6,0,525,54450,0
Converting to forward existential form...Done !
original formula: EG((EF(((s1<1)||(l951<1))) + AX(EX((((s1<1)||(l1282<1))&&((s1<1)||(l1226<1)))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((s1<1)||(l951<1))) + !(EX(!(EX((((s1<1)||(l1282<1))&&((s1<1)||(l1226<1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t50, t57, t58, t59, t75, t76, t77, t78, t79, t80, t...521
(forward)formula 0,1,3.62868,79032,1,0,284,280305,292,110,3808,189028,302
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 172 transition count 269
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 172 transition count 269
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 172 transition count 265
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 134 place count 134 transition count 222
Iterating global reduction 1 with 38 rules applied. Total rules applied 172 place count 134 transition count 222
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 183 place count 134 transition count 211
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 208 place count 109 transition count 168
Iterating global reduction 2 with 25 rules applied. Total rules applied 233 place count 109 transition count 168
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 247 place count 109 transition count 154
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 258 place count 98 transition count 135
Iterating global reduction 3 with 11 rules applied. Total rules applied 269 place count 98 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 98 transition count 133
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 279 place count 90 transition count 125
Iterating global reduction 4 with 8 rules applied. Total rules applied 287 place count 90 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 290 place count 90 transition count 122
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 296 place count 84 transition count 110
Iterating global reduction 5 with 6 rules applied. Total rules applied 302 place count 84 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 305 place count 84 transition count 107
Applied a total of 305 rules in 33 ms. Remains 84 /218 variables (removed 134) and now considering 107/416 (removed 309) transitions.
// Phase 1: matrix 107 rows 84 cols
[2025-05-30 01:20:46] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:20:46] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-05-30 01:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:20:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-30 01:20:46] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:20:46] [INFO ] Redundant transitions in 4 ms returned []
Running 106 sub problems to find dead transitions.
[2025-05-30 01:20:46] [INFO ] Invariant cache hit.
[2025-05-30 01:20:46] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:50] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:51] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:51] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:51] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 127 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/191 variables, 84/90 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 37/127 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 106/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 233 constraints, problems are : Problem set: 0 solved, 106 unsolved in 21625 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29827ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 29828ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/218 places, 107/416 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30415 ms. Remains : 84/218 places, 107/416 transitions.
[2025-05-30 01:21:16] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:21:16] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:21:16] [INFO ] Input system was already deterministic with 107 transitions.
[2025-05-30 01:21:16] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:21:16] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:21:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6418896163731289.gal : 1 ms
[2025-05-30 01:21:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14198138178674919307.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/CTLFireability6418896163731289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14198138178674919307.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 -...281
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,9013,0.238489,10232,2,2773,5,22702,6,0,443,16392,0
Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l608<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l608<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/105
(forward)formula 0,1,1.45235,36304,1,0,20,125645,19,4,2312,83445,16
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 175 transition count 274
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 175 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 90 place count 175 transition count 270
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 124 place count 141 transition count 231
Iterating global reduction 1 with 34 rules applied. Total rules applied 158 place count 141 transition count 231
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 165 place count 141 transition count 224
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 185 place count 121 transition count 190
Iterating global reduction 2 with 20 rules applied. Total rules applied 205 place count 121 transition count 190
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 214 place count 121 transition count 181
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 223 place count 112 transition count 166
Iterating global reduction 3 with 9 rules applied. Total rules applied 232 place count 112 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 234 place count 112 transition count 164
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 239 place count 107 transition count 159
Iterating global reduction 4 with 5 rules applied. Total rules applied 244 place count 107 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 247 place count 107 transition count 156
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 249 place count 105 transition count 153
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 105 transition count 153
Applied a total of 251 rules in 12 ms. Remains 105 /218 variables (removed 113) and now considering 153/416 (removed 263) transitions.
// Phase 1: matrix 153 rows 105 cols
[2025-05-30 01:21:18] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:18] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-30 01:21:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:18] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 01:21:19] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-30 01:21:19] [INFO ] Invariant cache hit.
[2025-05-30 01:21:19] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/258 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 61/168 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:26] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:26] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:26] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:27] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:27] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:27] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:27] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:31] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:37] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:37] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 7 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/258 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 178 constraints, problems are : Problem set: 0 solved, 152 unsolved in 25853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/258 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 61/178 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 152/330 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 330 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55972ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 55973ms
Starting structural reductions in LTL mode, iteration 1 : 105/218 places, 153/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56657 ms. Remains : 105/218 places, 153/416 transitions.
[2025-05-30 01:22:15] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:22:15] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:22:15] [INFO ] Input system was already deterministic with 153 transitions.
[2025-05-30 01:22:15] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:22:15] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:22:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8700779957748543592.gal : 3 ms
[2025-05-30 01:22:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4202177925240389497.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/CTLFireability8700779957748543592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4202177925240389497.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,17873,1.19748,26092,2,5234,5,72008,6,0,573,53291,0
Converting to forward existential form...Done !
original formula: E(((s1>=1)&&(l945>=1)) U E(AX(A(((s1>=1)&&(l545>=1)) U !(((s1>=1)&&(l1223>=1))))) U EF((!(AX(((s1>=1)&&(l1027>=1)))) * AF(((s1>=1)&&(l128...166
=> equivalent forward existential formula: [((FwdU(FwdU(FwdU(Init,((s1>=1)&&(l945>=1))),!(EX(!(!((E(!(!(((s1>=1)&&(l1223>=1)))) U (!(((s1>=1)&&(l545>=1))) ...315
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t42, t43, t44, t45, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...593
Hit Full ! (commute/partial/dont) 3/147/150
(forward)formula 0,1,7.26179,144852,1,0,521,648170,352,254,4258,457545,606
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 173 transition count 274
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 173 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 173 transition count 270
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 131 place count 136 transition count 228
Iterating global reduction 1 with 37 rules applied. Total rules applied 168 place count 136 transition count 228
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 179 place count 136 transition count 217
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 203 place count 112 transition count 175
Iterating global reduction 2 with 24 rules applied. Total rules applied 227 place count 112 transition count 175
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 241 place count 112 transition count 161
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 251 place count 102 transition count 146
Iterating global reduction 3 with 10 rules applied. Total rules applied 261 place count 102 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 263 place count 102 transition count 144
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 269 place count 96 transition count 138
Iterating global reduction 4 with 6 rules applied. Total rules applied 275 place count 96 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 277 place count 96 transition count 136
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 282 place count 91 transition count 125
Iterating global reduction 5 with 5 rules applied. Total rules applied 287 place count 91 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 290 place count 91 transition count 122
Applied a total of 290 rules in 11 ms. Remains 91 /218 variables (removed 127) and now considering 122/416 (removed 294) transitions.
// Phase 1: matrix 122 rows 91 cols
[2025-05-30 01:22:22] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:22:22] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-05-30 01:22:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:22:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-30 01:22:22] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-05-30 01:22:23] [INFO ] Invariant cache hit.
[2025-05-30 01:22:23] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/213 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 44/137 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:29] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:29] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:29] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 18 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/213 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:31] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:31] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:31] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:31] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:31] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 145 constraints, problems are : Problem set: 0 solved, 121 unsolved in 13415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/213 variables, 91/101 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 44/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 121/266 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 266 constraints, problems are : Problem set: 0 solved, 121 unsolved in 28829 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42324ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 42326ms
Starting structural reductions in LTL mode, iteration 1 : 91/218 places, 122/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42935 ms. Remains : 91/218 places, 122/416 transitions.
[2025-05-30 01:23:05] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:23:05] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:23:05] [INFO ] Input system was already deterministic with 122 transitions.
[2025-05-30 01:23:05] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:23:05] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:23:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8482784093131330932.gal : 2 ms
[2025-05-30 01:23:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7993352926599808577.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/CTLFireability8482784093131330932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7993352926599808577.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,11950,0.566011,14916,2,3572,5,38256,6,0,486,30502,0
Converting to forward existential form...Done !
original formula: A(!(AF((!(E(((s1>=1)&&(l1229>=1)) U ((p63>=1)&&(l613>=1)))) * EF(((s1>=1)&&(l612>=1)))))) U EX(!(EF(EG(((p96>=1)&&(l0>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U EG(((p96>=1)&&(l0>=1)))))))))) * !(E(!(EX(!(E(TRUE U EG(((p96>=1)&&(l0>=1))))))) ...320
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t48, t49, t50, t51, t52, t53, t71, t73, t74, t75, t...485
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.73635,73808,1,0,369,326299,286,174,3428,219699,435
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 176 transition count 276
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 176 transition count 276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 88 place count 176 transition count 272
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 123 place count 141 transition count 232
Iterating global reduction 1 with 35 rules applied. Total rules applied 158 place count 141 transition count 232
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 167 place count 141 transition count 223
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 187 place count 121 transition count 189
Iterating global reduction 2 with 20 rules applied. Total rules applied 207 place count 121 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 216 place count 121 transition count 180
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 226 place count 111 transition count 163
Iterating global reduction 3 with 10 rules applied. Total rules applied 236 place count 111 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 239 place count 111 transition count 160
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 245 place count 105 transition count 154
Iterating global reduction 4 with 6 rules applied. Total rules applied 251 place count 105 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 254 place count 105 transition count 151
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 257 place count 102 transition count 147
Iterating global reduction 5 with 3 rules applied. Total rules applied 260 place count 102 transition count 147
Applied a total of 260 rules in 13 ms. Remains 102 /218 variables (removed 116) and now considering 147/416 (removed 269) transitions.
// Phase 1: matrix 147 rows 102 cols
[2025-05-30 01:23:08] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:23:08] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-05-30 01:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:23:08] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 01:23:08] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-05-30 01:23:08] [INFO ] Invariant cache hit.
[2025-05-30 01:23:08] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/249 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 60/164 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 164 constraints, problems are : Problem set: 0 solved, 146 unsolved in 13132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/249 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 60/164 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 146/310 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/249 variables, and 310 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43242ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 43242ms
Starting structural reductions in LTL mode, iteration 1 : 102/218 places, 147/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43948 ms. Remains : 102/218 places, 147/416 transitions.
[2025-05-30 01:23:52] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:23:52] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:23:52] [INFO ] Input system was already deterministic with 147 transitions.
[2025-05-30 01:23:52] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:23:52] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:23:52] [INFO ] Time to serialize gal into /tmp/CTLFireability17179685236611321065.gal : 2 ms
[2025-05-30 01:23:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1581776148560635073.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/CTLFireability17179685236611321065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1581776148560635073.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,16689,1.20561,25544,2,4840,5,69117,6,0,555,54030,0
Converting to forward existential form...Done !
original formula: EF((((s1>=1)&&(l412>=1)) + (((AG(((s1>=1)&&(l320>=1))) * EX(((s1>=1)&&(l36>=1)))) * ((s1>=1)&&(l945>=1))) * ((AF(((s1<1)||(l607<1))) + (l...211
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((s1>=1)&&(l412>=1)))] != FALSE + ([(EY(((FwdU(Init,TRUE) * ((!(E(TRUE U !(((s1>=1)&&(l320>...485
(forward)formula 0,1,1.21073,25544,1,0,7,69117,8,1,559,54030,1
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 173 transition count 268
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 173 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 93 place count 173 transition count 265
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 129 place count 137 transition count 224
Iterating global reduction 1 with 36 rules applied. Total rules applied 165 place count 137 transition count 224
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 174 place count 137 transition count 215
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 198 place count 113 transition count 173
Iterating global reduction 2 with 24 rules applied. Total rules applied 222 place count 113 transition count 173
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 234 place count 113 transition count 161
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 244 place count 103 transition count 146
Iterating global reduction 3 with 10 rules applied. Total rules applied 254 place count 103 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 256 place count 103 transition count 144
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 263 place count 96 transition count 137
Iterating global reduction 4 with 7 rules applied. Total rules applied 270 place count 96 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 273 place count 96 transition count 134
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 278 place count 91 transition count 123
Iterating global reduction 5 with 5 rules applied. Total rules applied 283 place count 91 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 286 place count 91 transition count 120
Applied a total of 286 rules in 45 ms. Remains 91 /218 variables (removed 127) and now considering 120/416 (removed 296) transitions.
// Phase 1: matrix 120 rows 91 cols
[2025-05-30 01:23:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:23:53] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-30 01:23:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:23:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-30 01:23:53] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:23:53] [INFO ] Redundant transitions in 4 ms returned []
Running 119 sub problems to find dead transitions.
[2025-05-30 01:23:53] [INFO ] Invariant cache hit.
[2025-05-30 01:23:53] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/211 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 44/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:23:58] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:23:58] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:23:58] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:23:59] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:01] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:02] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 143 constraints, problems are : Problem set: 0 solved, 119 unsolved in 13299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/211 variables, 91/99 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 44/143 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 119/262 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/211 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 262 constraints, problems are : Problem set: 0 solved, 119 unsolved in 18823 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32184ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 32185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/218 places, 120/416 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32747 ms. Remains : 91/218 places, 120/416 transitions.
[2025-05-30 01:24:26] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:24:26] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:24:26] [INFO ] Input system was already deterministic with 120 transitions.
[2025-05-30 01:24:26] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:24:26] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:24:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7991930807612653009.gal : 2 ms
[2025-05-30 01:24:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5412073624709543448.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/CTLFireability7991930807612653009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5412073624709543448.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,11480,0.678937,15788,2,3710,5,42825,6,0,484,31072,0
Converting to forward existential form...Done !
original formula: A(!(((s3>=1)&&(l0>=1))) U AF(((AG(((s1>=1)&&(l1232>=1))) * (s1>=1)) * (l1238>=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((!(E(TRUE U !(((s1>=1)&&(l1232>=1))))) * (s1>=1)) * (l1238>=1))))))))) * !(E(!(!(EG(!((...344
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t64, t66, t67, t68, t69, t70, t72, t73, t74, t75, t...473
(forward)formula 0,0,3.15414,65040,1,0,286,284620,268,118,3387,163472,322
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-09 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 : 218/218 places, 416/416 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 178 transition count 290
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 178 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 178 transition count 286
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 119 place count 143 transition count 246
Iterating global reduction 1 with 35 rules applied. Total rules applied 154 place count 143 transition count 246
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 164 place count 143 transition count 236
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 182 place count 125 transition count 205
Iterating global reduction 2 with 18 rules applied. Total rules applied 200 place count 125 transition count 205
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 212 place count 125 transition count 193
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 219 place count 118 transition count 182
Iterating global reduction 3 with 7 rules applied. Total rules applied 226 place count 118 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 118 transition count 181
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 233 place count 112 transition count 175
Iterating global reduction 4 with 6 rules applied. Total rules applied 239 place count 112 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 241 place count 112 transition count 173
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 245 place count 108 transition count 168
Iterating global reduction 5 with 4 rules applied. Total rules applied 249 place count 108 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 252 place count 108 transition count 165
Applied a total of 252 rules in 8 ms. Remains 108 /218 variables (removed 110) and now considering 165/416 (removed 251) transitions.
// Phase 1: matrix 165 rows 108 cols
[2025-05-30 01:24:29] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:24:29] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-30 01:24:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:24:29] [INFO ] State equation strengthened by 70 read => feed constraints.
[2025-05-30 01:24:30] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-05-30 01:24:30] [INFO ] Invariant cache hit.
[2025-05-30 01:24:30] [INFO ] State equation strengthened by 70 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/273 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 70/180 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:36] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:37] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:37] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:37] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:37] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:37] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 6/186 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:42] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:42] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:43] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:43] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:43] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:44] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 15 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/273 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:47] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:24:52] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 7 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/273 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 0/273 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 194 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 165/273 variables, 108/124 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 70/194 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 164/358 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 358 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 108/218 places, 165/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60904 ms. Remains : 108/218 places, 165/416 transitions.
[2025-05-30 01:25:30] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:25:30] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:25:30] [INFO ] Input system was already deterministic with 165 transitions.
[2025-05-30 01:25:30] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:25:30] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:25:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10275931915124671031.gal : 2 ms
[2025-05-30 01:25:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14690105906370594223.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/CTLFireability10275931915124671031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14690105906370594223.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,16179,0.676129,20040,2,5060,5,48825,6,0,597,39769,0
Converting to forward existential form...Done !
original formula: EX((!(E(!(E(((s1>=1)&&(l455>=1)) U ((s1>=1)&&(l546>=1)))) U (((EG(((p105>=1)&&(l0>=1))) * AG(((s1>=1)&&(l610>=1)))) * ((s1>=1)&&(l304>=1)...285
=> equivalent forward existential formula: ((([((EY(Init) * !(E(!(E(((s1>=1)&&(l455>=1)) U ((s1>=1)&&(l546>=1)))) U (((EG(((p105>=1)&&(l0>=1))) * !(E(TRUE ...960
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t18, t19, t20, t34, t35, t36, t39, t40, t41, t49, t50, t51, t52, t53, t...720
(forward)formula 0,1,2.58074,63080,1,0,329,210195,367,120,4222,105704,357
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 172 transition count 263
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 172 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 172 transition count 260
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 132 place count 135 transition count 218
Iterating global reduction 1 with 37 rules applied. Total rules applied 169 place count 135 transition count 218
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 178 place count 135 transition count 209
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 202 place count 111 transition count 167
Iterating global reduction 2 with 24 rules applied. Total rules applied 226 place count 111 transition count 167
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 238 place count 111 transition count 155
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 248 place count 101 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 258 place count 101 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 260 place count 101 transition count 138
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 267 place count 94 transition count 131
Iterating global reduction 4 with 7 rules applied. Total rules applied 274 place count 94 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 277 place count 94 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 282 place count 89 transition count 117
Iterating global reduction 5 with 5 rules applied. Total rules applied 287 place count 89 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 290 place count 89 transition count 114
Applied a total of 290 rules in 45 ms. Remains 89 /218 variables (removed 129) and now considering 114/416 (removed 302) transitions.
// Phase 1: matrix 114 rows 89 cols
[2025-05-30 01:25:33] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:25:33] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 01:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:25:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 01:25:33] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:25:33] [INFO ] Redundant transitions in 3 ms returned []
Running 113 sub problems to find dead transitions.
[2025-05-30 01:25:33] [INFO ] Invariant cache hit.
[2025-05-30 01:25:33] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:38] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:38] [INFO ] Deduced a trap composed of 34 places in 301 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:38] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:41] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:41] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:41] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:41] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:42] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:42] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:43] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:25:43] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 140 constraints, problems are : Problem set: 0 solved, 113 unsolved in 15178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/203 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 38/140 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 113/253 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 253 constraints, problems are : Problem set: 0 solved, 113 unsolved in 22835 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38060ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 38061ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/218 places, 114/416 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38914 ms. Remains : 89/218 places, 114/416 transitions.
[2025-05-30 01:26:11] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:26:11] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:26:11] [INFO ] Input system was already deterministic with 114 transitions.
[2025-05-30 01:26:11] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:26:11] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:26:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17087836502852627168.gal : 1 ms
[2025-05-30 01:26:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11171498091291091285.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17087836502852627168.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11171498091291091285.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9188 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1929 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11171498091291091285.prop.
SDD proceeding with computation,1 properties remain. new max is 4
Finished probabilistic random walk after 9457 steps, run visited all 1 properties in 57 ms. (steps per millisecond=165 )
Probabilistic random walk after 9457 steps, saw 4212 distinct states, run finished after 76 ms. (steps per millisecond=124 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 20
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 173 transition count 268
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 173 transition count 268
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 95 place count 173 transition count 263
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 130 place count 138 transition count 223
Iterating global reduction 1 with 35 rules applied. Total rules applied 165 place count 138 transition count 223
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 174 place count 138 transition count 214
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 197 place count 115 transition count 177
Iterating global reduction 2 with 23 rules applied. Total rules applied 220 place count 115 transition count 177
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 231 place count 115 transition count 166
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 240 place count 106 transition count 150
Iterating global reduction 3 with 9 rules applied. Total rules applied 249 place count 106 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 255 place count 106 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 259 place count 102 transition count 140
Iterating global reduction 4 with 4 rules applied. Total rules applied 263 place count 102 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 102 transition count 139
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 267 place count 99 transition count 130
Iterating global reduction 5 with 3 rules applied. Total rules applied 270 place count 99 transition count 130
Applied a total of 270 rules in 36 ms. Remains 99 /218 variables (removed 119) and now considering 130/416 (removed 286) transitions.
// Phase 1: matrix 130 rows 99 cols
[2025-05-30 01:26:12] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:26:12] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-05-30 01:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:26:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-30 01:26:12] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:26:12] [INFO ] Redundant transitions in 6 ms returned []
Running 129 sub problems to find dead transitions.
[2025-05-30 01:26:12] [INFO ] Invariant cache hit.
[2025-05-30 01:26:12] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/229 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 40/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:18] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:18] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:18] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:18] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:18] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:18] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 6/147 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:22] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 18 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/229 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 148 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/229 variables, 99/108 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 129/277 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/229 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 277 constraints, problems are : Problem set: 0 solved, 129 unsolved in 29027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43795ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 43796ms
Starting structural reductions in SI_CTL mode, iteration 1 : 99/218 places, 130/416 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44487 ms. Remains : 99/218 places, 130/416 transitions.
[2025-05-30 01:26:56] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:26:56] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:26:56] [INFO ] Input system was already deterministic with 130 transitions.
[2025-05-30 01:26:56] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:26:56] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:26:56] [INFO ] Time to serialize gal into /tmp/CTLFireability125757770316282816.gal : 1 ms
[2025-05-30 01:26:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12741282492901793413.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/CTLFireability125757770316282816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12741282492901793413.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,17443,0.664186,21424,2,4083,5,56434,6,0,526,41586,0
Converting to forward existential form...Done !
original formula: ((EF(((s1>=1)&&(l1224>=1))) + EG(A(!(((s1>=1)&&(l1220>=1))) U ((p123>=1)&&(l531>=1))))) + EG(((s1>=1)&&(l941>=1))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * ((s1>=1)&&(l1224>=1)))] != FALSE + [FwdG(Init,!((E(!(((p123>=1)&&(l531>=1))) U (!(!(((s1>=...294
(forward)formula 0,1,0.666723,21552,1,0,7,56434,8,1,530,41586,1
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 182 transition count 309
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 182 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 75 place count 182 transition count 306
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 104 place count 153 transition count 276
Iterating global reduction 1 with 29 rules applied. Total rules applied 133 place count 153 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 141 place count 153 transition count 268
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 157 place count 137 transition count 240
Iterating global reduction 2 with 16 rules applied. Total rules applied 173 place count 137 transition count 240
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 189 place count 137 transition count 224
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 134 transition count 217
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 134 transition count 217
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 131 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 131 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 131 transition count 212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 129 transition count 210
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 129 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 209 place count 129 transition count 208
Applied a total of 209 rules in 13 ms. Remains 129 /218 variables (removed 89) and now considering 208/416 (removed 208) transitions.
// Phase 1: matrix 208 rows 129 cols
[2025-05-30 01:26:57] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:26:57] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 01:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:26:57] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-05-30 01:26:58] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-05-30 01:26:58] [INFO ] Invariant cache hit.
[2025-05-30 01:26:58] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/337 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 225 constraints, problems are : Problem set: 0 solved, 207 unsolved in 21775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/337 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 94/225 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 207/432 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 432 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51896ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 51897ms
Starting structural reductions in LTL mode, iteration 1 : 129/218 places, 208/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52608 ms. Remains : 129/218 places, 208/416 transitions.
[2025-05-30 01:27:50] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:27:50] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:27:50] [INFO ] Input system was already deterministic with 208 transitions.
[2025-05-30 01:27:50] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:27:50] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:27:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15046636299983492096.gal : 3 ms
[2025-05-30 01:27:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4009145771999190550.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/CTLFireability15046636299983492096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4009145771999190550.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,25011,1.66966,42628,2,7673,5,113494,6,0,724,76986,0
Converting to forward existential form...Done !
original formula: (EX(((AX((((p74<1)||(l447<1))&&(((s1>=1)&&(l456>=1))||((s2>=1)&&(l1259>=1))))) + ((s1>=1)&&(l1217>=1))) + E(((!((p51>=1)&&(l619>=1)))||((...421
=> equivalent forward existential formula: ([(Init * !(EX(((!(EX(!((((p74<1)||(l447<1))&&(((s1>=1)&&(l456>=1))||((s2>=1)&&(l1259>=1))))))) + ((s1>=1)&&(l12...583
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t30, t34, t35, t38, t39, t40, t41, t50, t51, t52, t53, t54, t55, t...842
(forward)formula 0,0,11.3363,232972,1,0,596,969093,457,291,5113,674157,647
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 218/218 places, 416/416 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 174 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 174 transition count 265
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 91 place count 174 transition count 262
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 126 place count 139 transition count 222
Iterating global reduction 1 with 35 rules applied. Total rules applied 161 place count 139 transition count 222
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 170 place count 139 transition count 213
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 190 place count 119 transition count 181
Iterating global reduction 2 with 20 rules applied. Total rules applied 210 place count 119 transition count 181
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 219 place count 119 transition count 172
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 229 place count 109 transition count 154
Iterating global reduction 3 with 10 rules applied. Total rules applied 239 place count 109 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 243 place count 109 transition count 150
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 248 place count 104 transition count 145
Iterating global reduction 4 with 5 rules applied. Total rules applied 253 place count 104 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 255 place count 104 transition count 143
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 258 place count 101 transition count 139
Iterating global reduction 5 with 3 rules applied. Total rules applied 261 place count 101 transition count 139
Applied a total of 261 rules in 17 ms. Remains 101 /218 variables (removed 117) and now considering 139/416 (removed 277) transitions.
// Phase 1: matrix 139 rows 101 cols
[2025-05-30 01:28:01] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:28:01] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-30 01:28:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:28:01] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-30 01:28:01] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:28:02] [INFO ] Redundant transitions in 7 ms returned []
Running 138 sub problems to find dead transitions.
[2025-05-30 01:28:02] [INFO ] Invariant cache hit.
[2025-05-30 01:28:02] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/240 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 48/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 151 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8720 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/240 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 48/151 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 138/289 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 289 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38833ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 38834ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/218 places, 139/416 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39296 ms. Remains : 101/218 places, 139/416 transitions.
[2025-05-30 01:28:40] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:28:40] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:28:40] [INFO ] Input system was already deterministic with 139 transitions.
[2025-05-30 01:28:40] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:28:40] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:28:40] [INFO ] Time to serialize gal into /tmp/CTLFireability13835965974409151097.gal : 1 ms
[2025-05-30 01:28:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10192944744321796621.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/CTLFireability13835965974409151097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10192944744321796621.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,17306,0.974068,24148,2,5108,5,61876,6,0,543,54914,0
Converting to forward existential form...Done !
original formula: AG(A(((EF(((p46>=1)&&(l0>=1))) * (s1>=1)) * ((l1216>=1)&&(!((s1>=1)&&(l309>=1))))) U ((EF(((s1>=1)&&(l35>=1))) + ((s1>=1)&&(l954>=1))) + ...205
=> equivalent forward existential formula: ([((((FwdU(FwdU(Init,TRUE),!(((E(TRUE U ((s1>=1)&&(l35>=1))) + ((s1>=1)&&(l954>=1))) + (((p88>=1)&&(l447>=1))&&(...541
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t41, t42, t43, t44, t45, t46, t47, t48, t50, t51, t52, t53, t54, t...541
(forward)formula 0,0,4.38639,93508,1,0,303,368237,307,119,3816,226386,322
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2023-14 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 : 218/218 places, 416/416 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 174 transition count 275
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 174 transition count 275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 93 place count 174 transition count 270
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 129 place count 138 transition count 229
Iterating global reduction 1 with 36 rules applied. Total rules applied 165 place count 138 transition count 229
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 176 place count 138 transition count 218
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 199 place count 115 transition count 178
Iterating global reduction 2 with 23 rules applied. Total rules applied 222 place count 115 transition count 178
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 234 place count 115 transition count 166
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 245 place count 104 transition count 147
Iterating global reduction 3 with 11 rules applied. Total rules applied 256 place count 104 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 260 place count 104 transition count 143
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 267 place count 97 transition count 136
Iterating global reduction 4 with 7 rules applied. Total rules applied 274 place count 97 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 277 place count 97 transition count 133
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 281 place count 93 transition count 128
Iterating global reduction 5 with 4 rules applied. Total rules applied 285 place count 93 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 287 place count 93 transition count 126
Applied a total of 287 rules in 8 ms. Remains 93 /218 variables (removed 125) and now considering 126/416 (removed 290) transitions.
// Phase 1: matrix 126 rows 93 cols
[2025-05-30 01:28:45] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:28:45] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-30 01:28:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:28:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 01:28:45] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-05-30 01:28:45] [INFO ] Invariant cache hit.
[2025-05-30 01:28:45] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 49/144 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:28:50] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:28:50] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:28:50] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:28:54] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/219 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 148 constraints, problems are : Problem set: 0 solved, 125 unsolved in 14360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 126/219 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 125/273 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 273 constraints, problems are : Problem set: 0 solved, 125 unsolved in 23707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38111ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 38112ms
Starting structural reductions in LTL mode, iteration 1 : 93/218 places, 126/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38500 ms. Remains : 93/218 places, 126/416 transitions.
[2025-05-30 01:29:23] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:29:23] [INFO ] Flatten gal took : 3 ms
[2025-05-30 01:29:23] [INFO ] Input system was already deterministic with 126 transitions.
[2025-05-30 01:29:23] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:29:23] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:29:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5150550550856305134.gal : 1 ms
[2025-05-30 01:29:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7229655014106251655.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/CTLFireability5150550550856305134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7229655014106251655.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,12344,0.548074,15360,2,3563,5,38006,6,0,498,31018,0
Converting to forward existential form...Done !
original formula: AX(A((AF(!(AX(((s1>=1)&&(l1216>=1))))) * !(((EX(!(((s1<1)||(l608<1)))) * EF(((s1>=1)&&(l612>=1)))) * (((s1>=1)&&(l519>=1))||((s1>=1)&&(l6...191
=> equivalent forward existential formula: (([FwdG((FwdU(EY(Init),!(((s1>=1)&&(l970>=1)))) * !(((s1>=1)&&(l970>=1)))),!(!(!(EX(!(((s1>=1)&&(l1216>=1)))))))...412
Hit Full ! (commute/partial/dont) 2/0/124
(forward)formula 0,0,2.10638,48940,1,0,21,173516,20,4,2597,114116,17
FORMULA DBSingleClientW-PT-d1m04-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 01:29:26] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:29:26] [INFO ] Flatten gal took : 17 ms
Total runtime 824554 ms.
BK_STOP 1748568566129
--------------------
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="DBSingleClientW-PT-d1m04"
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 DBSingleClientW-PT-d1m04, 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 r058-smll-174854063400058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 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 '
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 ;