Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r026-smll-171620166900066.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is AutoFlight-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620166900066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 22:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 26K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-01b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716243420353

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-20 22:17:02] [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]
[2024-05-20 22:17:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:17:02] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-20 22:17:02] [INFO ] Transformed 114 places.
[2024-05-20 22:17:02] [INFO ] Transformed 112 transitions.
[2024-05-20 22:17:02] [INFO ] Found NUPN structural information;
[2024-05-20 22:17:02] [INFO ] Parsed PT model containing 114 places and 112 transitions and 264 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 115 ms.
Support contains 75 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 112/112 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 112 transition count 109
Applied a total of 5 rules in 60 ms. Remains 112 /114 variables (removed 2) and now considering 109/112 (removed 3) transitions.
// Phase 1: matrix 109 rows 112 cols
[2024-05-20 22:17:03] [INFO ] Computed 10 invariants in 18 ms
[2024-05-20 22:17:03] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-20 22:17:03] [INFO ] Invariant cache hit.
[2024-05-20 22:17:03] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-20 22:17:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:17:05] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 22 ms to minimize.
[2024-05-20 22:17:05] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-20 22:17:05] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:17:05] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:17:05] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 4 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:17:06] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:17:07] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 22:17:07] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-20 22:17:07] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-20 22:17:07] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 3 ms to minimize.
[2024-05-20 22:17:07] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:17:07] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:17:08] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:17:08] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:17:08] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
[2024-05-20 22:17:08] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:17:08] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:17:08] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-20 22:17:08] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
[2024-05-20 22:17:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:17:09] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 3 ms to minimize.
[2024-05-20 22:17:09] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:17:09] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-20 22:17:09] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:17:09] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-20 22:17:09] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:17:10] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 9 ms to minimize.
[2024-05-20 22:17:10] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 109/221 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:17:11] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:17:12] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:17:12] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:17:14] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/221 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 162 constraints, problems are : Problem set: 0 solved, 108 unsolved in 13652 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/221 variables, 112/162 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 108/270 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:17:20] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-20 22:17:20] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:17:21] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/221 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:17:22] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/221 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 274 constraints, problems are : Problem set: 0 solved, 108 unsolved in 10773 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 44/44 constraints]
After SMT, in 24549ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 24575ms
Starting structural reductions in LTL mode, iteration 1 : 112/114 places, 109/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25323 ms. Remains : 112/114 places, 109/112 transitions.
Support contains 75 out of 112 places after structural reductions.
[2024-05-20 22:17:28] [INFO ] Flatten gal took : 64 ms
[2024-05-20 22:17:28] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:17:28] [INFO ] Input system was already deterministic with 109 transitions.
Support contains 74 out of 112 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (595 resets) in 2972 ms. (13 steps per ms) remains 12/73 properties
BEST_FIRST walk for 40003 steps (109 resets) in 207 ms. (192 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (105 resets) in 98 ms. (404 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (153 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (108 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (112 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (132 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (112 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (140 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (122 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (106 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (111 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (109 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
[2024-05-20 22:17:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 83/103 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/107 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 5 (OVERLAPS) 5/112 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 109/221 variables, 112/122 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/122 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/122 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 122 constraints, problems are : Problem set: 5 solved, 6 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/99 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 5 unsolved
[2024-05-20 22:17:30] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
Problem AtomicPropp55 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 4/11 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/105 variables, 2/14 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/15 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/112 variables, 1/16 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
Problem AtomicPropp27 is UNSAT
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
Problem AtomicPropp41 is UNSAT
[2024-05-20 22:17:31] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 5/21 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/21 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 109/221 variables, 112/133 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 2/135 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/135 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/221 variables, 0/135 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 135 constraints, problems are : Problem set: 9 solved, 2 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 11/11 constraints]
After SMT, in 1152ms problems are : Problem set: 9 solved, 2 unsolved
Finished Parikh walk after 57 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 9 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-01b-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 22:17:31] [INFO ] Flatten gal took : 10 ms
[2024-05-20 22:17:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-01b-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 22:17:31] [INFO ] Flatten gal took : 10 ms
[2024-05-20 22:17:31] [INFO ] Input system was already deterministic with 109 transitions.
Support contains 58 out of 112 places (down from 66) after GAL structural reductions.
FORMULA AutoFlight-PT-01b-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 35 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 101 transition count 98
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 101 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 101 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 98 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 98 transition count 94
Applied a total of 29 rules in 18 ms. Remains 98 /112 variables (removed 14) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 98 cols
[2024-05-20 22:17:31] [INFO ] Computed 10 invariants in 8 ms
[2024-05-20 22:17:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-20 22:17:31] [INFO ] Invariant cache hit.
[2024-05-20 22:17:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-20 22:17:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:17:32] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 13 ms to minimize.
[2024-05-20 22:17:32] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:17:32] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-20 22:17:32] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:17:32] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:17:32] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:17:33] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-20 22:17:33] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-20 22:17:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 2 ms to minimize.
[2024-05-20 22:17:33] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-20 22:17:33] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:17:33] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:17:34] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:17:34] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:17:34] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 94/192 variables, 98/123 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 123 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4526 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:17:37] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:17:37] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:17:37] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:17:37] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:17:38] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:17:38] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:17:38] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 94/192 variables, 98/130 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 93/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 223 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5427 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 22/22 constraints]
After SMT, in 9974ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 9976ms
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 94/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10159 ms. Remains : 98/112 places, 94/109 transitions.
[2024-05-20 22:17:42] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:17:42] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:17:42] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-20 22:17:42] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:17:42] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:17:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3530522563336085949.gal : 3 ms
[2024-05-20 22:17:42] [INFO ] Time to serialize properties into /tmp/CTLFireability6552360524222298952.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3530522563336085949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6552360524222298952.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.48155e+07,0.145385,7784,2,2714,5,16656,6,0,488,23119,0


Converting to forward existential form...Done !
original formula: ((AG(EF(((p66==1)&&(p53==1)))) * (EX((AF((p48==0)) * (p80==0))) + AF(((AG((p45==0)) * (p65==0)) * ((p42==0)&&(p27==0)))))) * (A(!((AG((p3...278
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U ((p66==1)&&(p53==1)))))] = FALSE * [FwdG((Init * !(EX((!(EG(!((p48==0)))) * (p8...950
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t10, t18, t23, t32, t35, t36, t38, t41, t51, t54, t57, t58, t62, t65, t71, t88, t89, ...258
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-20 22:18:12] [INFO ] Flatten gal took : 11 ms
[2024-05-20 22:18:12] [INFO ] Applying decomposition
[2024-05-20 22:18:12] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4458618940224909847.txt' '-o' '/tmp/graph4458618940224909847.bin' '-w' '/tmp/graph4458618940224909847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4458618940224909847.bin' '-l' '-1' '-v' '-w' '/tmp/graph4458618940224909847.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:18:12] [INFO ] Decomposing Gal with order
[2024-05-20 22:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:18:12] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-20 22:18:12] [INFO ] Flatten gal took : 81 ms
[2024-05-20 22:18:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2024-05-20 22:18:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9512005125464323723.gal : 8 ms
[2024-05-20 22:18:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12128067587646918769.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9512005125464323723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12128067587646918769.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
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,2.48155e+07,0.048041,5060,344,14,2744,134,268,3425,27,245,0


Converting to forward existential form...Done !
original formula: ((AG(EF(((i7.i1.u22.p66==1)&&(i3.i1.u17.p53==1)))) * (EX((AF((i3.i1.u14.p48==0)) * (i7.i1.u29.p80==0))) + AF(((AG((i2.u8.p45==0)) * (i5.i...417
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U ((i7.i1.u22.p66==1)&&(i3.i1.u17.p53==1)))))] = FALSE * [FwdG((Init * !(EX((!(EG...1253
Reverse transition relation is NOT exact ! Due to transitions t62, t88, t89, t90, i0.u2.t0, i0.u2.t71, i1.u5.t1, i1.u5.t65, i2.t58, i2.t54, i2.u11.t57, i3....353
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,2.93591,101140,1,0,237385,134,1746,229343,145,245,273912
FORMULA AutoFlight-PT-01b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 99 transition count 96
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 99 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 99 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 95 transition count 91
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 94 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 93 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 93 transition count 89
Applied a total of 39 rules in 45 ms. Remains 93 /112 variables (removed 19) and now considering 89/109 (removed 20) transitions.
// Phase 1: matrix 89 rows 93 cols
[2024-05-20 22:18:15] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:18:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-20 22:18:15] [INFO ] Invariant cache hit.
[2024-05-20 22:18:15] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-20 22:18:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:18:16] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 3 ms to minimize.
[2024-05-20 22:18:16] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:18:16] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:18:16] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:18:17] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-20 22:18:17] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-20 22:18:17] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:18:17] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:18:18] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-20 22:18:18] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:18:18] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 89/182 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 114 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4602 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:18:21] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:18:21] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:18:21] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:18:21] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:18:21] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:18:21] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-20 22:18:22] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 89/182 variables, 93/121 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 88/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 209 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 18/18 constraints]
After SMT, in 9772ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 9775ms
Starting structural reductions in LTL mode, iteration 1 : 93/112 places, 89/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10035 ms. Remains : 93/112 places, 89/109 transitions.
[2024-05-20 22:18:25] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:18:25] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:18:25] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-20 22:18:25] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:18:25] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:18:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13657065345439354784.gal : 2 ms
[2024-05-20 22:18:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16409924664099362271.ctl : 5 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13657065345439354784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16409924664099362271.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.04655e+07,0.087553,5220,2,1570,5,7209,6,0,463,7017,0


Converting to forward existential form...Done !
original formula: AF(((EG(((((AX((p69==1)) + E((p81==1) U ((p15==1)&&(p97==1)))) + (((p62==1)&&(p101==1))||(p53==1))) * (p68==1)) * (p112==1))) * (p84==1))...169
=> equivalent forward existential formula: [FwdG(Init,!(((EG(((((!(EX(!((p69==1)))) + E((p81==1) U ((p15==1)&&(p97==1)))) + (((p62==1)&&(p101==1))||(p53==1...220
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t17, t22, t30, t34, t36, t37, t50, t53, t57, t60, t66, t84, t85, Intersection wi...237
Using saturation style SCC detection
(forward)formula 0,0,4.45,118268,1,0,749,658593,214,384,2784,788567,803
FORMULA AutoFlight-PT-01b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 111 transition count 71
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 79 place count 74 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 72 transition count 66
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 81 place count 72 transition count 48
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 117 place count 54 transition count 48
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 129 place count 42 transition count 36
Iterating global reduction 3 with 12 rules applied. Total rules applied 141 place count 42 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 142 place count 42 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 142 place count 42 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 39 transition count 32
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 166 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 29 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 28 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 168 place count 28 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 27 transition count 21
Applied a total of 170 rules in 30 ms. Remains 27 /112 variables (removed 85) and now considering 21/109 (removed 88) transitions.
// Phase 1: matrix 21 rows 27 cols
[2024-05-20 22:18:30] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 22:18:30] [INFO ] Implicit Places using invariants in 41 ms returned [10, 15, 20, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/112 places, 21/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 21 transition count 19
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 21 transition count 19
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 20 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 19 transition count 17
Applied a total of 8 rules in 4 ms. Remains 19 /23 variables (removed 4) and now considering 17/21 (removed 4) transitions.
// Phase 1: matrix 17 rows 19 cols
[2024-05-20 22:18:30] [INFO ] Computed 5 invariants in 1 ms
[2024-05-20 22:18:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-20 22:18:30] [INFO ] Invariant cache hit.
[2024-05-20 22:18:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:18:30] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 19/112 places, 17/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 144 ms. Remains : 19/112 places, 17/109 transitions.
[2024-05-20 22:18:30] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:18:30] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:18:30] [INFO ] Input system was already deterministic with 17 transitions.
[2024-05-20 22:18:30] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:18:30] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:18:30] [INFO ] Time to serialize gal into /tmp/CTLFireability8284600074609288664.gal : 0 ms
[2024-05-20 22:18:30] [INFO ] Time to serialize properties into /tmp/CTLFireability957914497729024329.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8284600074609288664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability957914497729024329.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,288,0.004454,3432,2,50,5,247,6,0,93,188,0


Converting to forward existential form...Done !
original formula: EF(EG(((p11==1)&&(p75==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p11==1)&&(p75==1)))] != FALSE
Hit Full ! (commute/partial/dont) 14/2/3
(forward)formula 0,0,0.008172,3752,1,0,8,961,19,2,456,590,8
FORMULA AutoFlight-PT-01b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 100 transition count 97
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 100 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 100 transition count 96
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 96 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 95 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 94 transition count 90
Applied a total of 37 rules in 8 ms. Remains 94 /112 variables (removed 18) and now considering 90/109 (removed 19) transitions.
// Phase 1: matrix 90 rows 94 cols
[2024-05-20 22:18:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:18:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-20 22:18:30] [INFO ] Invariant cache hit.
[2024-05-20 22:18:30] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-20 22:18:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:31] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-20 22:18:31] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:18:31] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:18:31] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:18:31] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:18:31] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 22:18:31] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:18:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/184 variables, 94/112 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:32] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:18:32] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:18:33] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 115 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4323 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:35] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:18:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-20 22:18:35] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:18:35] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:35] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 90/184 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 89/209 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-20 22:18:37] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:18:37] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:37] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/184 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 213 constraints, problems are : Problem set: 0 solved, 89 unsolved in 6015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 20/20 constraints]
After SMT, in 10353ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 10354ms
Starting structural reductions in LTL mode, iteration 1 : 94/112 places, 90/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10515 ms. Remains : 94/112 places, 90/109 transitions.
[2024-05-20 22:18:40] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:18:40] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:18:40] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-20 22:18:40] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:18:40] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:18:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5972573891989295312.gal : 2 ms
[2024-05-20 22:18:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7627080345560259659.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5972573891989295312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7627080345560259659.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.01492e+07,0.136446,7864,2,2727,5,16429,6,0,468,23920,0


Converting to forward existential form...Done !
original formula: EG((EF((((AF((p1==0)) + EF((p18==1))) + (EX((p67==1)) + (p24==1))) + (p87==1))) * AG(((p41==0)||(p70==0)))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((!(EG(!((p1==0)))) + E(TRUE U (p18==1))) + (EX((p67==1)) + (p24==1))) + (p87==1))) * !(E(...199
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t11, t19, t24, t33, t36, t37, t39, t40, t51, t54, t58, t59, t67, t84, t85, t8...256
(forward)formula 0,0,3.7479,99576,1,0,296,477586,218,133,2660,560491,355
FORMULA AutoFlight-PT-01b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 100 transition count 97
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 100 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 100 transition count 96
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 96 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 95 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 95 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 94 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 94 transition count 90
Applied a total of 37 rules in 19 ms. Remains 94 /112 variables (removed 18) and now considering 90/109 (removed 19) transitions.
// Phase 1: matrix 90 rows 94 cols
[2024-05-20 22:18:44] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:18:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-20 22:18:44] [INFO ] Invariant cache hit.
[2024-05-20 22:18:44] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-20 22:18:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:45] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:18:45] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:18:45] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-20 22:18:45] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:18:46] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/184 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:47] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 118 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4642 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/184 variables, 94/118 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 89/207 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-20 22:18:50] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:18:50] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:18:50] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 210 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 17/17 constraints]
After SMT, in 9721ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 9727ms
Starting structural reductions in LTL mode, iteration 1 : 94/112 places, 90/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9951 ms. Remains : 94/112 places, 90/109 transitions.
[2024-05-20 22:18:54] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:18:54] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:18:54] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-20 22:18:54] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:18:54] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:18:54] [INFO ] Time to serialize gal into /tmp/CTLFireability16927849820929066090.gal : 1 ms
[2024-05-20 22:18:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10712494891302842783.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16927849820929066090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10712494891302842783.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.43315e+07,0.081999,6276,2,1680,5,11684,6,0,468,13934,0


Converting to forward existential form...Done !
original formula: AF(EX((((p25==1)||(p48==1))||(p92==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((p25==1)||(p48==1))||(p92==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t17, t23, t26, t31, t35, t37, t38, t51, t54, t58, t61, t67, t85, t86, Intersecti...242
(forward)formula 0,1,1.70553,53592,1,0,398,228723,202,213,2537,303434,369
FORMULA AutoFlight-PT-01b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 98 transition count 95
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 98 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 98 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 93 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 93 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 92 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 92 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 91 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 91 transition count 87
Applied a total of 43 rules in 8 ms. Remains 91 /112 variables (removed 21) and now considering 87/109 (removed 22) transitions.
// Phase 1: matrix 87 rows 91 cols
[2024-05-20 22:18:56] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:18:56] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 22:18:56] [INFO ] Invariant cache hit.
[2024-05-20 22:18:56] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2024-05-20 22:18:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:18:57] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:18:57] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-20 22:18:57] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:18:57] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:18:57] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-20 22:18:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:18:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:18:57] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 87/178 variables, 91/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 109 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3351 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:19:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:19:00] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 87/178 variables, 91/111 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 86/197 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:19:01] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:19:01] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:19:01] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-20 22:19:03] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/178 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/178 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/178 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 201 constraints, problems are : Problem set: 0 solved, 86 unsolved in 7225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 14/14 constraints]
After SMT, in 10599ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 10600ms
Starting structural reductions in LTL mode, iteration 1 : 91/112 places, 87/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10755 ms. Remains : 91/112 places, 87/109 transitions.
[2024-05-20 22:19:07] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:19:07] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:19:07] [INFO ] Input system was already deterministic with 87 transitions.
[2024-05-20 22:19:07] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:19:07] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:19:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15410697886805029642.gal : 1 ms
[2024-05-20 22:19:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2529419185409781909.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15410697886805029642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2529419185409781909.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.67448e+07,0.052368,5208,2,1520,5,6911,6,0,453,6687,0


Converting to forward existential form...Done !
original formula: (AF(((p6==1) + ((EF(((p38==0)||(p74==0))) * EX(AX((p4==1)))) * (p14==1)))) * EX(TRUE))
=> equivalent forward existential formula: ([FwdG(Init,!(((p6==1) + ((E(TRUE U ((p38==0)||(p74==0))) * EX(!(EX(!((p4==1)))))) * (p14==1)))))] = FALSE * [(I...183
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t17, t22, t30, t34, t36, t37, t48, t51, t55, t58, t64, t82, t83, Intersection wi...237
(forward)formula 0,1,1.4278,46608,1,0,367,196127,205,194,2582,244668,355
FORMULA AutoFlight-PT-01b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 102 transition count 99
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 102 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 102 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 100 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 100 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 99 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 99 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 98 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 98 transition count 94
Applied a total of 29 rules in 5 ms. Remains 98 /112 variables (removed 14) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 98 cols
[2024-05-20 22:19:08] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:19:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-20 22:19:08] [INFO ] Invariant cache hit.
[2024-05-20 22:19:08] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-20 22:19:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:09] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 3 ms to minimize.
[2024-05-20 22:19:09] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:19:09] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-20 22:19:09] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:19:09] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:19:09] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:19:09] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:19:10] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-20 22:19:10] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-20 22:19:10] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:19:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-20 22:19:10] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:19:10] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:10] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:11] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:19:11] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:11] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:19:12] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 94/192 variables, 98/126 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:13] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-20 22:19:13] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-20 22:19:13] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
[2024-05-20 22:19:13] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:14] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 131 constraints, problems are : Problem set: 0 solved, 93 unsolved in 7968 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:17] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:19:17] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:19:17] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:17] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:18] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
[2024-05-20 22:19:18] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 94/192 variables, 98/137 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 93/230 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:19] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:19:19] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:19:21] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/192 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 233 constraints, problems are : Problem set: 0 solved, 93 unsolved in 9138 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints]
After SMT, in 17121ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 17122ms
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 94/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17279 ms. Remains : 98/112 places, 94/109 transitions.
[2024-05-20 22:19:25] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:19:25] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:19:25] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-20 22:19:25] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:19:25] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:19:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1628226363158121119.gal : 1 ms
[2024-05-20 22:19:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15494368087567962940.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1628226363158121119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15494368087567962940.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.31894e+07,0.21472,8672,2,3203,5,19547,6,0,488,28008,0


Converting to forward existential form...Done !
original formula: AG((!(E(((p19==1)||(p82!=1)) U (EF((p39==1)) + EX((p83==1))))) + ((AX(AX((p106==1))) * (p58==1)) * (p5==1))))
=> equivalent forward existential formula: (([(EY(EY((FwdU(Init,TRUE) * !(!(E(((p19==1)||(p82!=1)) U (E(TRUE U (p39==1)) + EX((p83==1))))))))) * !((p106==1...400
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t12, t20, t26, t29, t34, t38, t40, t43, t51, t57, t61, t63, t65, t68, t71, t8...266
(forward)formula 0,0,5.18038,131268,1,0,269,697043,216,137,2685,735677,300
FORMULA AutoFlight-PT-01b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 111 transition count 71
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 80 place count 74 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 72 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 71 transition count 64
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 84 place count 71 transition count 47
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 118 place count 54 transition count 47
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 128 place count 44 transition count 37
Iterating global reduction 4 with 10 rules applied. Total rules applied 138 place count 44 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 138 place count 44 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 42 transition count 35
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 162 place count 32 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 31 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 30 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 164 place count 30 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 29 transition count 23
Applied a total of 166 rules in 26 ms. Remains 29 /112 variables (removed 83) and now considering 23/109 (removed 86) transitions.
// Phase 1: matrix 23 rows 29 cols
[2024-05-20 22:19:31] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 22:19:31] [INFO ] Implicit Places using invariants in 44 ms returned [10, 22, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/112 places, 23/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 25 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 23 transition count 20
Applied a total of 6 rules in 3 ms. Remains 23 /26 variables (removed 3) and now considering 20/23 (removed 3) transitions.
// Phase 1: matrix 20 rows 23 cols
[2024-05-20 22:19:31] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 22:19:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-20 22:19:31] [INFO ] Invariant cache hit.
[2024-05-20 22:19:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:19:31] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/112 places, 20/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 146 ms. Remains : 23/112 places, 20/109 transitions.
[2024-05-20 22:19:31] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:31] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:19:31] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-20 22:19:31] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:31] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17750275442306132810.gal : 1 ms
[2024-05-20 22:19:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13456635989856099678.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17750275442306132810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13456635989856099678.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,672,0.005516,3464,2,85,5,351,6,0,111,250,0


Converting to forward existential form...Done !
original formula: EF(AG(E((p41==1) U (p92==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((p41==1) U (p92==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.019323,4048,1,0,52,2867,63,28,650,2260,62
FORMULA AutoFlight-PT-01b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 111 transition count 72
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 75 transition count 69
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 75 place count 75 transition count 52
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 109 place count 58 transition count 52
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 120 place count 47 transition count 41
Iterating global reduction 2 with 11 rules applied. Total rules applied 131 place count 47 transition count 41
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 131 place count 47 transition count 37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 139 place count 43 transition count 37
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 159 place count 33 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 32 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 31 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 161 place count 31 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 30 transition count 25
Applied a total of 163 rules in 12 ms. Remains 30 /112 variables (removed 82) and now considering 25/109 (removed 84) transitions.
// Phase 1: matrix 25 rows 30 cols
[2024-05-20 22:19:31] [INFO ] Computed 9 invariants in 2 ms
[2024-05-20 22:19:31] [INFO ] Implicit Places using invariants in 40 ms returned [13, 18, 23, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/112 places, 25/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 24 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 24 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 23 transition count 22
Applied a total of 6 rules in 2 ms. Remains 23 /26 variables (removed 3) and now considering 22/25 (removed 3) transitions.
// Phase 1: matrix 22 rows 23 cols
[2024-05-20 22:19:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-20 22:19:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-20 22:19:31] [INFO ] Invariant cache hit.
[2024-05-20 22:19:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/112 places, 22/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 131 ms. Remains : 23/112 places, 22/109 transitions.
[2024-05-20 22:19:31] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:19:31] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:31] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-20 22:19:31] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:31] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16346603413235013804.gal : 1 ms
[2024-05-20 22:19:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1175657565807338650.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16346603413235013804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1175657565807338650.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,736,0.006431,3464,2,57,5,397,6,0,117,354,0


Converting to forward existential form...Done !
original formula: (EF(AG((p48==0))) * EF((p39==0)))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U !(E(TRUE U !((p48==0)))))),TRUE) * (p39==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,1,0.020416,4048,1,0,52,2684,66,28,682,2759,69
FORMULA AutoFlight-PT-01b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 101 transition count 98
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 101 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 101 transition count 97
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 97 transition count 93
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 97 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 96 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 96 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 95 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 95 transition count 91
Applied a total of 35 rules in 5 ms. Remains 95 /112 variables (removed 17) and now considering 91/109 (removed 18) transitions.
// Phase 1: matrix 91 rows 95 cols
[2024-05-20 22:19:31] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:19:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-20 22:19:31] [INFO ] Invariant cache hit.
[2024-05-20 22:19:31] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-20 22:19:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:19:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-20 22:19:32] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:19:32] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:19:32] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:19:32] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:19:32] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:19:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:19:33] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:19:33] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:19:33] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-20 22:19:33] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-05-20 22:19:33] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-20 22:19:33] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-20 22:19:33] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:19:34] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:19:34] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:19:34] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:19:34] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 91/186 variables, 95/123 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:19:36] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:19:36] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:19:36] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/186 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 126 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:19:38] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/186 variables, 95/128 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 90/218 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:19:39] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:19:39] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-20 22:19:39] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:19:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:19:41] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:19:42] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/186 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 224 constraints, problems are : Problem set: 0 solved, 90 unsolved in 9151 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 29/29 constraints]
After SMT, in 15332ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 15335ms
Starting structural reductions in LTL mode, iteration 1 : 95/112 places, 91/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15546 ms. Remains : 95/112 places, 91/109 transitions.
[2024-05-20 22:19:46] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:19:46] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:19:46] [INFO ] Input system was already deterministic with 91 transitions.
[2024-05-20 22:19:46] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:19:46] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:19:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3258527011855606788.gal : 2 ms
[2024-05-20 22:19:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14120014248488149031.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3258527011855606788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14120014248488149031.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.80588e+07,0.079617,6280,2,2267,5,10372,6,0,473,13235,0


Converting to forward existential form...Done !
original formula: AG(AF((EX((p1==1)) + ((AX((p87==1)) * (p13==1)) * (EG((p47==1)) + (p37==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EX((p1==1)) + ((!(EX(!((p87==1)))) * (p13==1)) * (EG((p47==1)) + (p37==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t12, t20, t25, t33, t37, t39, t42, t50, t52, t55, t59, t62, t66, t85, t86...260
(forward)formula 0,0,3.42679,99652,1,0,435,514476,213,176,2565,641670,497
FORMULA AutoFlight-PT-01b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 111 transition count 69
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 84 place count 72 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 70 transition count 63
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 86 place count 70 transition count 46
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 120 place count 53 transition count 46
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 130 place count 43 transition count 36
Iterating global reduction 3 with 10 rules applied. Total rules applied 140 place count 43 transition count 36
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 140 place count 43 transition count 33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 40 transition count 33
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 166 place count 30 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 29 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 28 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 168 place count 28 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 170 place count 27 transition count 21
Applied a total of 170 rules in 23 ms. Remains 27 /112 variables (removed 85) and now considering 21/109 (removed 88) transitions.
// Phase 1: matrix 21 rows 27 cols
[2024-05-20 22:19:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 22:19:50] [INFO ] Implicit Places using invariants in 65 ms returned [15, 20, 26]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/112 places, 21/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 23 transition count 20
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 19
Applied a total of 4 rules in 5 ms. Remains 22 /24 variables (removed 2) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 22 cols
[2024-05-20 22:19:50] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 22:19:50] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-20 22:19:50] [INFO ] Invariant cache hit.
[2024-05-20 22:19:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:19:50] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 22/112 places, 19/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 201 ms. Remains : 22/112 places, 19/109 transitions.
[2024-05-20 22:19:50] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:19:50] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:50] [INFO ] Input system was already deterministic with 19 transitions.
RANDOM walk for 484 steps (59 resets) in 10 ms. (44 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-01b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-20 22:19:50] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:50] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14858766029736435246.gal : 1 ms
[2024-05-20 22:19:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2706219097402057287.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14858766029736435246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2706219097402057287.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 111 transition count 76
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 79 transition count 70
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 79 place count 74 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 73 transition count 66
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 80 place count 73 transition count 50
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 112 place count 57 transition count 50
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 122 place count 47 transition count 40
Iterating global reduction 4 with 10 rules applied. Total rules applied 132 place count 47 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 132 place count 47 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 45 transition count 38
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 156 place count 35 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 34 transition count 27
Applied a total of 157 rules in 19 ms. Remains 34 /112 variables (removed 78) and now considering 27/109 (removed 82) transitions.
// Phase 1: matrix 27 rows 34 cols
[2024-05-20 22:19:50] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:19:50] [INFO ] Implicit Places using invariants in 58 ms returned [21, 26, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/112 places, 27/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 26
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 25
Applied a total of 4 rules in 3 ms. Remains 29 /31 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 29 cols
[2024-05-20 22:19:50] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 22:19:50] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-20 22:19:50] [INFO ] Invariant cache hit.
[2024-05-20 22:19:50] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 29/112 places, 25/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 207 ms. Remains : 29/112 places, 25/109 transitions.
[2024-05-20 22:19:50] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:19:50] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:19:50] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-20 22:19:50] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:19:50] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:19:50] [INFO ] Time to serialize gal into /tmp/CTLFireability357535541255115049.gal : 1 ms
[2024-05-20 22:19:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6445880423975867777.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability357535541255115049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6445880423975867777.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,4536,0.008348,3492,2,100,5,704,6,0,144,617,0


Converting to forward existential form...Done !
original formula: EF((EF((((EG((p67==0)) * ((p15==0)||(p97==0))) * (p25==0)) + EG((p60==0)))) * EG((p56==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(TRUE U (((EG((p67==0)) * ((p15==0)||(p97==0))) * (p25==0)) + EG((p60==0))))),(p56==1)...166
Reverse transition relation is NOT exact ! Due to transitions t9, t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
Hit Full ! (commute/partial/dont) 23/0/2
(forward)formula 0,1,0.112699,7508,1,0,367,24691,92,173,892,27489,429
FORMULA AutoFlight-PT-01b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 100 transition count 97
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 100 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 100 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 97 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 97 transition count 93
Applied a total of 31 rules in 3 ms. Remains 97 /112 variables (removed 15) and now considering 93/109 (removed 16) transitions.
// Phase 1: matrix 93 rows 97 cols
[2024-05-20 22:19:51] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:19:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-20 22:19:51] [INFO ] Invariant cache hit.
[2024-05-20 22:19:51] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-20 22:19:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 22:19:52] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-20 22:19:52] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:19:52] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:19:52] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:19:52] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:19:52] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-20 22:19:52] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 22:19:53] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 22:19:53] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-20 22:19:53] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 22:19:54] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:19:54] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:19:54] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 22:19:55] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 93/190 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 121 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5714 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 22:19:57] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-20 22:19:57] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:19:57] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:19:57] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:19:57] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:19:57] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 93/190 variables, 97/127 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 92/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 22:19:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-20 22:19:58] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-20 22:19:59] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 222 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6202 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 23/23 constraints]
After SMT, in 11938ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 11942ms
Starting structural reductions in LTL mode, iteration 1 : 97/112 places, 93/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12150 ms. Remains : 97/112 places, 93/109 transitions.
[2024-05-20 22:20:03] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:20:03] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:20:03] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-20 22:20:03] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:20:03] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:20:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13667543478597308151.gal : 1 ms
[2024-05-20 22:20:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14844006849268802595.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13667543478597308151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14844006849268802595.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.04996e+07,0.110448,7352,2,2501,5,14995,6,0,483,20382,0


Converting to forward existential form...Done !
original formula: (AF(((EG((p87==1)) * AX((p64==1))) * ((EF(((p32==1)&&(p89==1))) * E((p30==1) U (p47==1))) + (((p30==0)&&(p105==1))&&(p71==1))))) + AX((A(...205
=> equivalent forward existential formula: ([(FwdU((EY((Init * !(!(EG(!(((EG((p87==1)) * !(EX(!((p64==1))))) * ((E(TRUE U ((p32==1)&&(p89==1))) * E((p30==1...522
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t10, t18, t23, t31, t35, t37, t40, t48, t53, t56, t57, t60, t61, t64, t70, t87, t88, ...258
Hit Full ! (commute/partial/dont) 91/0/2
Hit Full ! (commute/partial/dont) 91/0/2
(forward)formula 0,0,12.7898,309284,1,0,1048,1.7681e+06,247,493,2910,1.99763e+06,1244
FORMULA AutoFlight-PT-01b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-20 22:20:16] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:20:16] [INFO ] Flatten gal took : 7 ms
Total runtime 193659 ms.

BK_STOP 1716243616210

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="AutoFlight-PT-01b"
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-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-01b, 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 r026-smll-171620166900066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-01b.tgz
mv AutoFlight-PT-01b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;