fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r576-smll-171734919800017
Last Updated
July 7, 2024

About the Execution of ITS-Tools for MedleyA-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1038.636 158182.00 200969.00 654.10 FFTFTTFFFFFFTFFT normal

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.r576-smll-171734919800017.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 MedleyA-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919800017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 26K Jun 2 16:33 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 MedleyA-PT-03-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-03-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717352116164

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:15:18] [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-06-02 18:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:15:19] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-06-02 18:15:19] [INFO ] Transformed 108 places.
[2024-06-02 18:15:19] [INFO ] Transformed 100 transitions.
[2024-06-02 18:15:19] [INFO ] Found NUPN structural information;
[2024-06-02 18:15:19] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-03-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-03-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 102 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 102 transition count 95
Applied a total of 11 rules in 78 ms. Remains 102 /108 variables (removed 6) and now considering 95/100 (removed 5) transitions.
// Phase 1: matrix 95 rows 102 cols
[2024-06-02 18:15:19] [INFO ] Computed 8 invariants in 28 ms
[2024-06-02 18:15:19] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-02 18:15:19] [INFO ] Invariant cache hit.
[2024-06-02 18:15:20] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2024-06-02 18:15:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 18 ms to minimize.
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 3 ms to minimize.
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:15:21] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:15:22] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:23] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 5 ms to minimize.
[2024-06-02 18:15:23] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:15:23] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:24] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 95/197 variables, 102/128 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:25] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 129 constraints, problems are : Problem set: 0 solved, 94 unsolved in 7452 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:28] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 3 ms to minimize.
[2024-06-02 18:15:28] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:15:28] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:15:29] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:15:29] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:15:29] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:15:29] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:15:29] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:15:29] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:29] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:15:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 95/197 variables, 102/141 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 94/235 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:31] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:15:31] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:15:31] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:15:31] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:15:32] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 5/240 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:33] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:38] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/197 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-02 18:15:43] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/197 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 243 constraints, problems are : Problem set: 0 solved, 94 unsolved in 23152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 39/39 constraints]
After SMT, in 30776ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 30806ms
Starting structural reductions in LTL mode, iteration 1 : 102/108 places, 95/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31701 ms. Remains : 102/108 places, 95/100 transitions.
Support contains 49 out of 102 places after structural reductions.
[2024-06-02 18:15:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:15:51] [INFO ] Flatten gal took : 43 ms
FORMULA MedleyA-PT-03-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:15:51] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:15:51] [INFO ] Input system was already deterministic with 95 transitions.
Support contains 45 out of 102 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (648 resets) in 2638 ms. (15 steps per ms) remains 6/33 properties
BEST_FIRST walk for 40004 steps (189 resets) in 473 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (173 resets) in 223 ms. (178 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (217 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (176 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (177 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (173 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
[2024-06-02 18:15:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/70 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/88 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 95/183 variables, 88/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 14/197 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 110 constraints, problems are : Problem set: 0 solved, 5 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/70 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-02 18:15:53] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/88 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-02 18:15:53] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 95/183 variables, 88/98 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 9 (OVERLAPS) 14/197 variables, 14/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 3/115 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/197 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 115 constraints, problems are : Problem set: 2 solved, 3 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 705ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 560 steps, including 0 resets, run visited all 3 properties in 21 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 36 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2024-06-02 18:15:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:15:53] [INFO ] Flatten gal took : 20 ms
FORMULA MedleyA-PT-03-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:15:53] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:15:53] [INFO ] Input system was already deterministic with 95 transitions.
Support contains 37 out of 102 places (down from 41) after GAL structural reductions.
Computed a total of 102 stabilizing places and 95 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 95
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA MedleyA-PT-03-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 101 transition count 74
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 81 transition count 74
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 40 place count 81 transition count 66
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 56 place count 73 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 69 transition count 62
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 69 transition count 62
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 92 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 54 transition count 47
Applied a total of 93 rules in 57 ms. Remains 54 /102 variables (removed 48) and now considering 47/95 (removed 48) transitions.
// Phase 1: matrix 47 rows 54 cols
[2024-06-02 18:15:53] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:15:53] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 18:15:53] [INFO ] Invariant cache hit.
[2024-06-02 18:15:53] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-02 18:15:53] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:15:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1837 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 3134ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3136ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/102 places, 47/95 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3433 ms. Remains : 54/102 places, 47/95 transitions.
[2024-06-02 18:15:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:15:57] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:15:57] [INFO ] Input system was already deterministic with 47 transitions.
[2024-06-02 18:15:57] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:15:57] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:15:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality226122319956586964.gal : 3 ms
[2024-06-02 18:15:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality18358571004419307284.ctl : 7 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/CTLCardinality226122319956586964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18358571004419307284.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.60461e+06,0.04905,3940,2,614,5,2765,6,0,265,2015,0


Converting to forward existential form...Done !
original formula: EF(AG((p41==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p41==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t9, t11, t13, t40, t42, Intersection with reachable at each step enabled...204
(forward)formula 0,0,0.296803,9736,1,0,115,40076,116,52,1629,29799,107
FORMULA MedleyA-PT-03-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 86
Applied a total of 18 rules in 29 ms. Remains 93 /102 variables (removed 9) and now considering 86/95 (removed 9) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 18:15:57] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 18:15:57] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 18:15:57] [INFO ] Invariant cache hit.
[2024-06-02 18:15:57] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:15:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:15:58] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:15:58] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:15:58] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:00] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 105 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4058 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/190 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:02] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:16:03] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:16:03] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/179 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:08] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/179 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 195 constraints, problems are : Problem set: 0 solved, 85 unsolved in 13141 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 9/9 constraints]
After SMT, in 17234ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 17237ms
Starting structural reductions in LTL mode, iteration 1 : 93/102 places, 86/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17577 ms. Remains : 93/102 places, 86/95 transitions.
[2024-06-02 18:16:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:16:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:16:15] [INFO ] Input system was already deterministic with 86 transitions.
[2024-06-02 18:16:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:16:15] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:16:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality5597665269238870837.gal : 16 ms
[2024-06-02 18:16:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality896358952953772096.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/CTLCardinality5597665269238870837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality896358952953772096.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19424e+08,0.36635,15532,2,2412,5,36575,6,0,460,77198,0


Converting to forward existential form...Done !
original formula: AX(EG(((p29==0)||(p95==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((p29==0)||(p95==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t20, t25, t27, t32, t34, t39, t42, t45, t48, t51, t52, t72, Intersect...243
Detected timeout of ITS tools.
[2024-06-02 18:16:45] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:16:45] [INFO ] Applying decomposition
[2024-06-02 18:16:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15425514116860979691.txt' '-o' '/tmp/graph15425514116860979691.bin' '-w' '/tmp/graph15425514116860979691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15425514116860979691.bin' '-l' '-1' '-v' '-w' '/tmp/graph15425514116860979691.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:16:45] [INFO ] Decomposing Gal with order
[2024-06-02 18:16:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:16:45] [INFO ] Removed a total of 1 redundant transitions.
[2024-06-02 18:16:45] [INFO ] Flatten gal took : 73 ms
[2024-06-02 18:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-06-02 18:16:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8043028775294881954.gal : 11 ms
[2024-06-02 18:16:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality15731405566828587981.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/CTLCardinality8043028775294881954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15731405566828587981.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,1.19424e+08,0.091971,6052,455,184,3781,2919,204,4223,122,9802,0


Converting to forward existential form...Done !
original formula: AX(EG(((i3.u9.p29==0)||(u26.p95==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((i3.u9.p29==0)||(u26.p95==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions u17.t27, u25.t6, u26.t72, i0.u1.t52, i1.u19.t18, i1.u21.t11, i1.u24.t4, i2.t51, i2.u7.t48, i3...342
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
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
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
(forward)formula 0,1,3.98613,123532,1,0,293144,8999,1187,262120,803,85813,358184
FORMULA MedleyA-PT-03-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 86
Applied a total of 18 rules in 15 ms. Remains 93 /102 variables (removed 9) and now considering 86/95 (removed 9) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 18:16:49] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:16:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:16:49] [INFO ] Invariant cache hit.
[2024-06-02 18:16:49] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:16:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:50] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:16:50] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:16:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:51] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:52] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 106 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4631 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:55] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:16:58] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:16:58] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/179 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 194 constraints, problems are : Problem set: 0 solved, 85 unsolved in 7687 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints]
After SMT, in 12340ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 12342ms
Starting structural reductions in LTL mode, iteration 1 : 93/102 places, 86/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12589 ms. Remains : 93/102 places, 86/95 transitions.
[2024-06-02 18:17:02] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:17:02] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:17:02] [INFO ] Input system was already deterministic with 86 transitions.
[2024-06-02 18:17:02] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:02] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality947542936395481398.gal : 2 ms
[2024-06-02 18:17:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality16539668366460619852.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/CTLCardinality947542936395481398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16539668366460619852.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.10961e+08,0.331432,13708,2,1699,5,33572,6,0,460,64463,0


Converting to forward existential form...Done !
original formula: AF(!(E((EX((p60==1)) + EF((((p28==0)||(p2==1))||((p68==0)||(p31==1))))) U EF((p103==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((EX((p60==1)) + E(TRUE U (((p28==0)||(p2==1))||((p68==0)||(p31==1))))) U E(TRUE U (p103==0)))))...165
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t20, t25, t27, t32, t34, t40, t42, t43, t48, t51, t52, t72, Intersect...243
(forward)formula 0,0,12.1553,281304,1,0,3026,1.22225e+06,200,1526,2755,2.02341e+06,2405
FORMULA MedleyA-PT-03-CTLCardinality-2024-03 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 : 102/102 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 101 transition count 78
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 85 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 84 transition count 77
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 34 place count 84 transition count 69
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 50 place count 76 transition count 69
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 54 place count 72 transition count 65
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 72 transition count 65
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 86 place count 58 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 57 transition count 50
Applied a total of 88 rules in 34 ms. Remains 57 /102 variables (removed 45) and now considering 50/95 (removed 45) transitions.
// Phase 1: matrix 50 rows 57 cols
[2024-06-02 18:17:14] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:17:14] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:17:14] [INFO ] Invariant cache hit.
[2024-06-02 18:17:14] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-06-02 18:17:14] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-02 18:17:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 18:17:15] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 50/106 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/107 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 66 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 50/106 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 47/112 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 113 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints]
After SMT, in 3320ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3322ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/102 places, 50/95 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3552 ms. Remains : 57/102 places, 50/95 transitions.
[2024-06-02 18:17:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:17:17] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:17:17] [INFO ] Input system was already deterministic with 50 transitions.
[2024-06-02 18:17:17] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:17:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17914986886717924682.gal : 2 ms
[2024-06-02 18:17:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9839952585527090911.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/CTLCardinality17914986886717924682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9839952585527090911.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.00034e+06,0.024772,4068,2,657,5,3135,6,0,279,2394,0


Converting to forward existential form...Done !
original formula: EF((E(!(EF(((p54==0)||(p46==1)))) U !(((p100==0)||(p77==1)))) * (p103==0)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p103==0)),!(E(TRUE U ((p54==0)||(p46==1))))) * !(((p100==0)||(p77==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t6, t9, t11, t13, t19, t42, t43, Intersection with reachable at each step enable...205
(forward)formula 0,1,0.208553,10404,1,0,125,43218,128,57,1713,31266,118
FORMULA MedleyA-PT-03-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 101 transition count 75
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 82 transition count 75
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 38 place count 82 transition count 66
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 56 place count 73 transition count 66
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 67 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 67 transition count 60
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 2 with 24 rules applied. Total rules applied 92 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 54 transition count 47
Applied a total of 93 rules in 24 ms. Remains 54 /102 variables (removed 48) and now considering 47/95 (removed 48) transitions.
// Phase 1: matrix 47 rows 54 cols
[2024-06-02 18:17:18] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:17:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:17:18] [INFO ] Invariant cache hit.
[2024-06-02 18:17:18] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 18:17:18] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:17:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 2515ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2517ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/102 places, 47/95 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2721 ms. Remains : 54/102 places, 47/95 transitions.
[2024-06-02 18:17:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:20] [INFO ] Input system was already deterministic with 47 transitions.
[2024-06-02 18:17:20] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:17:20] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:17:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality6754309431709517497.gal : 1 ms
[2024-06-02 18:17:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6677280639736584255.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/CTLCardinality6754309431709517497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6677280639736584255.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.58445e+06,0.021196,4044,2,622,5,2791,6,0,265,2106,0


Converting to forward existential form...Done !
original formula: AG(AF((p52==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p52==1)))] = FALSE
Hit Full ! (commute/partial/dont) 45/0/2
(forward)formula 0,0,0.357837,14976,1,0,427,74065,19,3,1332,54479,425
FORMULA MedleyA-PT-03-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 86
Applied a total of 18 rules in 6 ms. Remains 93 /102 variables (removed 9) and now considering 86/95 (removed 9) transitions.
// Phase 1: matrix 86 rows 93 cols
[2024-06-02 18:17:21] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:17:21] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:17:21] [INFO ] Invariant cache hit.
[2024-06-02 18:17:21] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-06-02 18:17:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:22] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:17:22] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:17:22] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:22] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/179 variables, 93/105 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:23] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 106 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3652 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/179 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 85/191 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:26] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-06-02 18:17:28] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:17:28] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/179 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 194 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5850 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints]
After SMT, in 9521ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 9522ms
Starting structural reductions in LTL mode, iteration 1 : 93/102 places, 86/95 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9715 ms. Remains : 93/102 places, 86/95 transitions.
[2024-06-02 18:17:31] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:17:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:31] [INFO ] Input system was already deterministic with 86 transitions.
[2024-06-02 18:17:31] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:31] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:17:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9067909473354247259.gal : 1 ms
[2024-06-02 18:17:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality7863477713632172296.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/CTLCardinality9067909473354247259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7863477713632172296.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.10961e+08,0.324694,13708,2,1699,5,33572,6,0,460,64463,0


Converting to forward existential form...Done !
original formula: (EX(((EX((((AX((p92==1)) * (p65==0)) + (p78==0)) + ((p25==0)&&(p38==1)))) * AG((((p74==0)&&(p84==0))&&(p98==1)))) * ((p35==0) * (EX(((p10...216
=> equivalent forward existential formula: (([(EY(((EY(Init) * (EX((((!(EX(!((p92==1)))) * (p65==0)) + (p78==0)) + ((p25==0)&&(p38==1)))) * !(E(TRUE U !(((...492
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t13, t18, t20, t25, t27, t32, t34, t40, t42, t43, t48, t51, t52, t72, Intersect...243
(forward)formula 0,0,5.82683,149224,1,0,990,638408,210,115,2778,971545,995
FORMULA MedleyA-PT-03-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 101 transition count 78
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 85 transition count 78
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 85 transition count 70
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 77 transition count 70
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 73 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 73 transition count 66
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 78 place count 62 transition count 55
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 62 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 61 transition count 54
Applied a total of 80 rules in 19 ms. Remains 61 /102 variables (removed 41) and now considering 54/95 (removed 41) transitions.
// Phase 1: matrix 54 rows 61 cols
[2024-06-02 18:17:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:17:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:17:37] [INFO ] Invariant cache hit.
[2024-06-02 18:17:37] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-02 18:17:37] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-02 18:17:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:17:37] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:17:37] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:17:38] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:17:38] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 54/115 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:17:38] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/115 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 74 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2500 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/115 variables, 61/74 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 53/127 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 127 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2577 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints]
After SMT, in 5093ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 5094ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/102 places, 54/95 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5297 ms. Remains : 61/102 places, 54/95 transitions.
[2024-06-02 18:17:42] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:42] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:42] [INFO ] Input system was already deterministic with 54 transitions.
[2024-06-02 18:17:42] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:42] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2171462981188115603.gal : 2 ms
[2024-06-02 18:17:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality860515260782730599.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/CTLCardinality2171462981188115603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality860515260782730599.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.57287e+06,0.049955,4360,2,844,5,4747,6,0,299,3969,0


Converting to forward existential form...Done !
original formula: (AG(((p83==1) + AG(((p70==0)||(p53==1))))) + EG(AG((EG(((p78==0)&&(p61==1))) + EF((p13==1))))))
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(EG(!(E(TRUE U !((EG(((p78==0)&&(p61==1))) + E(TRUE U (p13==1))))))))),TRUE) * !((p83==1))...198
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t7, t8, t12, t14, t16, t18, t46, t47, t51, t53, Intersection with reachable at each ...216
(forward)formula 0,0,0.722293,21856,1,0,558,111238,143,67,1964,89841,558
FORMULA MedleyA-PT-03-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 101 transition count 75
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 82 transition count 75
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 38 place count 82 transition count 66
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 56 place count 73 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 69 transition count 62
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 69 transition count 62
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 86 place count 58 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 57 transition count 50
Applied a total of 88 rules in 23 ms. Remains 57 /102 variables (removed 45) and now considering 50/95 (removed 45) transitions.
// Phase 1: matrix 50 rows 57 cols
[2024-06-02 18:17:43] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:17:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 18:17:43] [INFO ] Invariant cache hit.
[2024-06-02 18:17:43] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 18:17:43] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:17:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:17:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 50/107 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:17:44] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 67 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1610 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 50/107 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 49/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 116 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1883 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 2/2 constraints]
After SMT, in 3526ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 3528ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/102 places, 50/95 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3766 ms. Remains : 57/102 places, 50/95 transitions.
[2024-06-02 18:17:46] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:17:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:46] [INFO ] Input system was already deterministic with 50 transitions.
[2024-06-02 18:17:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3399322508719454605.gal : 1 ms
[2024-06-02 18:17:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality2540050010049960719.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/CTLCardinality3399322508719454605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2540050010049960719.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.60588e+06,0.039794,4072,2,783,5,3304,6,0,279,2394,0


Converting to forward existential form...Done !
original formula: AF(((AF(((p107==0)||(p6==1))) * EF((((p78==0)||(p66==1))||(p90==1)))) * (((p78==0)&&(p60==1))||((p78==0)&&(p61==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(((p107==0)||(p6==1))))) * E(TRUE U (((p78==0)||(p66==1))||(p90==1)))) * (((p78==0)&&(p60==...193
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t7, t9, t11, t13, t21, t40, t43, t49, Intersection with reachable at each st...214
(forward)formula 0,0,0.764486,20212,1,0,589,104513,132,96,1796,83249,573
FORMULA MedleyA-PT-03-CTLCardinality-2024-11 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 : 102/102 places, 95/95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 101 transition count 75
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 82 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 81 transition count 74
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 40 place count 81 transition count 65
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 58 place count 72 transition count 65
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 67 transition count 60
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 67 transition count 60
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 3 with 24 rules applied. Total rules applied 92 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 54 transition count 47
Applied a total of 93 rules in 20 ms. Remains 54 /102 variables (removed 48) and now considering 47/95 (removed 48) transitions.
// Phase 1: matrix 47 rows 54 cols
[2024-06-02 18:17:47] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:17:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:17:47] [INFO ] Invariant cache hit.
[2024-06-02 18:17:47] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-06-02 18:17:47] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:17:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/101 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1351 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 47/100 variables, 53/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 108 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2156 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 3531ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3534ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/102 places, 47/95 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3786 ms. Remains : 54/102 places, 47/95 transitions.
[2024-06-02 18:17:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:51] [INFO ] Input system was already deterministic with 47 transitions.
[2024-06-02 18:17:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:51] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:17:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13505533615406545607.gal : 1 ms
[2024-06-02 18:17:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16162090997227144106.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/CTLCardinality13505533615406545607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16162090997227144106.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,1.44179e+06,0.031756,4048,2,635,5,2803,6,0,265,2089,0


Converting to forward existential form...Done !
original formula: EG(EF((AF((p5==1)) + (p105==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(EG(!((p5==1)))) + (p105==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t10, t12, t17, t38, Intersection with reachable at each step enabled. (d...199
(forward)formula 0,1,2.77666,72488,1,0,1489,434778,125,679,1698,555509,1230
FORMULA MedleyA-PT-03-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 18:17:54] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:17:54] [INFO ] Flatten gal took : 5 ms
Total runtime 155571 ms.

BK_STOP 1717352274346

--------------------
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="MedleyA-PT-03"
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 MedleyA-PT-03, 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 r576-smll-171734919800017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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