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.r550-tall-171734899000289.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 FireWire-PT-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 84K 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 FireWire-PT-16-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717368196139

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 22:43:17] [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 22:43:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:43:17] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 22:43:17] [INFO ] Transformed 254 places.
[2024-06-02 22:43:17] [INFO ] Transformed 368 transitions.
[2024-06-02 22:43:17] [INFO ] Found NUPN structural information;
[2024-06-02 22:43:17] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Support contains 119 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 230 transition count 347
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 230 transition count 347
Applied a total of 45 rules in 37 ms. Remains 230 /254 variables (removed 24) and now considering 347/368 (removed 21) transitions.
// Phase 1: matrix 347 rows 230 cols
[2024-06-02 22:43:17] [INFO ] Computed 4 invariants in 24 ms
[2024-06-02 22:43:17] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-02 22:43:17] [INFO ] Invariant cache hit.
[2024-06-02 22:43:18] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-06-02 22:43:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 346 unsolved
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 19 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 96 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:43:21] [INFO ] Deduced a trap composed of 109 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 106 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 111 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:43:22] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:43:23] [INFO ] Deduced a trap composed of 123 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:43:23] [INFO ] Deduced a trap composed of 125 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:43:23] [INFO ] Deduced a trap composed of 108 places in 74 ms of which 1 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
[2024-06-02 22:43:24] [INFO ] Deduced a trap composed of 106 places in 71 ms of which 2 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 20/24 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:24] [INFO ] Deduced a trap composed of 96 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:43:25] [INFO ] Deduced a trap composed of 113 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:43:25] [INFO ] Deduced a trap composed of 114 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:43:25] [INFO ] Deduced a trap composed of 113 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:43:25] [INFO ] Deduced a trap composed of 107 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:43:25] [INFO ] Deduced a trap composed of 108 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 6/30 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 101 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 107 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 116 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:43:28] [INFO ] Deduced a trap composed of 110 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 6/36 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:30] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:43:30] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 2/38 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:33] [INFO ] Deduced a trap composed of 102 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 1/39 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:36] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:43:36] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 2/41 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:38] [INFO ] Deduced a trap composed of 102 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:43:38] [INFO ] Deduced a trap composed of 111 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 2/43 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/43 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 10 (OVERLAPS) 347/577 variables, 230/273 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:43] [INFO ] Deduced a trap composed of 105 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:43:43] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 2/275 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:47] [INFO ] Deduced a trap composed of 110 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:43:47] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 277 constraints, problems are : Problem set: 11 solved, 335 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 11 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 43/47 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:50] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 1/48 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:43:52] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/49 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/49 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 347/577 variables, 230/279 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 335/614 constraints. Problems are: Problem set: 11 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 0/614 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:44:09] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/577 variables, 1/615 constraints. Problems are: Problem set: 11 solved, 335 unsolved
[2024-06-02 22:44:12] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:44:13] [INFO ] Deduced a trap composed of 100 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 2/617 constraints. Problems are: Problem set: 11 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/577 variables, and 617 constraints, problems are : Problem set: 11 solved, 335 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 335/346 constraints, Known Traps: 48/48 constraints]
After SMT, in 60185ms problems are : Problem set: 11 solved, 335 unsolved
Search for dead transitions found 11 dead transitions in 60203ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 230/254 places, 336/368 transitions.
Applied a total of 0 rules in 6 ms. Remains 230 /230 variables (removed 0) and now considering 336/336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60782 ms. Remains : 230/254 places, 336/368 transitions.
Support contains 119 out of 230 places after structural reductions.
[2024-06-02 22:44:18] [INFO ] Flatten gal took : 58 ms
[2024-06-02 22:44:18] [INFO ] Flatten gal took : 33 ms
[2024-06-02 22:44:18] [INFO ] Input system was already deterministic with 336 transitions.
Support contains 106 out of 230 places (down from 119) after GAL structural reductions.
RANDOM walk for 40000 steps (11 resets) in 2538 ms. (15 steps per ms) remains 44/73 properties
BEST_FIRST walk for 4001 steps (10 resets) in 23 ms. (166 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4000 steps (10 resets) in 19 ms. (200 steps per ms) remains 39/42 properties
BEST_FIRST walk for 4001 steps (9 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (11 resets) in 37 ms. (105 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (10 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (11 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (10 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (10 resets) in 26 ms. (148 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4000 steps (9 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (10 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (10 resets) in 46 ms. (85 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4001 steps (11 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (11 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (10 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (10 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (11 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (10 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (11 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (11 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (9 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (9 resets) in 43 ms. (90 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (9 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
// Phase 1: matrix 336 rows 230 cols
[2024-06-02 22:44:20] [INFO ] Computed 4 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 161/210 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 322/532 variables, 210/214 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 20/552 variables, 11/225 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 12/564 variables, 7/232 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 2/566 variables, 2/234 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/566 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 234 constraints, problems are : Problem set: 1 solved, 34 unsolved in 1588 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 164/210 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:44:21] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:44:21] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:44:21] [INFO ] Deduced a trap composed of 118 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 105 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 105 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 115 places in 65 ms of which 8 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 102 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 148 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 107 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 107 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:44:22] [INFO ] Deduced a trap composed of 108 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 107 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:44:23] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 322/532 variables, 210/232 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 29/261 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:44:24] [INFO ] Deduced a trap composed of 97 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:44:24] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:44:24] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:44:24] [INFO ] Deduced a trap composed of 107 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:44:24] [INFO ] Deduced a trap composed of 99 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 5/266 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:44:25] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 1/267 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-06-02 22:44:26] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 1/268 constraints. Problems are: Problem set: 1 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/566 variables, and 268 constraints, problems are : Problem set: 1 solved, 34 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 210/230 constraints, PredecessorRefiner: 29/35 constraints, Known Traps: 25/25 constraints]
After SMT, in 6617ms problems are : Problem set: 1 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 336/336 transitions.
Graph (trivial) has 132 edges and 230 vertex of which 19 / 230 are part of one of the 3 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 214 transition count 281
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 179 transition count 278
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 9 rules applied. Total rules applied 83 place count 177 transition count 271
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 90 place count 170 transition count 271
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 90 place count 170 transition count 264
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 104 place count 163 transition count 264
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 116 place count 151 transition count 252
Iterating global reduction 4 with 12 rules applied. Total rules applied 128 place count 151 transition count 252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 128 place count 151 transition count 251
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 150 transition count 251
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 149 transition count 250
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 149 transition count 250
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 168 place count 131 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 184 place count 123 transition count 277
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 123 transition count 276
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 195 place count 123 transition count 266
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 205 place count 113 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 219 place count 113 transition count 252
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 223 place count 113 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 224 place count 112 transition count 251
Applied a total of 224 rules in 93 ms. Remains 112 /230 variables (removed 118) and now considering 251/336 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 112/230 places, 251/336 transitions.
RANDOM walk for 40000 steps (2855 resets) in 453 ms. (88 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (89 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (88 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (84 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (90 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (74 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (85 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (91 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (86 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (87 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (87 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (87 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (84 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (81 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (84 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (94 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (84 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (84 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (89 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (87 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (82 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (85 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (88 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (89 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (87 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (84 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (80 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (87 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (90 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (82 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (88 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (89 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (98 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (84 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (88 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
Finished probabilistic random walk after 44294 steps, run visited all 34 properties in 295 ms. (steps per millisecond=150 )
Probabilistic random walk after 44294 steps, saw 12402 distinct states, run finished after 299 ms. (steps per millisecond=148 ) properties seen :34
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:44:27] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:44:27] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:44:27] [INFO ] Input system was already deterministic with 336 transitions.
Computed a total of 31 stabilizing places and 33 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Graph (trivial) has 182 edges and 230 vertex of which 14 / 230 are part of one of the 2 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 217 transition count 264
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 159 transition count 261
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 157 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 156 transition count 260
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 124 place count 156 transition count 253
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 138 place count 149 transition count 253
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 152 place count 135 transition count 230
Iterating global reduction 4 with 14 rules applied. Total rules applied 166 place count 135 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 135 transition count 229
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 167 place count 135 transition count 226
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 173 place count 132 transition count 226
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 177 place count 128 transition count 210
Iterating global reduction 5 with 4 rules applied. Total rules applied 181 place count 128 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 182 place count 128 transition count 209
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 216 place count 111 transition count 192
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 110 transition count 190
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 110 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 220 place count 109 transition count 189
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 222 place count 109 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 108 transition count 188
Applied a total of 223 rules in 59 ms. Remains 108 /230 variables (removed 122) and now considering 188/336 (removed 148) transitions.
[2024-06-02 22:44:27] [INFO ] Flow matrix only has 187 transitions (discarded 1 similar events)
// Phase 1: matrix 187 rows 108 cols
[2024-06-02 22:44:27] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:44:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:44:27] [INFO ] Flow matrix only has 187 transitions (discarded 1 similar events)
[2024-06-02 22:44:27] [INFO ] Invariant cache hit.
[2024-06-02 22:44:27] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 22:44:27] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 22:44:27] [INFO ] Redundant transitions in 6 ms returned []
Running 183 sub problems to find dead transitions.
[2024-06-02 22:44:27] [INFO ] Flow matrix only has 187 transitions (discarded 1 similar events)
[2024-06-02 22:44:27] [INFO ] Invariant cache hit.
[2024-06-02 22:44:27] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 2 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 67 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:44:28] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 186/293 variables, 107/121 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 11/132 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/132 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 1/294 variables, 1/133 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/133 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/133 constraints. Problems are: Problem set: 15 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/295 variables, and 133 constraints, problems are : Problem set: 15 solved, 168 unsolved in 4992 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 15 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 186/293 variables, 107/121 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 11/132 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 168/300 constraints. Problems are: Problem set: 15 solved, 168 unsolved
[2024-06-02 22:44:33] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 1/301 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/301 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 1/294 variables, 1/302 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/302 constraints. Problems are: Problem set: 15 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/294 variables, 0/302 constraints. Problems are: Problem set: 15 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/295 variables, and 302 constraints, problems are : Problem set: 15 solved, 168 unsolved in 8071 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 108/108 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 168/183 constraints, Known Traps: 11/11 constraints]
After SMT, in 13116ms problems are : Problem set: 15 solved, 168 unsolved
Search for dead transitions found 15 dead transitions in 13120ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 108/230 places, 173/336 transitions.
Applied a total of 0 rules in 14 ms. Remains 108 /108 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-06-02 22:44:40] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 13396 ms. Remains : 108/230 places, 173/336 transitions.
[2024-06-02 22:44:40] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:44:40] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:44:40] [INFO ] Input system was already deterministic with 173 transitions.
[2024-06-02 22:44:40] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:44:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:44:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality3096351115386444176.gal : 3 ms
[2024-06-02 22:44:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality10020989796143021130.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3096351115386444176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10020989796143021130.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,117819,0.101589,7072,2,1217,5,9677,6,0,604,13224,0


Converting to forward existential form...Done !
original formula: E((EF(AG(((p25==0)||(p106==1)))) * (EG(AG((p45==0))) + E(((p113==1)&&(p30==1)) U (!(EF((p115==1))) + AF(((p179==0)||(p197==1))))))) U EG(...166
=> equivalent forward existential formula: [FwdG(FwdU(Init,(E(TRUE U !(E(TRUE U !(((p25==0)||(p106==1)))))) * (EG(!(E(TRUE U !((p45==0))))) + E(((p113==1)&...252
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t11, t15, t17, t27, t38, t40, t45, t46, t49, t50, t51, t107, t109, t113, t115, t116, ...291
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 171/0/2
(forward)formula 0,1,12.3503,402984,1,0,807,2.55177e+06,398,505,4635,2.25628e+06,1010
FORMULA FireWire-PT-16-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Graph (trivial) has 186 edges and 230 vertex of which 19 / 230 are part of one of the 3 SCC in 2 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 213 transition count 259
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 122 place count 154 transition count 256
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 126 place count 152 transition count 254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 128 place count 150 transition count 254
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 128 place count 150 transition count 249
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 138 place count 145 transition count 249
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 154 place count 129 transition count 224
Iterating global reduction 4 with 16 rules applied. Total rules applied 170 place count 129 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 129 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 173 place count 128 transition count 222
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 173 place count 128 transition count 218
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 181 place count 124 transition count 218
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 185 place count 120 transition count 202
Iterating global reduction 6 with 4 rules applied. Total rules applied 189 place count 120 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 190 place count 120 transition count 201
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 222 place count 104 transition count 185
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 223 place count 103 transition count 183
Iterating global reduction 7 with 1 rules applied. Total rules applied 224 place count 103 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 226 place count 102 transition count 182
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 228 place count 102 transition count 182
Applied a total of 228 rules in 41 ms. Remains 102 /230 variables (removed 128) and now considering 182/336 (removed 154) transitions.
[2024-06-02 22:44:53] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
// Phase 1: matrix 179 rows 102 cols
[2024-06-02 22:44:53] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:44:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 22:44:53] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
[2024-06-02 22:44:53] [INFO ] Invariant cache hit.
[2024-06-02 22:44:53] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 22:44:53] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 22:44:53] [INFO ] Redundant transitions in 1 ms returned []
Running 178 sub problems to find dead transitions.
[2024-06-02 22:44:53] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
[2024-06-02 22:44:53] [INFO ] Invariant cache hit.
[2024-06-02 22:44:53] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
[2024-06-02 22:44:54] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 163 unsolved
[2024-06-02 22:44:55] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/11 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 178/280 variables, 102/113 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 11/124 constraints. Problems are: Problem set: 15 solved, 163 unsolved
[2024-06-02 22:44:56] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/125 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/125 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/125 constraints. Problems are: Problem set: 15 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 125 constraints, problems are : Problem set: 15 solved, 163 unsolved in 5956 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 6/7 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 3/10 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/12 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 178/280 variables, 102/114 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 11/125 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 163/288 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/288 constraints. Problems are: Problem set: 15 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/288 constraints. Problems are: Problem set: 15 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 288 constraints, problems are : Problem set: 15 solved, 163 unsolved in 4406 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 163/178 constraints, Known Traps: 8/8 constraints]
After SMT, in 10412ms problems are : Problem set: 15 solved, 163 unsolved
Search for dead transitions found 15 dead transitions in 10414ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 102/230 places, 167/336 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2024-06-02 22:45:04] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 10645 ms. Remains : 102/230 places, 167/336 transitions.
[2024-06-02 22:45:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:45:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:45:04] [INFO ] Input system was already deterministic with 167 transitions.
[2024-06-02 22:45:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:45:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:45:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality568747600983648226.gal : 3 ms
[2024-06-02 22:45:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality760898310310907461.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/CTLCardinality568747600983648226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality760898310310907461.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,88354,0.081888,6856,2,959,5,9100,6,0,573,12365,0


Converting to forward existential form...Done !
original formula: EF(EG(((A((p99==1) U (p102==1)) * (p250==0)) * ((p106==1)&&(((p142==1)||(p202==0))||(p143==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((!((E(!((p102==1)) U (!((p99==1)) * !((p102==1)))) + EG(!((p102==1))))) * (p250==0)) * ((...213
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t17, t24, t27, t37, t39, t44, t46, t52, t100, t102, t107, t108, t141, t142, t143, t14...276
(forward)formula 0,0,1.84392,72216,1,0,480,423202,363,241,3998,409994,561
FORMULA FireWire-PT-16-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Graph (trivial) has 194 edges and 230 vertex of which 15 / 230 are part of one of the 2 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 216 transition count 258
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 66 rules applied. Total rules applied 130 place count 153 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 132 place count 151 transition count 255
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 132 place count 151 transition count 250
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 142 place count 146 transition count 250
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 159 place count 129 transition count 224
Iterating global reduction 3 with 17 rules applied. Total rules applied 176 place count 129 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 179 place count 129 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 128 transition count 221
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 180 place count 128 transition count 217
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 188 place count 124 transition count 217
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 192 place count 120 transition count 201
Iterating global reduction 5 with 4 rules applied. Total rules applied 196 place count 120 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 197 place count 120 transition count 200
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 231 place count 103 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 232 place count 102 transition count 181
Iterating global reduction 6 with 1 rules applied. Total rules applied 233 place count 102 transition count 181
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 235 place count 100 transition count 179
Applied a total of 235 rules in 29 ms. Remains 100 /230 variables (removed 130) and now considering 179/336 (removed 157) transitions.
[2024-06-02 22:45:05] [INFO ] Flow matrix only has 177 transitions (discarded 2 similar events)
// Phase 1: matrix 177 rows 100 cols
[2024-06-02 22:45:06] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:45:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:45:06] [INFO ] Flow matrix only has 177 transitions (discarded 2 similar events)
[2024-06-02 22:45:06] [INFO ] Invariant cache hit.
[2024-06-02 22:45:06] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 22:45:06] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 22:45:06] [INFO ] Redundant transitions in 0 ms returned []
Running 174 sub problems to find dead transitions.
[2024-06-02 22:45:06] [INFO ] Flow matrix only has 177 transitions (discarded 2 similar events)
[2024-06-02 22:45:06] [INFO ] Invariant cache hit.
[2024-06-02 22:45:06] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 22:45:06] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:45:06] [INFO ] Deduced a trap composed of 53 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:45:06] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:45:06] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2024-06-02 22:45:06] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
[2024-06-02 22:45:07] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
[2024-06-02 22:45:07] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
[2024-06-02 22:45:07] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:45:07] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 176/275 variables, 99/112 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 11/123 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/123 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/124 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/124 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 1/277 variables, 1/125 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/125 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/125 constraints. Problems are: Problem set: 15 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 125 constraints, problems are : Problem set: 15 solved, 159 unsolved in 6107 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 15 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 159 unsolved
[2024-06-02 22:45:12] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 176/275 variables, 99/113 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 11/124 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 159/283 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/283 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/284 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/284 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 1/277 variables, 1/285 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/285 constraints. Problems are: Problem set: 15 solved, 159 unsolved
At refinement iteration 12 (OVERLAPS) 0/277 variables, 0/285 constraints. Problems are: Problem set: 15 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 285 constraints, problems are : Problem set: 15 solved, 159 unsolved in 7835 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 159/174 constraints, Known Traps: 10/10 constraints]
After SMT, in 13984ms problems are : Problem set: 15 solved, 159 unsolved
Search for dead transitions found 15 dead transitions in 13987ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 100/230 places, 164/336 transitions.
Applied a total of 0 rules in 12 ms. Remains 100 /100 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-06-02 22:45:20] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 14218 ms. Remains : 100/230 places, 164/336 transitions.
[2024-06-02 22:45:20] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:45:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:45:20] [INFO ] Input system was already deterministic with 164 transitions.
[2024-06-02 22:45:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:45:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:45:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10847836321226262995.gal : 1 ms
[2024-06-02 22:45:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality10028368963696876771.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/CTLCardinality10847836321226262995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10028368963696876771.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,85449,0.085425,6844,2,944,5,9342,6,0,563,13076,0


Converting to forward existential form...Done !
original formula: EG((p3==0))
=> equivalent forward existential formula: [FwdG(Init,(p3==0))] != FALSE
Hit Full ! (commute/partial/dont) 162/0/2
(forward)formula 0,1,0.286618,13972,1,0,8,41504,19,4,2957,31594,8
FORMULA FireWire-PT-16-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Graph (trivial) has 187 edges and 230 vertex of which 19 / 230 are part of one of the 3 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 213 transition count 260
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 155 transition count 257
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 153 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 152 transition count 256
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 124 place count 152 transition count 251
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 134 place count 147 transition count 251
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 152 place count 129 transition count 224
Iterating global reduction 4 with 18 rules applied. Total rules applied 170 place count 129 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 173 place count 129 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 128 transition count 221
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 174 place count 128 transition count 217
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 182 place count 124 transition count 217
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 185 place count 121 transition count 203
Iterating global reduction 6 with 3 rules applied. Total rules applied 188 place count 121 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 189 place count 121 transition count 202
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 219 place count 106 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 221 place count 105 transition count 186
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 222 place count 105 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 104 transition count 185
Applied a total of 223 rules in 27 ms. Remains 104 /230 variables (removed 126) and now considering 185/336 (removed 151) transitions.
[2024-06-02 22:45:20] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
// Phase 1: matrix 182 rows 104 cols
[2024-06-02 22:45:20] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:45:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:45:20] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
[2024-06-02 22:45:20] [INFO ] Invariant cache hit.
[2024-06-02 22:45:20] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 22:45:20] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-02 22:45:20] [INFO ] Redundant transitions in 0 ms returned []
Running 180 sub problems to find dead transitions.
[2024-06-02 22:45:20] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
[2024-06-02 22:45:20] [INFO ] Invariant cache hit.
[2024-06-02 22:45:20] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
[2024-06-02 22:45:21] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 7/11 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 181/284 variables, 103/114 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 11/125 constraints. Problems are: Problem set: 16 solved, 164 unsolved
[2024-06-02 22:45:23] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:45:23] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 2/127 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/127 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 1/285 variables, 1/128 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/128 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/128 constraints. Problems are: Problem set: 16 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/286 variables, and 128 constraints, problems are : Problem set: 16 solved, 164 unsolved in 6263 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 16 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/13 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 181/284 variables, 103/116 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 11/127 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 164/291 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/291 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 1/285 variables, 1/292 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/292 constraints. Problems are: Problem set: 16 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/292 constraints. Problems are: Problem set: 16 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/286 variables, and 292 constraints, problems are : Problem set: 16 solved, 164 unsolved in 5556 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 164/180 constraints, Known Traps: 9/9 constraints]
After SMT, in 11856ms problems are : Problem set: 16 solved, 164 unsolved
Search for dead transitions found 16 dead transitions in 11858ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/230 places, 169/336 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2024-06-02 22:45:32] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 12087 ms. Remains : 104/230 places, 169/336 transitions.
[2024-06-02 22:45:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:45:32] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:45:32] [INFO ] Input system was already deterministic with 169 transitions.
[2024-06-02 22:45:32] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:45:32] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:45:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15909668722714369695.gal : 1 ms
[2024-06-02 22:45:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality14446966195332939221.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/CTLCardinality15909668722714369695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14446966195332939221.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,79646,0.084057,6872,2,960,5,9027,6,0,583,12338,0


Converting to forward existential form...Done !
original formula: EG(EF(((AG((((p96==0)&&(p224==0))&&(p103==1))) * (p128==0)) * ((p178==0)||((p158==0)&&(p234==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(E(TRUE U !((((p96==0)&&(p224==0))&&(p103==1))))) * (p128==0)) * ((p178==0)||((p158==0)&&...179
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t17, t19, t29, t40, t46, t48, t54, t95, t102, t105, t110, t111, t146, t147, t148, t14...276
(forward)formula 0,1,3.03599,108356,1,0,557,586440,364,388,4110,548047,629
FORMULA FireWire-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Graph (trivial) has 191 edges and 230 vertex of which 15 / 230 are part of one of the 2 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 216 transition count 258
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 66 rules applied. Total rules applied 130 place count 153 transition count 255
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 151 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 150 transition count 254
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 134 place count 150 transition count 249
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 144 place count 145 transition count 249
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 162 place count 127 transition count 222
Iterating global reduction 4 with 18 rules applied. Total rules applied 180 place count 127 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 183 place count 127 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 126 transition count 219
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 184 place count 126 transition count 215
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 192 place count 122 transition count 215
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 195 place count 119 transition count 202
Iterating global reduction 6 with 3 rules applied. Total rules applied 198 place count 119 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 199 place count 119 transition count 201
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 231 place count 103 transition count 185
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 232 place count 102 transition count 183
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 102 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 102 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 236 place count 100 transition count 181
Applied a total of 236 rules in 28 ms. Remains 100 /230 variables (removed 130) and now considering 181/336 (removed 155) transitions.
[2024-06-02 22:45:35] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
// Phase 1: matrix 179 rows 100 cols
[2024-06-02 22:45:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:45:35] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 22:45:35] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
[2024-06-02 22:45:35] [INFO ] Invariant cache hit.
[2024-06-02 22:45:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 22:45:35] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-06-02 22:45:35] [INFO ] Redundant transitions in 0 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 22:45:35] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
[2024-06-02 22:45:35] [INFO ] Invariant cache hit.
[2024-06-02 22:45:35] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 22:45:36] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
[2024-06-02 22:45:37] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD161 is UNSAT
[2024-06-02 22:45:38] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 0 ms to minimize.
Problem TDEAD164 is UNSAT
[2024-06-02 22:45:38] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 8/13 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 178/277 variables, 99/112 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 11/123 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/123 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 1/278 variables, 1/124 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/124 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 1/279 variables, 1/125 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/125 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 13 (OVERLAPS) 0/279 variables, 0/125 constraints. Problems are: Problem set: 18 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 125 constraints, problems are : Problem set: 18 solved, 158 unsolved in 7114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 18 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 4/7 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/8 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 5/13 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 178/277 variables, 99/112 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 11/123 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 158/281 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/281 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 1/278 variables, 1/282 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/282 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/283 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/283 constraints. Problems are: Problem set: 18 solved, 158 unsolved
At refinement iteration 14 (OVERLAPS) 0/279 variables, 0/283 constraints. Problems are: Problem set: 18 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 283 constraints, problems are : Problem set: 18 solved, 158 unsolved in 8622 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 100/100 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 158/176 constraints, Known Traps: 9/9 constraints]
After SMT, in 15775ms problems are : Problem set: 18 solved, 158 unsolved
Search for dead transitions found 18 dead transitions in 15777ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 100/230 places, 163/336 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-02 22:45:51] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 15971 ms. Remains : 100/230 places, 163/336 transitions.
[2024-06-02 22:45:51] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:45:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:45:51] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-02 22:45:51] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:45:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:45:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality1104196529689528995.gal : 4 ms
[2024-06-02 22:45:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality4164891585844247053.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/CTLCardinality1104196529689528995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4164891585844247053.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,80012,0.08188,6836,2,908,5,8851,6,0,562,12284,0


Converting to forward existential form...Done !
original formula: EG(((p79==0)||(p98==1)))
=> equivalent forward existential formula: [FwdG(Init,((p79==0)||(p98==1)))] != FALSE
Hit Full ! (commute/partial/dont) 157/0/6
(forward)formula 0,0,0.19754,10796,1,0,9,33212,19,3,2959,15141,8
FORMULA FireWire-PT-16-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 196 transition count 293
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 196 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 196 transition count 292
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 84 place count 181 transition count 273
Iterating global reduction 1 with 15 rules applied. Total rules applied 99 place count 181 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 181 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 180 transition count 271
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 180 transition count 271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 179 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 179 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 178 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 178 transition count 269
Applied a total of 106 rules in 14 ms. Remains 178 /230 variables (removed 52) and now considering 269/336 (removed 67) transitions.
// Phase 1: matrix 269 rows 178 cols
[2024-06-02 22:45:51] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:45:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:45:52] [INFO ] Invariant cache hit.
[2024-06-02 22:45:52] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-02 22:45:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 22:45:53] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:45:53] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:45:53] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:45:54] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:45:54] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:45:54] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
[2024-06-02 22:45:54] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
[2024-06-02 22:45:55] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
Problem TDEAD251 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 269/447 variables, 178/190 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:45:57] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:45:57] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:45:58] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:45:58] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:45:58] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 5/195 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/195 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 0/447 variables, 0/195 constraints. Problems are: Problem set: 15 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 195 constraints, problems are : Problem set: 15 solved, 253 unsolved in 11616 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 15 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 13/17 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:46:05] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:46:05] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:46:05] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:46:05] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 4/21 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 269/447 variables, 178/199 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 253/452 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/452 constraints. Problems are: Problem set: 15 solved, 253 unsolved
[2024-06-02 22:46:12] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/447 variables, 1/453 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/453 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/447 variables, 0/453 constraints. Problems are: Problem set: 15 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 453 constraints, problems are : Problem set: 15 solved, 253 unsolved in 20931 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 253/268 constraints, Known Traps: 18/18 constraints]
After SMT, in 32591ms problems are : Problem set: 15 solved, 253 unsolved
Search for dead transitions found 15 dead transitions in 32596ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 178/230 places, 254/336 transitions.
Applied a total of 0 rules in 2 ms. Remains 178 /178 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32852 ms. Remains : 178/230 places, 254/336 transitions.
[2024-06-02 22:46:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:46:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:46:24] [INFO ] Input system was already deterministic with 254 transitions.
[2024-06-02 22:46:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:46:24] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:46:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality6636895991413428158.gal : 2 ms
[2024-06-02 22:46:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality10000195274665781844.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/CTLCardinality6636895991413428158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10000195274665781844.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62207e+06,0.21021,11848,2,2245,5,22713,6,0,967,32607,0


Converting to forward existential form...Done !
original formula: EX(((EF(((p195==0)||(p178==1))) * (p126!=0)) * (A((p127==0) U (p117==0)) + (((p5==1)&&((p12==0)||(p22==1)))&&((p150==0)||(p22==1))))))
=> equivalent forward existential formula: ([(((EY(Init) * (E(TRUE U ((p195==0)||(p178==1))) * (p126!=0))) * !(EG(!((p117==0))))) * !(E(!((p117==0)) U (!((...328
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t64, t67, t81, t82, t87, t91, t95, t97, t113, t121, t...308
(forward)formula 0,0,1.88997,71544,1,0,516,308872,542,276,6402,284833,652
FORMULA FireWire-PT-16-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 197 transition count 294
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 197 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 197 transition count 293
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 187 transition count 281
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 187 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 187 transition count 280
Applied a total of 88 rules in 4 ms. Remains 187 /230 variables (removed 43) and now considering 280/336 (removed 56) transitions.
// Phase 1: matrix 280 rows 187 cols
[2024-06-02 22:46:26] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:46:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:46:26] [INFO ] Invariant cache hit.
[2024-06-02 22:46:26] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-06-02 22:46:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 22:46:29] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:46:29] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:46:29] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
[2024-06-02 22:46:29] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:46:29] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 2 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD260 is UNSAT
[2024-06-02 22:46:30] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:46:30] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 7/11 constraints. Problems are: Problem set: 16 solved, 263 unsolved
[2024-06-02 22:46:30] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:46:30] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:46:30] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 3/14 constraints. Problems are: Problem set: 16 solved, 263 unsolved
[2024-06-02 22:46:32] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/15 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 280/467 variables, 187/202 constraints. Problems are: Problem set: 16 solved, 263 unsolved
[2024-06-02 22:46:36] [INFO ] Deduced a trap composed of 114 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:46:37] [INFO ] Deduced a trap composed of 109 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 2/204 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/204 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/467 variables, 0/204 constraints. Problems are: Problem set: 16 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 204 constraints, problems are : Problem set: 16 solved, 263 unsolved in 16260 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 16 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 13/17 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/17 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 280/467 variables, 187/204 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 263/467 constraints. Problems are: Problem set: 16 solved, 263 unsolved
[2024-06-02 22:46:46] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:46:46] [INFO ] Deduced a trap composed of 75 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:46:46] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:46:46] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:46:47] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:46:47] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 6/473 constraints. Problems are: Problem set: 16 solved, 263 unsolved
[2024-06-02 22:46:50] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 1/474 constraints. Problems are: Problem set: 16 solved, 263 unsolved
[2024-06-02 22:46:55] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 1/475 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 0/475 constraints. Problems are: Problem set: 16 solved, 263 unsolved
[2024-06-02 22:47:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/467 variables, 1/476 constraints. Problems are: Problem set: 16 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/476 constraints. Problems are: Problem set: 16 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 476 constraints, problems are : Problem set: 16 solved, 263 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 263/279 constraints, Known Traps: 22/22 constraints]
After SMT, in 46316ms problems are : Problem set: 16 solved, 263 unsolved
Search for dead transitions found 16 dead transitions in 46319ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 187/230 places, 264/336 transitions.
Applied a total of 0 rules in 1 ms. Remains 187 /187 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46518 ms. Remains : 187/230 places, 264/336 transitions.
[2024-06-02 22:47:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:47:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:47:13] [INFO ] Input system was already deterministic with 264 transitions.
[2024-06-02 22:47:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:47:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:47:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality12370160002283682943.gal : 1 ms
[2024-06-02 22:47:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality8403867765605516628.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/CTLCardinality12370160002283682943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8403867765605516628.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.10138e+06,0.302674,15620,2,3242,5,29194,6,0,1013,50428,0


Converting to forward existential form...Done !
original formula: E(!(((((p54==1) + EX((p129==1))) + !(A((p163==1) U ((p29==0)||(p71==1))))) * ((AX(((p1==0)||(p44==1))) + (p132==0)) + (p237==1)))) U (!(A...283
=> equivalent forward existential formula: [FwdG((FwdU(Init,!(((((p54==1) + EX((p129==1))) + !(!((E(!(((p29==0)||(p71==1))) U (!((p163==1)) * !(((p29==0)||...491
Reverse transition relation is NOT exact ! Due to transitions t19, t23, t27, t29, t34, t35, t40, t41, t46, t50, t54, t55, t56, t69, t72, t77, t87, t92, t96...347
(forward)formula 0,0,3.43063,111484,1,0,584,482325,569,292,6711,548692,715
FORMULA FireWire-PT-16-CTLCardinality-2024-06 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 : 230/230 places, 336/336 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 194 transition count 291
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 194 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 194 transition count 290
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 87 place count 180 transition count 272
Iterating global reduction 1 with 14 rules applied. Total rules applied 101 place count 180 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 180 transition count 271
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 179 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 179 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 178 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 178 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 177 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 177 transition count 268
Applied a total of 108 rules in 11 ms. Remains 177 /230 variables (removed 53) and now considering 268/336 (removed 68) transitions.
// Phase 1: matrix 268 rows 177 cols
[2024-06-02 22:47:16] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:47:16] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:47:16] [INFO ] Invariant cache hit.
[2024-06-02 22:47:16] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-06-02 22:47:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 22:47:18] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:47:19] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:47:19] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:47:19] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:47:19] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:47:19] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:47:19] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:47:19] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
[2024-06-02 22:47:20] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
[2024-06-02 22:47:20] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 268/445 variables, 177/191 constraints. Problems are: Problem set: 15 solved, 252 unsolved
[2024-06-02 22:47:22] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:47:22] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 2/193 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/193 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/193 constraints. Problems are: Problem set: 15 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 193 constraints, problems are : Problem set: 15 solved, 252 unsolved in 11242 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 15 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 268/445 variables, 177/193 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 252/445 constraints. Problems are: Problem set: 15 solved, 252 unsolved
[2024-06-02 22:47:31] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:47:32] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 2/447 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/447 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/447 constraints. Problems are: Problem set: 15 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 447 constraints, problems are : Problem set: 15 solved, 252 unsolved in 15187 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 252/267 constraints, Known Traps: 14/14 constraints]
After SMT, in 26489ms problems are : Problem set: 15 solved, 252 unsolved
Search for dead transitions found 15 dead transitions in 26492ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 177/230 places, 253/336 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26720 ms. Remains : 177/230 places, 253/336 transitions.
[2024-06-02 22:47:43] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:47:43] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:47:43] [INFO ] Input system was already deterministic with 253 transitions.
[2024-06-02 22:47:43] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:47:43] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:47:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality9963445996117478407.gal : 2 ms
[2024-06-02 22:47:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality18002897243126782578.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/CTLCardinality9963445996117478407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18002897243126782578.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7174e+06,0.205352,12104,2,2189,5,23161,6,0,962,32897,0


Converting to forward existential form...Done !
original formula: EF(((EX(EX((p16==0))) * !(E(E((p134==1) U ((p142==0)||(p232==1))) U !((((p215==0)||(p144==1))||(p199==1)))))) * EG((p225==0))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (EX(EX((p16==0))) * !(E(E((p134==1) U ((p142==0)||(p232==1))) U !((((p215==0)||(p144==1...195
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t31, t32, t37, t42, t51, t64, t68, t81, t86, t90, t94, t96, t112, t120, t...314
Hit Full ! (commute/partial/dont) 250/0/3
(forward)formula 0,1,22.9699,743224,1,0,1458,4.79102e+06,541,930,6445,4.79953e+06,1399
FORMULA FireWire-PT-16-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 192 transition count 289
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 192 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 192 transition count 288
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 92 place count 177 transition count 269
Iterating global reduction 1 with 15 rules applied. Total rules applied 107 place count 177 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 177 transition count 268
Applied a total of 108 rules in 4 ms. Remains 177 /230 variables (removed 53) and now considering 268/336 (removed 68) transitions.
// Phase 1: matrix 268 rows 177 cols
[2024-06-02 22:48:06] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:48:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:48:06] [INFO ] Invariant cache hit.
[2024-06-02 22:48:06] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-06-02 22:48:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 73 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:48:08] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
[2024-06-02 22:48:09] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
Problem TDEAD250 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 268/445 variables, 177/190 constraints. Problems are: Problem set: 15 solved, 252 unsolved
[2024-06-02 22:48:12] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 1/191 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/191 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/191 constraints. Problems are: Problem set: 15 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 191 constraints, problems are : Problem set: 15 solved, 252 unsolved in 11048 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 15 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 268/445 variables, 177/191 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 252/443 constraints. Problems are: Problem set: 15 solved, 252 unsolved
[2024-06-02 22:48:21] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 1/444 constraints. Problems are: Problem set: 15 solved, 252 unsolved
[2024-06-02 22:48:25] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 1/445 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/445 constraints. Problems are: Problem set: 15 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/445 variables, 0/445 constraints. Problems are: Problem set: 15 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 445 constraints, problems are : Problem set: 15 solved, 252 unsolved in 18016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 252/267 constraints, Known Traps: 12/12 constraints]
After SMT, in 29108ms problems are : Problem set: 15 solved, 252 unsolved
Search for dead transitions found 15 dead transitions in 29111ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 177/230 places, 253/336 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29296 ms. Remains : 177/230 places, 253/336 transitions.
[2024-06-02 22:48:36] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:48:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:48:36] [INFO ] Input system was already deterministic with 253 transitions.
[2024-06-02 22:48:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:48:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:48:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality4102893140354667117.gal : 2 ms
[2024-06-02 22:48:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality9960544933416263326.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/CTLCardinality4102893140354667117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9960544933416263326.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.57343e+06,0.199727,11580,2,2076,5,22272,6,0,962,30354,0


Converting to forward existential form...Done !
original formula: (!(A((p241==1) U (!((((p206==0)||(p101==1))&&(p188==1))) + !(AF(((p167==0)||(p108==1))))))) + A(AX(EF((((p233==0)||(p11==1))&&((p250==0)|...189
=> equivalent forward existential formula: (([(((FwdU(Init,!((!((((p206==0)||(p101==1))&&(p188==1))) + !(!(EG(!(((p167==0)||(p108==1))))))))) * !((p241==1)...547
Reverse transition relation is NOT exact ! Due to transitions t21, t24, t25, t29, t31, t37, t42, t47, t55, t68, t71, t84, t89, t93, t97, t99, t115, t123, t...302
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,13.6612,450800,1,0,943,2.93012e+06,558,481,6665,2.86696e+06,1148
FORMULA FireWire-PT-16-CTLCardinality-2024-08 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 : 230/230 places, 336/336 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 194 transition count 291
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 194 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 194 transition count 290
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 86 place count 181 transition count 274
Iterating global reduction 1 with 13 rules applied. Total rules applied 99 place count 181 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 181 transition count 273
Applied a total of 100 rules in 11 ms. Remains 181 /230 variables (removed 49) and now considering 273/336 (removed 63) transitions.
// Phase 1: matrix 273 rows 181 cols
[2024-06-02 22:48:49] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:48:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:48:49] [INFO ] Invariant cache hit.
[2024-06-02 22:48:50] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-02 22:48:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-02 22:48:52] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:48:52] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:48:52] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:48:52] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-06-02 22:48:52] [INFO ] Deduced a trap composed of 89 places in 48 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
[2024-06-02 22:48:52] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 2 ms to minimize.
Problem TDEAD255 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 257 unsolved
[2024-06-02 22:48:53] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:48:53] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:48:53] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/13 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 273/454 variables, 181/194 constraints. Problems are: Problem set: 15 solved, 257 unsolved
[2024-06-02 22:48:56] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:48:57] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 2/196 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/196 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 0/454 variables, 0/196 constraints. Problems are: Problem set: 15 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 196 constraints, problems are : Problem set: 15 solved, 257 unsolved in 12951 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 15 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 273/454 variables, 181/196 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 257/453 constraints. Problems are: Problem set: 15 solved, 257 unsolved
[2024-06-02 22:49:05] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 1/454 constraints. Problems are: Problem set: 15 solved, 257 unsolved
[2024-06-02 22:49:10] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/455 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/455 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/454 variables, 0/455 constraints. Problems are: Problem set: 15 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 455 constraints, problems are : Problem set: 15 solved, 257 unsolved in 17762 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 257/272 constraints, Known Traps: 13/13 constraints]
After SMT, in 30757ms problems are : Problem set: 15 solved, 257 unsolved
Search for dead transitions found 15 dead transitions in 30759ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 181/230 places, 258/336 transitions.
Applied a total of 0 rules in 6 ms. Remains 181 /181 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31004 ms. Remains : 181/230 places, 258/336 transitions.
[2024-06-02 22:49:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:49:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:49:20] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 22:49:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:49:20] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:49:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality18038550357806100473.gal : 2 ms
[2024-06-02 22:49:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality5675702335369381385.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/CTLCardinality18038550357806100473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5675702335369381385.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66914e+06,0.20211,11664,2,2362,5,23307,6,0,983,35113,0


Converting to forward existential form...Done !
original formula: EF(EX((((p150!=0)&&(p240!=1))||((p60!=0)&&(p158!=1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (((p150!=0)&&(p240!=1))||((p60!=0)&&(p158!=1))))] != FALSE
(forward)formula 0,1,0.239579,11928,1,0,8,23307,8,1,1658,35113,2
FORMULA FireWire-PT-16-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 196 transition count 293
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 196 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 196 transition count 292
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 81 place count 184 transition count 277
Iterating global reduction 1 with 12 rules applied. Total rules applied 93 place count 184 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 184 transition count 276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 183 transition count 275
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 183 transition count 275
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 182 transition count 274
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 182 transition count 274
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 181 transition count 273
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 181 transition count 273
Applied a total of 100 rules in 13 ms. Remains 181 /230 variables (removed 49) and now considering 273/336 (removed 63) transitions.
// Phase 1: matrix 273 rows 181 cols
[2024-06-02 22:49:21] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:49:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:49:21] [INFO ] Invariant cache hit.
[2024-06-02 22:49:21] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-06-02 22:49:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-06-02 22:49:22] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:49:23] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:49:24] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
[2024-06-02 22:49:24] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:49:24] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
Problem TDEAD254 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 14/18 constraints. Problems are: Problem set: 16 solved, 256 unsolved
[2024-06-02 22:49:24] [INFO ] Deduced a trap composed of 91 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:49:24] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 88 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:49:25] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 8/26 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/26 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 273/454 variables, 181/207 constraints. Problems are: Problem set: 16 solved, 256 unsolved
[2024-06-02 22:49:28] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:49:28] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 2/209 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/209 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/454 variables, 0/209 constraints. Problems are: Problem set: 16 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 209 constraints, problems are : Problem set: 16 solved, 256 unsolved in 13879 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 16 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 24/28 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/28 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 273/454 variables, 181/209 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 256/465 constraints. Problems are: Problem set: 16 solved, 256 unsolved
[2024-06-02 22:49:38] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 1/466 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/466 constraints. Problems are: Problem set: 16 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/454 variables, 0/466 constraints. Problems are: Problem set: 16 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 466 constraints, problems are : Problem set: 16 solved, 256 unsolved in 16025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 256/272 constraints, Known Traps: 25/25 constraints]
After SMT, in 29945ms problems are : Problem set: 16 solved, 256 unsolved
Search for dead transitions found 16 dead transitions in 29948ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 181/230 places, 257/336 transitions.
Applied a total of 0 rules in 1 ms. Remains 181 /181 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30156 ms. Remains : 181/230 places, 257/336 transitions.
[2024-06-02 22:49:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:49:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:49:51] [INFO ] Input system was already deterministic with 257 transitions.
[2024-06-02 22:49:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:49:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:49:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality18345031116970963815.gal : 1 ms
[2024-06-02 22:49:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2966269290689833850.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/CTLCardinality18345031116970963815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2966269290689833850.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.80745e+06,0.223678,12720,2,2636,5,24631,6,0,982,36300,0


Converting to forward existential form...Done !
original formula: (EG(EF((p144==1))) * A(AF((AX(AX(((p27==0)||(p219==1)))) * (EG(((p92==0)||(p203==1))) + AF((p32==1))))) U ((EG(!(AX(((p51==0)||(p216==1))...220
=> equivalent forward existential formula: [(((Init * EG(E(TRUE U (p144==1)))) * !(EG(!(((EG(!(!(EX(!(((p51==0)||(p216==1))))))) + ((p237==1) * EG(!(EX(!((...551
Reverse transition relation is NOT exact ! Due to transitions t18, t21, t22, t26, t28, t34, t40, t44, t45, t50, t54, t67, t70, t83, t88, t93, t97, t99, t11...318
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 22:50:21] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:50:21] [INFO ] Applying decomposition
[2024-06-02 22:50:21] [INFO ] Flatten gal took : 5 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/graph5806891747672284895.txt' '-o' '/tmp/graph5806891747672284895.bin' '-w' '/tmp/graph5806891747672284895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5806891747672284895.bin' '-l' '-1' '-v' '-w' '/tmp/graph5806891747672284895.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:50:21] [INFO ] Decomposing Gal with order
[2024-06-02 22:50:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:50:21] [INFO ] Removed a total of 162 redundant transitions.
[2024-06-02 22:50:21] [INFO ] Flatten gal took : 46 ms
[2024-06-02 22:50:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 12 ms.
[2024-06-02 22:50:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16915171212765161589.gal : 4 ms
[2024-06-02 22:50:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6499856705559498957.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/CTLCardinality16915171212765161589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6499856705559498957.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.80745e+06,0.172858,10592,394,216,7114,7912,603,13115,159,35516,0


Converting to forward existential form...Done !
original formula: (EG(EF((i7.i1.u38.p144==1))) * A(AF((AX(AX(((i0.u3.p27==0)||(i9.i0.u49.p219==1)))) * (EG(((i4.u21.p92==0)||(i8.i1.u46.p203==1))) + AF((i1...324
=> equivalent forward existential formula: [(((Init * EG(E(TRUE U (i7.i1.u38.p144==1)))) * !(EG(!(((EG(!(!(EX(!(((i2.u9.p51==0)||(i9.i0.u48.p216==1))))))) ...759
Reverse transition relation is NOT exact ! Due to transitions t54, t117, t144, t157, t246, t250, t253, i0.u3.t131, i0.u22.t88, i1.t129, i1.i0.u29.t97, i2.u...465
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
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
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,4.0818,144440,1,0,216552,26547,3788,443633,995,63576,390957
FORMULA FireWire-PT-16-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Graph (trivial) has 179 edges and 230 vertex of which 14 / 230 are part of one of the 2 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 217 transition count 269
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 164 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 163 transition count 268
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 109 place count 163 transition count 260
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 125 place count 155 transition count 260
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 142 place count 138 transition count 234
Iterating global reduction 3 with 17 rules applied. Total rules applied 159 place count 138 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 163 place count 138 transition count 230
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 165 place count 137 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 136 transition count 229
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 166 place count 136 transition count 225
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 174 place count 132 transition count 225
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 178 place count 128 transition count 209
Iterating global reduction 6 with 4 rules applied. Total rules applied 182 place count 128 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 128 transition count 208
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 209 place count 115 transition count 195
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 210 place count 114 transition count 193
Iterating global reduction 7 with 1 rules applied. Total rules applied 211 place count 114 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 213 place count 113 transition count 192
Applied a total of 213 rules in 23 ms. Remains 113 /230 variables (removed 117) and now considering 192/336 (removed 144) transitions.
[2024-06-02 22:50:25] [INFO ] Flow matrix only has 190 transitions (discarded 2 similar events)
// Phase 1: matrix 190 rows 113 cols
[2024-06-02 22:50:25] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:50:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 22:50:25] [INFO ] Flow matrix only has 190 transitions (discarded 2 similar events)
[2024-06-02 22:50:25] [INFO ] Invariant cache hit.
[2024-06-02 22:50:25] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-02 22:50:25] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-06-02 22:50:25] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-06-02 22:50:25] [INFO ] Flow matrix only has 190 transitions (discarded 2 similar events)
[2024-06-02 22:50:25] [INFO ] Invariant cache hit.
[2024-06-02 22:50:25] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-06-02 22:50:26] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:50:26] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:50:26] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:50:26] [INFO ] Deduced a trap composed of 69 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 62 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 61 places in 35 ms of which 2 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 63 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 59 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:50:27] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 189/302 variables, 113/134 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 11/145 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/145 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/145 constraints. Problems are: Problem set: 15 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/303 variables, and 145 constraints, problems are : Problem set: 15 solved, 175 unsolved in 5349 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 113/113 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 15 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 12/13 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 3/16 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 5/21 constraints. Problems are: Problem set: 15 solved, 175 unsolved
[2024-06-02 22:50:31] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/22 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 189/302 variables, 113/135 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 11/146 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 175/321 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/321 constraints. Problems are: Problem set: 15 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/321 constraints. Problems are: Problem set: 15 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/303 variables, and 321 constraints, problems are : Problem set: 15 solved, 175 unsolved in 5959 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 113/113 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 175/190 constraints, Known Traps: 18/18 constraints]
After SMT, in 11347ms problems are : Problem set: 15 solved, 175 unsolved
Search for dead transitions found 15 dead transitions in 11348ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 113/230 places, 177/336 transitions.
Applied a total of 0 rules in 8 ms. Remains 113 /113 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-06-02 22:50:37] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 11542 ms. Remains : 113/230 places, 177/336 transitions.
[2024-06-02 22:50:37] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:50:37] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:50:37] [INFO ] Input system was already deterministic with 177 transitions.
[2024-06-02 22:50:37] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:50:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:50:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality13382054400579740242.gal : 2 ms
[2024-06-02 22:50:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality10304362087787213616.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/CTLCardinality13382054400579740242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10304362087787213616.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,130892,0.092577,7204,2,1239,5,10308,6,0,628,14425,0


Converting to forward existential form...Done !
original formula: AG((((AF((p83==0)) * AF((p19==0))) + (((p196==0)&&(p121==1))&&((p137==0)||(p236==1)))) + (((p36==0)||(p155==1))&&((p193==0)||(p39==1)))))
=> equivalent forward existential formula: ([FwdG(((FwdU(Init,TRUE) * !((((p36==0)||(p155==1))&&((p193==0)||(p39==1))))) * !((((p196==0)&&(p121==1))&&((p13...354
(forward)formula 0,1,0.277304,14068,1,0,14,47946,30,7,3112,23440,8
FORMULA FireWire-PT-16-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 192 transition count 289
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 192 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 192 transition count 288
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 92 place count 177 transition count 271
Iterating global reduction 1 with 15 rules applied. Total rules applied 107 place count 177 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 177 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 176 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 176 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 175 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 175 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 174 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 174 transition count 267
Applied a total of 114 rules in 11 ms. Remains 174 /230 variables (removed 56) and now considering 267/336 (removed 69) transitions.
// Phase 1: matrix 267 rows 174 cols
[2024-06-02 22:50:37] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:50:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:50:37] [INFO ] Invariant cache hit.
[2024-06-02 22:50:37] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 22:50:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 92 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 2 ms to minimize.
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-02 22:50:40] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 2 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
[2024-06-02 22:50:40] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 7/11 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:50:40] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:50:40] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:50:40] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/14 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/14 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 267/441 variables, 174/188 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:50:43] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:50:44] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 2/190 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/190 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:50:48] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/441 variables, 1/191 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/191 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 10 (OVERLAPS) 0/441 variables, 0/191 constraints. Problems are: Problem set: 18 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 191 constraints, problems are : Problem set: 18 solved, 248 unsolved in 16380 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 18 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 13/17 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:50:55] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 2 ms to minimize.
[2024-06-02 22:50:55] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:50:55] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/20 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 267/441 variables, 174/194 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 248/442 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/442 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:51:02] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/441 variables, 1/443 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/443 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:51:09] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/441 variables, 1/444 constraints. Problems are: Problem set: 18 solved, 248 unsolved
[2024-06-02 22:51:14] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/445 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/445 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/441 variables, 0/445 constraints. Problems are: Problem set: 18 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 445 constraints, problems are : Problem set: 18 solved, 248 unsolved in 29193 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 248/266 constraints, Known Traps: 19/19 constraints]
After SMT, in 45618ms problems are : Problem set: 18 solved, 248 unsolved
Search for dead transitions found 18 dead transitions in 45621ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/230 places, 249/336 transitions.
Applied a total of 0 rules in 2 ms. Remains 174 /174 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45822 ms. Remains : 174/230 places, 249/336 transitions.
[2024-06-02 22:51:23] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:51:23] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:51:23] [INFO ] Input system was already deterministic with 249 transitions.
[2024-06-02 22:51:23] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:51:23] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:51:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality16756446466063760569.gal : 2 ms
[2024-06-02 22:51:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9293202465912931485.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/CTLCardinality16756446466063760569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9293202465912931485.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64772e+06,0.205938,11588,2,2420,5,22086,6,0,946,31327,0


Converting to forward existential form...Done !
original formula: (AG((p98==0)) + AX(AX(((!(A((p103==1) U ((p203==0)||(p215==1)))) * (p50==0)) * (p149==1)))))
=> equivalent forward existential formula: (([((EY(EY((Init * !(!(E(TRUE U !((p98==0)))))))) * !(EG(!(((p203==0)||(p215==1)))))) * !(E(!(((p203==0)||(p215=...366
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t38, t42, t43, t51, t64, t67, t80, t89, t93, t95, t111, t119, t124, ...297
(forward)formula 0,0,4.94897,165696,1,0,465,1.00482e+06,521,264,6136,646905,608
FORMULA FireWire-PT-16-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Graph (trivial) has 186 edges and 230 vertex of which 9 / 230 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 222 transition count 266
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 160 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 159 transition count 265
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 127 place count 159 transition count 259
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 139 place count 153 transition count 259
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 154 place count 138 transition count 235
Iterating global reduction 3 with 15 rules applied. Total rules applied 169 place count 138 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 138 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 137 transition count 233
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 172 place count 137 transition count 228
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 182 place count 132 transition count 228
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 187 place count 127 transition count 211
Iterating global reduction 5 with 5 rules applied. Total rules applied 192 place count 127 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 193 place count 127 transition count 210
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 6 with 28 rules applied. Total rules applied 221 place count 113 transition count 196
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 222 place count 112 transition count 194
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 112 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 225 place count 111 transition count 193
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 111 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 110 transition count 192
Applied a total of 227 rules in 22 ms. Remains 110 /230 variables (removed 120) and now considering 192/336 (removed 144) transitions.
[2024-06-02 22:51:28] [INFO ] Flow matrix only has 191 transitions (discarded 1 similar events)
// Phase 1: matrix 191 rows 110 cols
[2024-06-02 22:51:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:51:28] [INFO ] Flow matrix only has 191 transitions (discarded 1 similar events)
[2024-06-02 22:51:28] [INFO ] Invariant cache hit.
[2024-06-02 22:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:28] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-06-02 22:51:28] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2024-06-02 22:51:28] [INFO ] Flow matrix only has 191 transitions (discarded 1 similar events)
[2024-06-02 22:51:28] [INFO ] Invariant cache hit.
[2024-06-02 22:51:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 55 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 171 unsolved
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 190/299 variables, 109/122 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 1/123 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/123 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/300 variables, 1/124 constraints. Problems are: Problem set: 15 solved, 171 unsolved
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 0 ms to minimize.
[2024-06-02 22:51:32] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 2/126 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/126 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/126 constraints. Problems are: Problem set: 15 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/301 variables, and 126 constraints, problems are : Problem set: 15 solved, 171 unsolved in 6831 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 15 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 190/299 variables, 109/124 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 1/125 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 171/296 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/296 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/300 variables, 1/297 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/297 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/297 constraints. Problems are: Problem set: 15 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/301 variables, and 297 constraints, problems are : Problem set: 15 solved, 171 unsolved in 6905 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/186 constraints, Known Traps: 11/11 constraints]
After SMT, in 13775ms problems are : Problem set: 15 solved, 171 unsolved
Search for dead transitions found 15 dead transitions in 13777ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 110/230 places, 177/336 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-06-02 22:51:42] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 14043 ms. Remains : 110/230 places, 177/336 transitions.
[2024-06-02 22:51:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:51:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:51:42] [INFO ] Input system was already deterministic with 177 transitions.
[2024-06-02 22:51:42] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:51:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:51:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality11541160385381737537.gal : 2 ms
[2024-06-02 22:51:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality10711919620194117323.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/CTLCardinality11541160385381737537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10711919620194117323.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,142005,0.118462,8532,2,1078,5,14468,6,0,616,18837,0


Converting to forward existential form...Done !
original formula: (AF((p222==1)) + AG(!(E(((EF(((p41==0)||(p143==1))) * AG((p245==1))) * AG(((p65==0)||(p134==1)))) U EG(AG((p217==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU((Init * !(!(EG(!((p222==1)))))),TRUE),((E(TRUE U ((p41==0)||(p143==1))) * !(E(TRUE U !((p245==1)...237
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t11, t19, t26, t31, t41, t43, t58, t59, t98, t99, t101, t108, t111, t113, t117, t153,...292
(forward)formula 0,1,3.28469,125316,1,0,514,742818,395,257,4527,660506,616
FORMULA FireWire-PT-16-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 193 transition count 290
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 193 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 193 transition count 289
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 90 place count 178 transition count 271
Iterating global reduction 1 with 15 rules applied. Total rules applied 105 place count 178 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 106 place count 178 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 177 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 177 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 176 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 176 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 175 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 175 transition count 267
Applied a total of 112 rules in 11 ms. Remains 175 /230 variables (removed 55) and now considering 267/336 (removed 69) transitions.
// Phase 1: matrix 267 rows 175 cols
[2024-06-02 22:51:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:51:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:51:45] [INFO ] Invariant cache hit.
[2024-06-02 22:51:45] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 22:51:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2024-06-02 22:51:48] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:51:48] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
[2024-06-02 22:51:48] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:51:48] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 267/442 variables, 175/187 constraints. Problems are: Problem set: 15 solved, 251 unsolved
[2024-06-02 22:51:51] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 1/188 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/442 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 188 constraints, problems are : Problem set: 15 solved, 251 unsolved in 11143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 15 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 251 unsolved
[2024-06-02 22:51:58] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 267/442 variables, 175/189 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 251/440 constraints. Problems are: Problem set: 15 solved, 251 unsolved
[2024-06-02 22:52:00] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:52:01] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:52:01] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:52:01] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 4/444 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/444 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/444 constraints. Problems are: Problem set: 15 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 444 constraints, problems are : Problem set: 15 solved, 251 unsolved in 15575 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 251/266 constraints, Known Traps: 14/14 constraints]
After SMT, in 26762ms problems are : Problem set: 15 solved, 251 unsolved
Search for dead transitions found 15 dead transitions in 26764ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/230 places, 252/336 transitions.
Applied a total of 0 rules in 2 ms. Remains 175 /175 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26947 ms. Remains : 175/230 places, 252/336 transitions.
[2024-06-02 22:52:12] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:52:12] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:52:12] [INFO ] Input system was already deterministic with 252 transitions.
[2024-06-02 22:52:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:52:12] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:52:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8973766390481196611.gal : 1 ms
[2024-06-02 22:52:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7421314495330999226.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/CTLCardinality8973766390481196611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7421314495330999226.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.59867e+06,0.186094,11336,2,2127,5,21514,6,0,953,29521,0


Converting to forward existential form...Done !
original formula: E(AX(FALSE) U E(EF(AG((p44==0))) U (AG(!(AG((p215==1)))) * ((p161==0)||(p187==1)))))
=> equivalent forward existential formula: [((FwdU(FwdU(Init,!(EX(!(FALSE)))),E(TRUE U !(E(TRUE U !((p44==0)))))) * ((p161==0)||(p187==1))) * !(E(TRUE U !(...197
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t36, t37, t42, t50, t52, t53, t66, t69, t82, t87, t91, t95, t97, t11...312
(forward)formula 0,1,9.18663,288744,1,0,583,1.80324e+06,533,321,6434,1.23617e+06,737
FORMULA FireWire-PT-16-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 336/336 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 197 transition count 303
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 197 transition count 303
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 185 transition count 287
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 185 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 184 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 184 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 183 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 183 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 182 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 182 transition count 284
Applied a total of 96 rules in 11 ms. Remains 182 /230 variables (removed 48) and now considering 284/336 (removed 52) transitions.
// Phase 1: matrix 284 rows 182 cols
[2024-06-02 22:52:22] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:52:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:52:22] [INFO ] Invariant cache hit.
[2024-06-02 22:52:22] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-02 22:52:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:52:24] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:52:24] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:52:24] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:52:24] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-06-02 22:52:25] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 1 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 268 unsolved
[2024-06-02 22:52:25] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:52:25] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:52:25] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 3/12 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 284/466 variables, 182/194 constraints. Problems are: Problem set: 15 solved, 268 unsolved
[2024-06-02 22:52:28] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 1/195 constraints. Problems are: Problem set: 15 solved, 268 unsolved
[2024-06-02 22:52:32] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:52:32] [INFO ] Deduced a trap composed of 105 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 2/197 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/197 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/466 variables, 0/197 constraints. Problems are: Problem set: 15 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 197 constraints, problems are : Problem set: 15 solved, 268 unsolved in 16591 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 15 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 284/466 variables, 182/197 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 268/465 constraints. Problems are: Problem set: 15 solved, 268 unsolved
[2024-06-02 22:52:41] [INFO ] Deduced a trap composed of 74 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:52:42] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:52:42] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 3/468 constraints. Problems are: Problem set: 15 solved, 268 unsolved
[2024-06-02 22:52:45] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/469 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/469 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/466 variables, 0/469 constraints. Problems are: Problem set: 15 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 469 constraints, problems are : Problem set: 15 solved, 268 unsolved in 21335 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 268/283 constraints, Known Traps: 15/15 constraints]
After SMT, in 37978ms problems are : Problem set: 15 solved, 268 unsolved
Search for dead transitions found 15 dead transitions in 37982ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 182/230 places, 269/336 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 269/269 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38185 ms. Remains : 182/230 places, 269/336 transitions.
[2024-06-02 22:53:00] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:53:00] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:53:00] [INFO ] Input system was already deterministic with 269 transitions.
[2024-06-02 22:53:00] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:53:00] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:53:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality2548922620015482854.gal : 2 ms
[2024-06-02 22:53:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality3639684239501160601.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/CTLCardinality2548922620015482854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3639684239501160601.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.87003e+06,0.225162,13064,2,2314,5,25324,6,0,998,35997,0


Converting to forward existential form...Done !
original formula: (AG((((p187==0) * !(A((((p132==0)||(p91==1))&&(p40==1)) U (((p151==0)||(p182==1))&&(p229==1))))) + EF(AX((p121==1))))) + AG(((A(AX((p160=...268
=> equivalent forward existential formula: ([(((FwdU((Init * !(!(E(TRUE U !((((p187==0) * !(!((E(!((((p151==0)||(p182==1))&&(p229==1))) U (!((((p132==0)||(...1026
Reverse transition relation is NOT exact ! Due to transitions t18, t21, t22, t26, t28, t30, t35, t40, t45, t48, t51, t55, t68, t71, t84, t90, t94, t98, t10...318
Detected timeout of ITS tools.
[2024-06-02 22:53:30] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:53:30] [INFO ] Applying decomposition
[2024-06-02 22:53:30] [INFO ] Flatten gal took : 5 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/graph7204310898939795370.txt' '-o' '/tmp/graph7204310898939795370.bin' '-w' '/tmp/graph7204310898939795370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7204310898939795370.bin' '-l' '-1' '-v' '-w' '/tmp/graph7204310898939795370.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:53:30] [INFO ] Decomposing Gal with order
[2024-06-02 22:53:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:53:30] [INFO ] Removed a total of 198 redundant transitions.
[2024-06-02 22:53:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:53:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 4 ms.
[2024-06-02 22:53:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality5363963727957218897.gal : 2 ms
[2024-06-02 22:53:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality4773272001333395250.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/CTLCardinality5363963727957218897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4773272001333395250.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 -...262
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.87003e+06,0.119774,8744,495,147,8013,1645,579,16864,148,6267,0


Converting to forward existential form...Done !
original formula: (AG((((i7.u42.p187==0) * !(A((((i0.u31.p132==0)||(i5.u24.p91==1))&&(i4.u11.p40==1)) U (((i6.u36.p151==0)||(i5.u17.p182==1))&&(i10.i0.i0.u...400
=> equivalent forward existential formula: ([(((FwdU((Init * !(!(E(TRUE U !((((i7.u42.p187==0) * !(!((E(!((((i6.u36.p151==0)||(i5.u17.p182==1))&&(i10.i0.i0...1482
Reverse transition relation is NOT exact ! Due to transitions t45, t133, t134, t149, t159, t257, t265, i0.u31.t98, i1.u2.t147, i3.u12.t116, i4.t127, i4.t12...449
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,4.62573,170576,1,0,248112,5877,3941,835130,760,19148,407612
FORMULA FireWire-PT-16-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-06-02 22:53:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:53:35] [INFO ] Flatten gal took : 7 ms
Total runtime 617776 ms.

BK_STOP 1717368815122

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="FireWire-PT-16"
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 FireWire-PT-16, 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 r550-tall-171734899000289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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