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-171620166900065.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620166900065
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-01
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-02
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-03
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-04
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-05
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-06
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-07
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-08
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-09
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-10
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2024-11
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2023-12
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2023-13
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2023-14
FORMULA_NAME AutoFlight-PT-01b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716243119188

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-20 22:12:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 22:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:12:01] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-20 22:12:01] [INFO ] Transformed 114 places.
[2024-05-20 22:12:01] [INFO ] Transformed 112 transitions.
[2024-05-20 22:12:01] [INFO ] Found NUPN structural information;
[2024-05-20 22:12:01] [INFO ] Parsed PT model containing 114 places and 112 transitions and 264 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 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 63 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:12:02] [INFO ] Computed 10 invariants in 18 ms
[2024-05-20 22:12:02] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-20 22:12:02] [INFO ] Invariant cache hit.
[2024-05-20 22:12:02] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-20 22:12:02] [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:12:04] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 22 ms to minimize.
[2024-05-20 22:12:04] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 3 ms to minimize.
[2024-05-20 22:12:04] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-20 22:12:04] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:12:04] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:12:04] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:12:04] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:12:04] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
[2024-05-20 22:12:05] [INFO ] Deduced a trap composed of 27 places in 27 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:12:06] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:12:06] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:12:06] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:12:06] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 3 ms to minimize.
[2024-05-20 22:12:06] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:12:06] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:12:06] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-20 22:12:06] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 4 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:12:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-20 22:12:07] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:12:07] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 109/221 variables, 112/153 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/221 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 153 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7579 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: 31/31 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, 31/41 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:12:11] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:12:11] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:12:11] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:12:11] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 3 ms to minimize.
[2024-05-20 22:12:12] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:12:12] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:12:12] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-20 22:12:12] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 109/221 variables, 112/161 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 108/269 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:12:14] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:12:15] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 4 ms to minimize.
[2024-05-20 22:12:15] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/221 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-20 22:12:16] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:12:16] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:12:16] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 0/221 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 275 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9779 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: 45/45 constraints]
After SMT, in 17457ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 17479ms
Starting structural reductions in LTL mode, iteration 1 : 112/114 places, 109/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18286 ms. Remains : 112/114 places, 109/112 transitions.
Support contains 70 out of 112 places after structural reductions.
[2024-05-20 22:12:20] [INFO ] Flatten gal took : 64 ms
[2024-05-20 22:12:20] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:12:20] [INFO ] Input system was already deterministic with 109 transitions.
Support contains 66 out of 112 places (down from 70) after GAL structural reductions.
RANDOM walk for 40000 steps (597 resets) in 1973 ms. (20 steps per ms) remains 5/61 properties
BEST_FIRST walk for 40003 steps (106 resets) in 294 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (116 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (126 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (121 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (140 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
[2024-05-20 22:12:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 74/87 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/105 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 5 (OVERLAPS) 7/112 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 109/221 variables, 112/122 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/122 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/122 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 122 constraints, problems are : Problem set: 3 solved, 2 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/75 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-20 22:12:22] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
[2024-05-20 22:12:22] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
Problem AtomicPropp23 is UNSAT
[2024-05-20 22:12:22] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-20 22:12:22] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:12:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 5/10 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/104 variables, 4/14 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/112 variables, 1/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-20 22:12:22] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/16 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 109/221 variables, 112/128 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/129 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/129 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/221 variables, 0/129 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 129 constraints, problems are : Problem set: 4 solved, 1 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 597ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 17 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-20 22:12:22] [INFO ] Flatten gal took : 16 ms
[2024-05-20 22:12:22] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:12:22] [INFO ] Input system was already deterministic with 109 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
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 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 84 place count 71 transition count 45
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 122 place count 52 transition count 45
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 131 place count 43 transition count 36
Iterating global reduction 4 with 9 rules applied. Total rules applied 140 place count 43 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 140 place count 43 transition count 34
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 144 place count 41 transition count 34
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 164 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 30 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 29 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 166 place count 29 transition count 22
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 168 place count 28 transition count 22
Applied a total of 168 rules in 32 ms. Remains 28 /112 variables (removed 84) and now considering 22/109 (removed 87) transitions.
// Phase 1: matrix 22 rows 28 cols
[2024-05-20 22:12:22] [INFO ] Computed 9 invariants in 3 ms
[2024-05-20 22:12:22] [INFO ] Implicit Places using invariants in 60 ms returned [11, 16, 21, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/112 places, 22/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 21 transition count 19
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 21 transition count 19
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 20 transition count 18
Applied a total of 8 rules in 4 ms. Remains 20 /24 variables (removed 4) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-05-20 22:12:22] [INFO ] Computed 5 invariants in 1 ms
[2024-05-20 22:12:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 22:12:22] [INFO ] Invariant cache hit.
[2024-05-20 22:12:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 22:12:22] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 20/112 places, 18/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 182 ms. Remains : 20/112 places, 18/109 transitions.
[2024-05-20 22:12:22] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:12:22] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:12:22] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-20 22:12:22] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:12:22] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:12:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality15795108269122607204.gal : 2 ms
[2024-05-20 22:12:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality9799610587087771186.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/CTLCardinality15795108269122607204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9799610587087771186.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,304,0.016932,3296,2,71,5,340,6,0,97,256,0


Converting to forward existential form...Done !
original formula: EG((p45==0))
=> equivalent forward existential formula: [FwdG(Init,(p45==0))] != FALSE
Hit Full ! (commute/partial/dont) 16/0/2
(forward)formula 0,1,0.024251,3644,1,0,17,1928,19,3,465,1620,15
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 111 transition count 78
Reduce places removed 30 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 36 rules applied. Total rules applied 66 place count 81 transition count 72
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 79 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 77 transition count 70
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 72 place count 77 transition count 51
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 110 place count 58 transition count 51
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 119 place count 49 transition count 42
Iterating global reduction 4 with 9 rules applied. Total rules applied 128 place count 49 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 128 place count 49 transition count 39
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 134 place count 46 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 150 place count 38 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 37 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 36 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 152 place count 36 transition count 29
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 154 place count 35 transition count 29
Applied a total of 154 rules in 20 ms. Remains 35 /112 variables (removed 77) and now considering 29/109 (removed 80) transitions.
// Phase 1: matrix 29 rows 35 cols
[2024-05-20 22:12:23] [INFO ] Computed 9 invariants in 0 ms
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants in 45 ms returned [10, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 33/112 places, 29/109 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 30 transition count 26
Applied a total of 6 rules in 3 ms. Remains 30 /33 variables (removed 3) and now considering 26/29 (removed 3) transitions.
// Phase 1: matrix 26 rows 30 cols
[2024-05-20 22:12:23] [INFO ] Computed 7 invariants in 1 ms
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-20 22:12:23] [INFO ] Invariant cache hit.
[2024-05-20 22:12:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 30/112 places, 26/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 189 ms. Remains : 30/112 places, 26/109 transitions.
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:12:23] [INFO ] Input system was already deterministic with 26 transitions.
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:12:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality11203511649636528483.gal : 1 ms
[2024-05-20 22:12:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11131167020128914095.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/CTLCardinality11203511649636528483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11131167020128914095.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,1332,0.006934,3480,2,115,5,469,6,0,145,321,0


Converting to forward existential form...Done !
original formula: AF((((p107==1) * (AG(((p110==0)||(p104==1))) + (p71==1))) * ((p107==0) + AF((p91==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((((p107==1) * (!(E(TRUE U !(((p110==0)||(p104==1))))) + (p71==1))) * ((p107==0) + !(EG(!((p91==0)))...169
Reverse transition relation is NOT exact ! Due to transitions t9, t25, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,0,0.072461,5908,1,0,240,13222,89,135,846,16445,261
FORMULA AutoFlight-PT-01b-CTLCardinality-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 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 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 84 place count 71 transition count 46
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 120 place count 53 transition count 46
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 129 place count 44 transition count 37
Iterating global reduction 4 with 9 rules applied. Total rules applied 138 place count 44 transition count 37
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 138 place count 44 transition count 34
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 144 place count 41 transition count 34
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 164 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 30 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 29 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 166 place count 29 transition count 22
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 168 place count 28 transition count 22
Applied a total of 168 rules in 16 ms. Remains 28 /112 variables (removed 84) and now considering 22/109 (removed 87) transitions.
// Phase 1: matrix 22 rows 28 cols
[2024-05-20 22:12:23] [INFO ] Computed 9 invariants in 0 ms
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants in 52 ms returned [11, 16, 21, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/112 places, 22/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 20
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 21 transition count 19
Applied a total of 6 rules in 4 ms. Remains 21 /24 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 21 cols
[2024-05-20 22:12:23] [INFO ] Computed 5 invariants in 0 ms
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-20 22:12:23] [INFO ] Invariant cache hit.
[2024-05-20 22:12:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 21/112 places, 19/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 153 ms. Remains : 21/112 places, 19/109 transitions.
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:12:23] [INFO ] Input system was already deterministic with 19 transitions.
RANDOM walk for 268 steps (29 resets) in 8 ms. (29 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:12:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5650244837250943721.gal : 1 ms
[2024-05-20 22:12:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2490867973361242291.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5650244837250943721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2490867973361242291.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 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 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 86 place count 70 transition count 44
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 124 place count 51 transition count 44
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 134 place count 41 transition count 34
Iterating global reduction 3 with 10 rules applied. Total rules applied 144 place count 41 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 144 place count 41 transition count 31
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 150 place count 38 transition count 31
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 164 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 30 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 166 place count 29 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 166 place count 29 transition count 22
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 168 place count 28 transition count 22
Applied a total of 168 rules in 15 ms. Remains 28 /112 variables (removed 84) and now considering 22/109 (removed 87) transitions.
// Phase 1: matrix 22 rows 28 cols
[2024-05-20 22:12:23] [INFO ] Computed 9 invariants in 0 ms
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants in 43 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 27/112 places, 22/109 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 24 transition count 19
Applied a total of 6 rules in 2 ms. Remains 24 /27 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 24 cols
[2024-05-20 22:12:23] [INFO ] Computed 8 invariants in 0 ms
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-20 22:12:23] [INFO ] Invariant cache hit.
[2024-05-20 22:12:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 24/112 places, 19/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 147 ms. Remains : 24/112 places, 19/109 transitions.
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:12:23] [INFO ] Input system was already deterministic with 19 transitions.
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:12:23] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:12:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2438340859567053313.gal : 1 ms
[2024-05-20 22:12:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11749185521605199748.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/CTLCardinality2438340859567053313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11749185521605199748.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,240,0.005236,3440,2,89,5,317,6,0,114,219,0


Converting to forward existential form...Done !
original formula: EF(EG((p64==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p64==1))] != FALSE
Hit Full ! (commute/partial/dont) 17/0/2
(forward)formula 0,0,0.011093,3756,1,0,13,1549,19,2,577,872,13
FORMULA AutoFlight-PT-01b-CTLCardinality-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 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 103 transition count 100
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 103 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 103 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 99 transition count 95
Iterating global reduction 1 with 4 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 20 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:12:23] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-20 22:12:23] [INFO ] Invariant cache hit.
[2024-05-20 22:12:23] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-20 22:12:23] [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:12:24] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-20 22:12:24] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-20 22:12:24] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-20 22:12:24] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:12:24] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-20 22:12:24] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:12:24] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 22:12:24] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-20 22:12:24] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-20 22:12:25] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
[2024-05-20 22:12:26] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:12:26] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
[2024-05-20 22:12:26] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 94/192 variables, 98/130 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:12:27] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:12:27] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-20 22:12:27] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:12:27] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-20 22:12:27] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:12:27] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 136 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5801 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: 28/28 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, 28/38 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:12:30] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-20 22:12:30] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:12:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:12:31] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:12:31] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 94/192 variables, 98/141 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 93/234 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:12:32] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:12:33] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 236 constraints, problems are : Problem set: 0 solved, 93 unsolved in 7466 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: 35/35 constraints]
After SMT, in 13286ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 13290ms
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 94/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13483 ms. Remains : 98/112 places, 94/109 transitions.
[2024-05-20 22:12:37] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:12:37] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:12:37] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-20 22:12:37] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:12:37] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:12:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality9116177580544444096.gal : 3 ms
[2024-05-20 22:12:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15527130494079448124.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/CTLCardinality9116177580544444096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15527130494079448124.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.21695e+07,0.178282,8124,2,3413,5,17722,6,0,488,24396,0


Converting to forward existential form...Done !
original formula: A((p28!=1) U A(((EF((p67==1)) * !(AG((p105==1)))) * ((AF(((p101==0)||(p94==1))) + (p99==1)) * ((AX(((p29==0)||(p63==1))) + (p89==0)) + (p...217
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(!((EX(((p58==0)||(p57==1))) * E(TRUE U !(EX(!((p77==0)))))))) U (!(((E(TRUE U (p67==1)) ...1237
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t11, t20, t23, t25, t34, t37, t38, t40, t43, t51, t53, t56, t57, t61, t63, t65, t68, ...268
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,25.947,612732,1,0,891,3.59077e+06,238,494,2898,3.96261e+06,1038
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-04 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 111 transition count 75
Reduce places removed 33 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 39 rules applied. Total rules applied 72 place count 78 transition count 69
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 76 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 74 transition count 67
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 78 place count 74 transition count 50
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 112 place count 57 transition count 50
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 118 place count 51 transition count 44
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 51 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 124 place count 51 transition count 41
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 130 place count 48 transition count 41
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 154 place count 36 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 35 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 34 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 156 place count 34 transition count 27
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 158 place count 33 transition count 27
Applied a total of 158 rules in 16 ms. Remains 33 /112 variables (removed 79) and now considering 27/109 (removed 82) transitions.
// Phase 1: matrix 27 rows 33 cols
[2024-05-20 22:13:03] [INFO ] Computed 9 invariants in 1 ms
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants in 41 ms returned [14, 19, 32]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/112 places, 27/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 26
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 transition count 26
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 27 transition count 24
Applied a total of 6 rules in 3 ms. Remains 27 /30 variables (removed 3) and now considering 24/27 (removed 3) transitions.
// Phase 1: matrix 24 rows 27 cols
[2024-05-20 22:13:03] [INFO ] Computed 6 invariants in 0 ms
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-20 22:13:03] [INFO ] Invariant cache hit.
[2024-05-20 22:13:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 27/112 places, 24/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 146 ms. Remains : 27/112 places, 24/109 transitions.
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:13:03] [INFO ] Input system was already deterministic with 24 transitions.
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:13:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15131610842419903856.gal : 1 ms
[2024-05-20 22:13:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality3422943778869091631.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/CTLCardinality15131610842419903856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3422943778869091631.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,1152,0.008372,3468,2,107,5,732,6,0,131,677,0


Converting to forward existential form...Done !
original formula: A((((p89==0)||(p10==1))||(p105==1)) U !(EG(((p35==0)||(p39==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(((p35==0)||(p39==1)))))))) * !(E(!(!(EG(((p35==0)||(p39==1))))) U (!((((p89==0)||(p10==1))...215
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t8, t23, Intersection with reachable at each step enabled. (destroyed/reverse/inters...176
Using saturation style SCC detection
(forward)formula 0,0,0.108232,7480,1,0,288,24223,78,169,780,30431,339
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 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 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 86 place count 70 transition count 45
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 122 place count 52 transition count 45
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 132 place count 42 transition count 35
Iterating global reduction 3 with 10 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 3 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 3 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 3 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 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 12 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:13:03] [INFO ] Computed 9 invariants in 0 ms
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants in 36 ms returned [9, 14, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/112 places, 21/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 22 transition count 19
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 19
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 21 transition count 18
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 21 transition count 18
Applied a total of 6 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/21 (removed 3) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-05-20 22:13:03] [INFO ] Computed 6 invariants in 0 ms
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:13:03] [INFO ] Invariant cache hit.
[2024-05-20 22:13:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 21/112 places, 18/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 125 ms. Remains : 21/112 places, 18/109 transitions.
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:13:03] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:13:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality7500462718965433960.gal : 0 ms
[2024-05-20 22:13:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2134598383329945105.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/CTLCardinality7500462718965433960.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2134598383329945105.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,408,0.005754,3416,2,54,5,351,6,0,102,277,0


Converting to forward existential form...Done !
original formula: AF(EG((p112!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p112!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.02455,3996,1,0,64,2838,58,28,593,2177,105
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-06 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 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 84 place count 71 transition count 46
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 120 place count 53 transition count 46
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 130 place count 43 transition count 36
Iterating global reduction 4 with 10 rules applied. Total rules applied 140 place count 43 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 140 place count 43 transition count 34
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 144 place count 41 transition count 34
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 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 22 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:13:03] [INFO ] Computed 10 invariants in 0 ms
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants in 46 ms returned [15, 21, 26, 33]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 30/112 places, 27/109 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 29 transition count 26
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 29 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 28 transition count 25
Applied a total of 4 rules in 4 ms. Remains 28 /30 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 28 cols
[2024-05-20 22:13:03] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-20 22:13:03] [INFO ] Invariant cache hit.
[2024-05-20 22:13:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-20 22:13:03] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 28/112 places, 25/109 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 186 ms. Remains : 28/112 places, 25/109 transitions.
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:13:03] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:13:03] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:13:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality12095693048843676092.gal : 1 ms
[2024-05-20 22:13:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15062493408713604570.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/CTLCardinality12095693048843676092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15062493408713604570.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,1007,0.014174,3480,2,223,5,948,6,0,137,738,0


Converting to forward existential form...Done !
original formula: EG(E(((p41==0)||(p59==1)) U ((p4==0)||(p68==1))))
=> equivalent forward existential formula: [FwdG(Init,E(((p41==0)||(p59==1)) U ((p4==0)||(p68==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t21, t22, t24, Intersection with reachable at each step enabled. (destroyed/reverse...183
(forward)formula 0,1,0.058017,4588,1,0,77,5228,74,33,840,4901,79
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-08 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 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 95 transition count 91
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 95 transition count 91
Applied a total of 35 rules in 4 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:13:04] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:13:04] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-20 22:13:04] [INFO ] Invariant cache hit.
[2024-05-20 22:13:04] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-20 22:13:04] [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:13:04] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:13:05] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-20 22:13:05] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:13:05] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 3 ms to minimize.
[2024-05-20 22:13:05] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-20 22:13:05] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:13:05] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/186 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:13:06] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:13:06] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:13:07] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/186 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 115 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4517 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: 10/10 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, 10/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:13:09] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:13:09] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:13:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:13:09] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/186 variables, 95/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:13:10] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-20 22:13:10] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-20 22:13:11] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/186 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5098 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: 17/17 constraints]
After SMT, in 9631ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 9634ms
Starting structural reductions in LTL mode, iteration 1 : 95/112 places, 91/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9834 ms. Remains : 95/112 places, 91/109 transitions.
[2024-05-20 22:13:13] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:13:13] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:13:13] [INFO ] Input system was already deterministic with 91 transitions.
[2024-05-20 22:13:13] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:13:13] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:13:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17813842926765320041.gal : 2 ms
[2024-05-20 22:13:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality3652642800798369159.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/CTLCardinality17813842926765320041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3652642800798369159.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.9798e+07,0.108711,7048,2,2236,5,14207,6,0,473,18704,0


Converting to forward existential form...Done !
original formula: E(EG(EX(!(EF((p43==0))))) U (!(AX(A((p78==1) U ((p107==0)||(p55==1))))) + (AF(EG((p111==0))) * EG(EF(((p6==0)||(p44==1)))))))
=> equivalent forward existential formula: (([(FwdU(EY(FwdU(Init,EG(EX(!(E(TRUE U (p43==0))))))),!(((p107==0)||(p55==1)))) * (!((p78==1)) * !(((p107==0)||(...385
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t17, t22, t30, t34, t36, t37, t51, t54, t55, t58, t59, t62, t68, t86, t87, Inter...247
Hit Full ! (commute/partial/dont) 87/4/4
Using saturation style SCC detection
(forward)formula 0,1,16.0209,390380,1,0,1122,2.3516e+06,243,556,2978,2.61437e+06,1329
FORMULA AutoFlight-PT-01b-CTLCardinality-2024-09 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 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 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:13:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:13:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-20 22:13:30] [INFO ] Invariant cache hit.
[2024-05-20 22:13:30] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-20 22:13:30] [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:13:31] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:13:31] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:13:32] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:13:33] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:13:33] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:13:33] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:13:33] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:13:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:13:33] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:13:34] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:13:34] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 94/192 variables, 98/133 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:13:35] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 134 constraints, problems are : Problem set: 0 solved, 93 unsolved in 7435 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: 26/26 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, 26/36 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:13:38] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:13:38] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:13:38] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:13:38] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/192 variables, 98/138 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 93/231 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:13:39] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:13:39] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:13:40] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-20 22:13:40] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:13:40] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-20 22:13:40] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:13:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:13:41] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-20 22:13:44] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:13:44] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 241 constraints, problems are : Problem set: 0 solved, 93 unsolved in 11400 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: 40/40 constraints]
After SMT, in 18850ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 18851ms
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 94/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19017 ms. Remains : 98/112 places, 94/109 transitions.
[2024-05-20 22:13:49] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:13:49] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:13:49] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-20 22:13:49] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:13:49] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17410295110534001176.gal : 2 ms
[2024-05-20 22:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality13634959036366836324.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/CTLCardinality17410295110534001176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13634959036366836324.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.11103e+07,0.17918,9440,2,3818,5,22865,6,0,488,33966,0


Converting to forward existential form...Done !
original formula: ((EF((((p45==1) + !(A(((p0==0)||(p104==1)) U ((p13==0)||(p57==1))))) * A(((p0==0)||(p46==1)) U ((p28==0)||(p22==1))))) * A((((p6==0)||(p7...241
=> equivalent forward existential formula: [(EY((Init * (E(TRUE U (((p45==1) + !(!((E(!(((p13==0)||(p57==1))) U (!(((p0==0)||(p104==1))) * !(((p13==0)||(p5...736
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t12, t20, t25, t33, t37, t39, t41, t52, t54, t57, t61, t63, t65, t68, t69, t8...266
Using saturation style SCC detection
(forward)formula 0,1,16.6378,442888,1,0,1285,2.56393e+06,250,580,2927,2.95343e+06,1498
FORMULA AutoFlight-PT-01b-CTLCardinality-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 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
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 99 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 99 transition count 96
Applied a total of 26 rules in 7 ms. Remains 99 /112 variables (removed 13) and now considering 96/109 (removed 13) transitions.
// Phase 1: matrix 96 rows 99 cols
[2024-05-20 22:14:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:14:05] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-20 22:14:05] [INFO ] Invariant cache hit.
[2024-05-20 22:14:06] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-20 22:14:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-20 22:14:06] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:14:06] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:14:07] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:14:07] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:14:07] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:14:07] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 3 ms to minimize.
[2024-05-20 22:14:07] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 2 ms to minimize.
[2024-05-20 22:14:07] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:14:08] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-20 22:14:09] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2024-05-20 22:14:09] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:14:09] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-20 22:14:09] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-20 22:14:09] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 96/195 variables, 99/132 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-20 22:14:11] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 133 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7102 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 96/195 variables, 99/133 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 95/228 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-20 22:14:14] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:14:15] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-20 22:14:15] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:14:15] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-20 22:14:17] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 233 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6720 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 29/29 constraints]
After SMT, in 13836ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 13838ms
Starting structural reductions in LTL mode, iteration 1 : 99/112 places, 96/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14015 ms. Remains : 99/112 places, 96/109 transitions.
[2024-05-20 22:14:19] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:14:19] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:14:19] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-20 22:14:19] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:14:19] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:14:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15094711001740480176.gal : 2 ms
[2024-05-20 22:14:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17120168037574184807.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/CTLCardinality15094711001740480176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17120168037574184807.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.84148e+07,0.210599,7600,2,2774,5,16683,6,0,494,22263,0


Converting to forward existential form...Done !
original formula: AG((EX(TRUE) * A(((((p20==1)||(p53==1))||((p44==0)||(p103==1))) * EX((p85==0))) U (AF((p16==0)) + (!(((p63==0)||(p46==1))) * EX((p81==0))...160
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * ([FwdG(((FwdU(FwdU(Init,TRUE),!((!(EG(!((p16==0)))) + (!(((p63==0)|...426
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t10, t19, t22, t24, t32, t36, t38, t40, t54, t57, t58, t62, t65, t73, t91, t9...256
(forward)formula 0,0,10.0745,268532,1,0,522,1.45559e+06,222,216,2673,1.863e+06,602
FORMULA AutoFlight-PT-01b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 99 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 99 transition count 95
Applied a total of 27 rules in 3 ms. Remains 99 /112 variables (removed 13) and now considering 95/109 (removed 14) transitions.
// Phase 1: matrix 95 rows 99 cols
[2024-05-20 22:14:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 22:14:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-20 22:14:30] [INFO ] Invariant cache hit.
[2024-05-20 22:14:30] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-20 22:14:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:30] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:14:30] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 3 ms to minimize.
[2024-05-20 22:14:31] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:14:31] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:14:31] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-20 22:14:31] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:14:32] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:14:32] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:32] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 95/194 variables, 99/119 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:34] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/194 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:35] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:14:36] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 122 constraints, problems are : Problem set: 0 solved, 94 unsolved in 7584 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:38] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:14:38] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 2 ms to minimize.
[2024-05-20 22:14:38] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:39] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 95/194 variables, 99/127 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 94/221 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:14:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-20 22:14:41] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-20 22:14:41] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-20 22:14:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 225 constraints, problems are : Problem set: 0 solved, 94 unsolved in 8099 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 22/22 constraints]
After SMT, in 15695ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 15697ms
Starting structural reductions in LTL mode, iteration 1 : 99/112 places, 95/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15850 ms. Remains : 99/112 places, 95/109 transitions.
[2024-05-20 22:14:45] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:14:45] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:14:45] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-20 22:14:45] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:14:45] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:14:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality15245358199686507342.gal : 1 ms
[2024-05-20 22:14:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality18411702364941706282.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/CTLCardinality15245358199686507342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18411702364941706282.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.10969e+07,0.141293,8124,2,2979,5,17620,6,0,493,25751,0


Converting to forward existential form...Done !
original formula: AF(AG((A((p34==1) U (((p42==1)&&(p93==1))&&(p29==0))) * ((AX(((p47==0)&&(p76==1))) + EG((p2==1))) + (EG(((p29==0)||(p30==1))) * (((p78==0...182
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!((E(!((((p42==1)&&(p93==1))&&(p29==0))) U (!((p34==1)) * !((((p42==1)&&(p93==1))&&(p...338
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t11, t19, t24, t32, t36, t38, t41, t49, t54, t56, t62, t63, t66, t72, t89, t9...261
(forward)formula 0,0,29.4652,752076,1,0,1376,4.19887e+06,237,636,2960,5.49139e+06,1590
FORMULA AutoFlight-PT-01b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 109/109 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 104 transition count 101
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 104 transition count 101
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 99 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 99 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 98 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 98 transition count 95
Applied a total of 28 rules in 6 ms. Remains 98 /112 variables (removed 14) and now considering 95/109 (removed 14) transitions.
// Phase 1: matrix 95 rows 98 cols
[2024-05-20 22:15:15] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:15:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-20 22:15:15] [INFO ] Invariant cache hit.
[2024-05-20 22:15:15] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-05-20 22:15:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:15:16] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 3 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:15:17] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
[2024-05-20 22:15:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:15:18] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:15:18] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:15:18] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:15:18] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 95/193 variables, 98/126 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:15:20] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:15:20] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:15:20] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 129 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6793 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/193 variables, 98/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 94/223 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-20 22:15:24] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:15:24] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-20 22:15:24] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/193 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 226 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5683 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 24/24 constraints]
After SMT, in 12498ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 12501ms
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 95/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12759 ms. Remains : 98/112 places, 95/109 transitions.
[2024-05-20 22:15:28] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:15:28] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:15:28] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-20 22:15:28] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:15:28] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:15:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality14745437772366840441.gal : 5 ms
[2024-05-20 22:15:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality347329989769056411.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/CTLCardinality14745437772366840441.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality347329989769056411.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.73787e+07,0.258413,9180,2,3721,5,22162,6,0,489,30492,0


Converting to forward existential form...Done !
original formula: AX((AX(AF(AG(((p8==0)||(p25==1))))) * (((p20==0)&&(p103==1)) + (EG(((p10==0)||((p51==0)&&(p83==1)))) * EG(((p36==0)||(p7==1)))))))
=> equivalent forward existential formula: ([FwdG(EY(EY(Init)),!(!(E(TRUE U !(((p8==0)||(p25==1)))))))] = FALSE * ([((EY(Init) * !(((p20==0)&&(p103==1)))) ...289
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t11, t20, t23, t26, t29, t34, t38, t40, t41, t52, t55, t56, t60, t63, t70, t7...271
Detected timeout of ITS tools.
[2024-05-20 22:15:58] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:15:58] [INFO ] Applying decomposition
[2024-05-20 22:15:58] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12880410182689760800.txt' '-o' '/tmp/graph12880410182689760800.bin' '-w' '/tmp/graph12880410182689760800.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12880410182689760800.bin' '-l' '-1' '-v' '-w' '/tmp/graph12880410182689760800.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:15:58] [INFO ] Decomposing Gal with order
[2024-05-20 22:15:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:15:58] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-20 22:15:58] [INFO ] Flatten gal took : 78 ms
[2024-05-20 22:15:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2024-05-20 22:15:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality4215580731852704948.gal : 5 ms
[2024-05-20 22:15:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality17719122806664918365.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/CTLCardinality4215580731852704948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17719122806664918365.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.73787e+07,0.076211,4804,328,21,2748,161,289,3373,39,347,0


Converting to forward existential form...Done !
original formula: AX((AX(AF(AG(((i2.u5.p8==0)||(i3.u9.p25==1))))) * (((i3.u8.p20==0)&&(i10.i0.u36.p103==1)) + (EG(((i2.u5.p10==0)||((i5.u15.p51==0)&&(i0.i1...213
=> equivalent forward existential formula: ([FwdG(EY(EY(Init)),!(!(E(TRUE U !(((i2.u5.p8==0)||(i3.u9.p25==1)))))))] = FALSE * ([((EY(Init) * !(((i3.u8.p20=...371
Reverse transition relation is NOT exact ! Due to transitions t41, t60, t89, t90, t91, i0.i1.t26, i0.i1.u30.t29, i0.i2.u40.t11, i1.t38, i1.i1.t40, i2.t75, ...380
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,5.00962,135220,1,0,280833,202,1694,308780,178,450,356657
FORMULA AutoFlight-PT-01b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

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
Applied a total of 33 rules in 3 ms. Remains 96 /112 variables (removed 16) and now considering 92/109 (removed 17) transitions.
// Phase 1: matrix 92 rows 96 cols
[2024-05-20 22:16:03] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 22:16:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-20 22:16:03] [INFO ] Invariant cache hit.
[2024-05-20 22:16:04] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-20 22:16:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-20 22:16:04] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:16:04] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 3 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-20 22:16:05] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:16:06] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/188 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-20 22:16:07] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:16:07] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:16:07] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-20 22:16:07] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 124 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5519 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-20 22:16:10] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
[2024-05-20 22:16:10] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/188 variables, 96/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 91/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-20 22:16:11] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-20 22:16:11] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:16:11] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:16:11] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:16:11] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-20 22:16:11] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:16:12] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:16:12] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-20 22:16:14] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/188 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 226 constraints, problems are : Problem set: 0 solved, 91 unsolved in 9101 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 29/29 constraints]
After SMT, in 14633ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 14635ms
Starting structural reductions in LTL mode, iteration 1 : 96/112 places, 92/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14795 ms. Remains : 96/112 places, 92/109 transitions.
[2024-05-20 22:16:18] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:16:18] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:16:18] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-20 22:16:18] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:16:18] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:16:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality1621247897157480083.gal : 2 ms
[2024-05-20 22:16:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality2403259493562162074.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/CTLCardinality1621247897157480083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2403259493562162074.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,1.9428e+07,0.152714,7608,2,2910,5,15454,6,0,478,21117,0


Converting to forward existential form...Done !
original formula: EX(A((((p47==0)||(p109==1)) * ((p58!=0) + AX((((p36==0)||(p100==0))||(p28==1))))) U AF(!(((p42==1)||(p41==0))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(EG(!(!(((p42==1)||(p41==0)))))))))) * !(E(!(!(EG(!(!(((p42==1)||(p41==0))))))) U (!((((p4...286
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t11, t19, t24, t32, t36, t38, t41, t49, t51, t54, t55, t59, t61, t63, t66, t69, t86, ...263
Using saturation style SCC detection
(forward)formula 0,0,27.28,707796,1,0,1281,4.22518e+06,216,697,2716,5.12276e+06,1396
FORMULA AutoFlight-PT-01b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-20 22:16:46] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:16:46] [INFO ] Flatten gal took : 3 ms
Total runtime 284689 ms.

BK_STOP 1716243406280

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-171620166900065"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;