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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.1K 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 100K 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-09-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-09-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717361640252

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 20:54:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:54:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:54:01] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 20:54:01] [INFO ] Transformed 130 places.
[2024-06-02 20:54:01] [INFO ] Transformed 408 transitions.
[2024-06-02 20:54:01] [INFO ] Found NUPN structural information;
[2024-06-02 20:54:01] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-09-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 352/352 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 128 transition count 348
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 128 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 128 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 128 transition count 341
Applied a total of 11 rules in 32 ms. Remains 128 /130 variables (removed 2) and now considering 341/352 (removed 11) transitions.
[2024-06-02 20:54:01] [INFO ] Flow matrix only has 315 transitions (discarded 26 similar events)
// Phase 1: matrix 315 rows 128 cols
[2024-06-02 20:54:01] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 20:54:01] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-02 20:54:01] [INFO ] Flow matrix only has 315 transitions (discarded 26 similar events)
[2024-06-02 20:54:01] [INFO ] Invariant cache hit.
[2024-06-02 20:54:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:54:02] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 421 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 127/130 places, 341/352 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 471 ms. Remains : 127/130 places, 341/352 transitions.
Support contains 83 out of 127 places after structural reductions.
[2024-06-02 20:54:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 20:54:02] [INFO ] Flatten gal took : 58 ms
FORMULA FireWire-PT-09-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:54:02] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:54:02] [INFO ] Input system was already deterministic with 341 transitions.
Support contains 74 out of 127 places (down from 83) after GAL structural reductions.
RANDOM walk for 40000 steps (2282 resets) in 2176 ms. (18 steps per ms) remains 23/50 properties
BEST_FIRST walk for 4003 steps (61 resets) in 57 ms. (69 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (69 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (52 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (61 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (70 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (64 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (61 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (115 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (67 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (48 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (60 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (55 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (52 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (70 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (69 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (43 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (63 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (68 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (69 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (63 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (70 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (57 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (43 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
[2024-06-02 20:54:03] [INFO ] Flow matrix only has 315 transitions (discarded 26 similar events)
// Phase 1: matrix 315 rows 127 cols
[2024-06-02 20:54:03] [INFO ] Computed 7 invariants in 11 ms
[2024-06-02 20:54:03] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 84/125 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 314/439 variables, 125/132 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 44/176 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 2/441 variables, 2/178 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/178 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/442 variables, 1/179 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/442 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 179 constraints, problems are : Problem set: 2 solved, 21 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 89/125 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 11 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 2 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:54:04] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:54:05] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:54:05] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 7/14 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 314/439 variables, 125/139 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 44/183 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 18/201 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-06-02 20:54:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:54:05] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 2/203 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 2/441 variables, 2/205 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 3/208 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-06-02 20:54:06] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/209 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 1/442 variables, 1/210 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 0/442 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 210 constraints, problems are : Problem set: 2 solved, 21 unsolved in 4286 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 21/23 constraints, Known Traps: 10/10 constraints]
After SMT, in 5269ms problems are : Problem set: 2 solved, 21 unsolved
Parikh walk visited 0 properties in 1088 ms.
Support contains 36 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 341/341 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 126 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 126 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 126 transition count 335
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 123 transition count 341
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 123 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 123 transition count 332
Applied a total of 21 rules in 70 ms. Remains 123 /127 variables (removed 4) and now considering 332/341 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 123/127 places, 332/341 transitions.
RANDOM walk for 40000 steps (2272 resets) in 643 ms. (62 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (48 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (52 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (51 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (44 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (106 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (69 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (62 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (68 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (61 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (60 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (52 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (57 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (69 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (34 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (59 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (48 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
[2024-06-02 20:54:10] [INFO ] Flow matrix only has 304 transitions (discarded 28 similar events)
// Phase 1: matrix 304 rows 123 cols
[2024-06-02 20:54:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:54:10] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 86/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 304/425 variables, 121/128 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/427 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/427 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 176 constraints, problems are : Problem set: 0 solved, 19 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 86/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:54:10] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 4 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 0 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 304/425 variables, 121/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 46/184 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 17/201 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:54:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:54:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 20:54:12] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/427 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/427 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 208 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2926 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 13/13 constraints]
After SMT, in 3535ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 3 properties in 1887 ms.
Support contains 27 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 332/332 transitions.
Applied a total of 0 rules in 12 ms. Remains 123 /123 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 123/123 places, 332/332 transitions.
RANDOM walk for 40000 steps (2182 resets) in 269 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (51 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (47 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (68 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (57 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (52 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (68 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (66 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (62 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (52 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (50 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (68 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (58 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 611295 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :8 out of 16
Probabilistic random walk after 611295 steps, saw 129316 distinct states, run finished after 3004 ms. (steps per millisecond=203 ) properties seen :8
[2024-06-02 20:54:18] [INFO ] Flow matrix only has 304 transitions (discarded 28 similar events)
[2024-06-02 20:54:18] [INFO ] Invariant cache hit.
[2024-06-02 20:54:18] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 104/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 304/425 variables, 121/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/427 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/427 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 176 constraints, problems are : Problem set: 0 solved, 8 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 104/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:54:19] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:54:19] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 304/425 variables, 121/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 46/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2/427 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:54:19] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:54:19] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/427 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 188 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 1350ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1583 ms.
Support contains 17 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 332/332 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 330
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 122 transition count 329
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 122 transition count 331
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 121 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 121 transition count 327
Applied a total of 9 rules in 39 ms. Remains 121 /123 variables (removed 2) and now considering 327/332 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 121/123 places, 327/332 transitions.
RANDOM walk for 40000 steps (2178 resets) in 220 ms. (180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (583 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (582 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (595 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (581 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (542 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (571 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (537 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (529 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 632061 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 8
Probabilistic random walk after 632061 steps, saw 136771 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2024-06-02 20:54:25] [INFO ] Flow matrix only has 298 transitions (discarded 29 similar events)
// Phase 1: matrix 298 rows 121 cols
[2024-06-02 20:54:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:54:25] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 102/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 298/417 variables, 119/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/419 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 174 constraints, problems are : Problem set: 0 solved, 8 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 102/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:54:25] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:54:25] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 298/417 variables, 119/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 46/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:54:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
[2024-06-02 20:54:25] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:54:25] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/419 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:54:26] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:54:26] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/419 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 189 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 7/7 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2510 ms.
Support contains 17 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 327/327 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 121/121 places, 327/327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 327/327 transitions.
Applied a total of 0 rules in 15 ms. Remains 121 /121 variables (removed 0) and now considering 327/327 (removed 0) transitions.
[2024-06-02 20:54:29] [INFO ] Flow matrix only has 298 transitions (discarded 29 similar events)
[2024-06-02 20:54:29] [INFO ] Invariant cache hit.
[2024-06-02 20:54:29] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 20:54:29] [INFO ] Flow matrix only has 298 transitions (discarded 29 similar events)
[2024-06-02 20:54:29] [INFO ] Invariant cache hit.
[2024-06-02 20:54:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 20:54:29] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 249 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/121 places, 327/327 transitions.
Applied a total of 0 rules in 9 ms. Remains 120 /120 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 273 ms. Remains : 120/121 places, 327/327 transitions.
RANDOM walk for 40000 steps (2202 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (530 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (560 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (602 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (568 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (586 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (611 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (586 resets) in 42 ms. (930 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (543 resets) in 41 ms. (952 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 593697 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 8
Probabilistic random walk after 593697 steps, saw 128220 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2024-06-02 20:54:32] [INFO ] Flow matrix only has 298 transitions (discarded 29 similar events)
// Phase 1: matrix 298 rows 120 cols
[2024-06-02 20:54:32] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:54:32] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 101/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 298/416 variables, 118/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 46/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/418 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 172 constraints, problems are : Problem set: 0 solved, 8 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 101/118 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:54:33] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 4 ms to minimize.
[2024-06-02 20:54:33] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 298/416 variables, 118/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 46/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:54:33] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2/418 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/418 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 183 constraints, problems are : Problem set: 0 solved, 8 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 1056ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 6 properties in 1348 ms.
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 327/327 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 119 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 119 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 118 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 118 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 117 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 117 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 116 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 116 transition count 317
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 115 transition count 316
Applied a total of 10 rules in 22 ms. Remains 115 /120 variables (removed 5) and now considering 316/327 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 115/120 places, 316/327 transitions.
RANDOM walk for 40000 steps (2210 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (546 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (585 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1075006 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 2
Probabilistic random walk after 1075006 steps, saw 236758 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
[2024-06-02 20:54:38] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
// Phase 1: matrix 287 rows 115 cols
[2024-06-02 20:54:38] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 20:54:38] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 105/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 287/400 variables, 113/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 44/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/402 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 105/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:54:38] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 287/400 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 44/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/402 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:54:38] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/402 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 169 constraints, problems are : Problem set: 0 solved, 2 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 182 ms.
Support contains 8 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 316/316 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 115/115 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 316/316 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2024-06-02 20:54:38] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
[2024-06-02 20:54:38] [INFO ] Invariant cache hit.
[2024-06-02 20:54:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 20:54:38] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
[2024-06-02 20:54:38] [INFO ] Invariant cache hit.
[2024-06-02 20:54:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 20:54:39] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 20:54:39] [INFO ] Redundant transitions in 18 ms returned []
Running 315 sub problems to find dead transitions.
[2024-06-02 20:54:39] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
[2024-06-02 20:54:39] [INFO ] Invariant cache hit.
[2024-06-02 20:54:39] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 20:54:40] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:54:40] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:54:41] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:54:41] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:54:41] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 20:54:42] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (OVERLAPS) 287/402 variables, 115/127 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 44/171 constraints. Problems are: Problem set: 0 solved, 315 unsolved
[2024-06-02 20:54:46] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 172 constraints, problems are : Problem set: 0 solved, 315 unsolved in 14345 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 287/402 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 44/172 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 315/487 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 487 constraints, problems are : Problem set: 0 solved, 315 unsolved in 17444 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints]
After SMT, in 32033ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 32037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32313 ms. Remains : 115/115 places, 316/316 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 102 edges and 115 vertex of which 22 / 115 are part of one of the 4 SCC in 3 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 105 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 96 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 18 place count 96 transition count 195
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 0 with 2 rules applied. Total rules applied 20 place count 96 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 94 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 94 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 93 transition count 192
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 2 with 2 rules applied. Total rules applied 26 place count 92 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 92 transition count 189
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 2 with 2 rules applied. Total rules applied 30 place count 91 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 90 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 90 transition count 157
Free-agglomeration rule applied 4 times with reduction of 2 identical transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 90 transition count 151
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 41 place count 86 transition count 150
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 46 place count 86 transition count 150
Applied a total of 46 rules in 40 ms. Remains 86 /115 variables (removed 29) and now considering 150/316 (removed 166) transitions.
Running SMT prover for 2 properties.
[2024-06-02 20:55:11] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 86 cols
[2024-06-02 20:55:11] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:55:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 20:55:11] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 20:55:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 20:55:11] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 20:55:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 20:55:11] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 20:55:11] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-06-02 20:55:11] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 20:55:11] [INFO ] After 168ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 259 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA FireWire-PT-09-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:55:11] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:55:11] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:55:11] [INFO ] Input system was already deterministic with 341 transitions.
Computed a total of 21 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 337
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 125 transition count 335
Applied a total of 6 rules in 4 ms. Remains 125 /127 variables (removed 2) and now considering 335/341 (removed 6) transitions.
[2024-06-02 20:55:11] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
// Phase 1: matrix 309 rows 125 cols
[2024-06-02 20:55:11] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:55:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:55:11] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2024-06-02 20:55:11] [INFO ] Invariant cache hit.
[2024-06-02 20:55:11] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:55:11] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2024-06-02 20:55:11] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2024-06-02 20:55:11] [INFO ] Invariant cache hit.
[2024-06-02 20:55:11] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-02 20:55:13] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:55:13] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:55:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-06-02 20:55:13] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:55:13] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:55:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 308/433 variables, 125/138 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 44/182 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (OVERLAPS) 0/434 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 183 constraints, problems are : Problem set: 0 solved, 334 unsolved in 13838 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 308/433 variables, 125/138 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 44/182 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 334/516 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-02 20:55:30] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:55:32] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/433 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (OVERLAPS) 1/434 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 519 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 8/8 constraints]
After SMT, in 44098ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 44102ms
Starting structural reductions in LTL mode, iteration 1 : 125/127 places, 335/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44321 ms. Remains : 125/127 places, 335/341 transitions.
[2024-06-02 20:55:55] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:55:55] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:55:55] [INFO ] Input system was already deterministic with 335 transitions.
[2024-06-02 20:55:55] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:55:56] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:55:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality13847512445907521111.gal : 10 ms
[2024-06-02 20:55:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality372847010770924175.ctl : 11 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/CTLCardinality13847512445907521111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality372847010770924175.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,6.46653e+06,2.25305,72648,2,3020,5,220845,6,0,834,226557,0


Converting to forward existential form...Done !
original formula: E(!((((p127==0)||(p11==1)) * (EG(EX(TRUE)) + A(((p51==0)&&(p78==1)) U ((p14==1)&&(p87==1)))))) U !((E(((p120!=0)||(p67!=1)) U ((p48==1)&&...219
=> equivalent forward existential formula: [(FwdU((FwdU(Init,!((((p127==0)||(p11==1)) * (EG(EX(TRUE)) + !((E(!(((p14==1)&&(p87==1))) U (!(((p51==0)&&(p78==...344
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...705
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 20:56:26] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:56:26] [INFO ] Applying decomposition
[2024-06-02 20:56:26] [INFO ] Flatten gal took : 14 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/graph9219608348738605161.txt' '-o' '/tmp/graph9219608348738605161.bin' '-w' '/tmp/graph9219608348738605161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9219608348738605161.bin' '-l' '-1' '-v' '-w' '/tmp/graph9219608348738605161.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:56:26] [INFO ] Decomposing Gal with order
[2024-06-02 20:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:56:26] [INFO ] Removed a total of 539 redundant transitions.
[2024-06-02 20:56:26] [INFO ] Flatten gal took : 123 ms
[2024-06-02 20:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 44 ms.
[2024-06-02 20:56:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality6904144996823037603.gal : 6 ms
[2024-06-02 20:56:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9903743670378451160.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/CTLCardinality6904144996823037603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9903743670378451160.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,6.46653e+06,2.41454,79344,2032,113,131109,2548,653,336957,81,16391,0


Converting to forward existential form...Done !
original formula: E(!((((i0.u3.p127==0)||(i0.u3.p11==1)) * (EG(EX(TRUE)) + A(((i1.i1.u14.p51==0)&&(i4.u25.p78==1)) U ((i1.i0.u4.p14==1)&&(i0.u30.p87==1))))...335
=> equivalent forward existential formula: [(FwdU((FwdU(Init,!((((i0.u3.p127==0)||(i0.u3.p11==1)) * (EG(EX(TRUE)) + !((E(!(((i1.i0.u4.p14==1)&&(i0.u30.p87=...492
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t88, t89, t90, t91, t94, t96, t137...852
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 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
(forward)formula 0,0,9.60952,247512,1,0,364348,2614,3330,1.13824e+06,338,16391,916771
FORMULA FireWire-PT-09-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 327
Applied a total of 12 rules in 9 ms. Remains 122 /127 variables (removed 5) and now considering 327/341 (removed 14) transitions.
[2024-06-02 20:56:36] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
// Phase 1: matrix 301 rows 122 cols
[2024-06-02 20:56:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:56:36] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:56:36] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2024-06-02 20:56:36] [INFO ] Invariant cache hit.
[2024-06-02 20:56:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:56:36] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 253 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/127 places, 327/341 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 264 ms. Remains : 121/127 places, 327/341 transitions.
[2024-06-02 20:56:36] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:56:36] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:56:36] [INFO ] Input system was already deterministic with 327 transitions.
[2024-06-02 20:56:36] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:56:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:56:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7316788795020980397.gal : 2 ms
[2024-06-02 20:56:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality107413529052775538.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/CTLCardinality7316788795020980397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality107413529052775538.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(EF(EG(AG((p119==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG(!(E(TRUE U !((p119==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...682
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.0562,381436,1,0,802,1.98732e+06,681,429,6952,1.303e+06,896
FORMULA FireWire-PT-09-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 333
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 122 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 122 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 120 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 120 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 118 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 118 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 116 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 113 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 112 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 112 transition count 305
Applied a total of 30 rules in 32 ms. Remains 112 /127 variables (removed 15) and now considering 305/341 (removed 36) transitions.
[2024-06-02 20:56:51] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
// Phase 1: matrix 279 rows 112 cols
[2024-06-02 20:56:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:56:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:56:51] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 20:56:51] [INFO ] Invariant cache hit.
[2024-06-02 20:56:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:56:52] [INFO ] Implicit Places using invariants and state equation in 178 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 243 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/127 places, 305/341 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 282 ms. Remains : 111/127 places, 305/341 transitions.
[2024-06-02 20:56:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:56:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:56:52] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-02 20:56:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:56:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:56:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10982659110329939662.gal : 2 ms
[2024-06-02 20:56:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality4131280363307031488.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/CTLCardinality10982659110329939662.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4131280363307031488.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,6.34422e+06,5.18576,155800,2,5497,5,410283,6,0,748,512604,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(((p72==0)&&(p22==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((p72==0)&&(p22==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...633
Detected timeout of ITS tools.
[2024-06-02 20:57:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:57:22] [INFO ] Applying decomposition
[2024-06-02 20:57:22] [INFO ] Flatten gal took : 9 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/graph10895926570453473869.txt' '-o' '/tmp/graph10895926570453473869.bin' '-w' '/tmp/graph10895926570453473869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10895926570453473869.bin' '-l' '-1' '-v' '-w' '/tmp/graph10895926570453473869.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:57:22] [INFO ] Decomposing Gal with order
[2024-06-02 20:57:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:57:22] [INFO ] Removed a total of 474 redundant transitions.
[2024-06-02 20:57:22] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:57:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 9 ms.
[2024-06-02 20:57:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality3632413413165650595.gal : 4 ms
[2024-06-02 20:57:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality5416218163896447748.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/CTLCardinality3632413413165650595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5416218163896447748.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,6.34422e+06,11.7633,242724,1921,215,312314,1688,614,1.06051e+06,85,19646,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(((i5.i0.u23.p72==0)&&(i1.i0.u8.p22==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((i5.i0.u23.p72==0)&&(i1.i0.u8.p22==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t47, t55, t60, t65, t70, t75, t78, t79, t83, t90, t93, t132, t13...765
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 a local SCC at level 2
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 306
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 1 with 2 rules applied. Total rules applied 32 place count 112 transition count 305
Applied a total of 32 rules in 50 ms. Remains 112 /127 variables (removed 15) and now considering 305/341 (removed 36) transitions.
[2024-06-02 20:57:52] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
// Phase 1: matrix 279 rows 112 cols
[2024-06-02 20:57:52] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:57:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:57:52] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 20:57:52] [INFO ] Invariant cache hit.
[2024-06-02 20:57:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:57:52] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 20:57:52] [INFO ] Redundant transitions in 5 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-02 20:57:52] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 20:57:52] [INFO ] Invariant cache hit.
[2024-06-02 20:57:52] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:57:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 20:57:55] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 20:57:56] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 278/390 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 1/391 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 166 constraints, problems are : Problem set: 0 solved, 304 unsolved in 11656 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/390 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 304/469 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 1/391 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 20:58:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 471 constraints, problems are : Problem set: 0 solved, 304 unsolved in 29152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 112/112 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 8/8 constraints]
After SMT, in 41014ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 41018ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/127 places, 305/341 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41302 ms. Remains : 112/127 places, 305/341 transitions.
[2024-06-02 20:58:33] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:58:33] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-02 20:58:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:58:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:58:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3076424677147858747.gal : 4 ms
[2024-06-02 20:58:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9768040897080289942.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/CTLCardinality3076424677147858747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9768040897080289942.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,5.27902e+06,5.68776,149184,2,7511,5,371601,6,0,752,497009,0


Converting to forward existential form...Done !
original formula: AG(((EF(((p64==0)||(p30==1))) + (p27==0)) + (p39==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p39==1))) * !((p27==0))) * !(E(TRUE U ((p64==0)||(p30==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...627
(forward)formula 0,0,12.0395,198616,1,0,554,870210,632,289,6493,693297,633
FORMULA FireWire-PT-09-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 116 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 115 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 113 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 113 transition count 306
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 1 with 2 rules applied. Total rules applied 32 place count 112 transition count 305
Applied a total of 32 rules in 27 ms. Remains 112 /127 variables (removed 15) and now considering 305/341 (removed 36) transitions.
[2024-06-02 20:58:45] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 20:58:45] [INFO ] Invariant cache hit.
[2024-06-02 20:58:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 20:58:45] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2024-06-02 20:58:45] [INFO ] Invariant cache hit.
[2024-06-02 20:58:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:58:46] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 220 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/127 places, 305/341 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 253 ms. Remains : 111/127 places, 305/341 transitions.
[2024-06-02 20:58:46] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:58:46] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-02 20:58:46] [INFO ] Flatten gal took : 15 ms
RANDOM walk for 40000 steps (2204 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2024-06-02 20:58:46] [INFO ] Flatten gal took : 8 ms
BEST_FIRST walk for 40003 steps (582 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-06-02 20:58:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9623622438611349370.gal : 2 ms
[2024-06-02 20:58:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9214890623821228206.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9623622438611349370.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9214890623821228206.prop' '--nowitness' '--gen-order' 'FOLLOW'
Finished probabilistic random walk after 291 steps, run visited all 1 properties in 3 ms. (steps per millisecond=97 )
Probabilistic random walk after 291 steps, saw 224 distinct states, run finished after 8 ms. (steps per millisecond=36 ) properties seen :1
FORMULA FireWire-PT-09-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 122 transition count 327
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 122 transition count 327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 121 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 120 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 119 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 118 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 117 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 117 transition count 315
Applied a total of 22 rules in 11 ms. Remains 117 /127 variables (removed 10) and now considering 315/341 (removed 26) transitions.
[2024-06-02 20:58:46] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
// Phase 1: matrix 289 rows 117 cols
[2024-06-02 20:58:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:58:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 20:58:46] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2024-06-02 20:58:46] [INFO ] Invariant cache hit.
[2024-06-02 20:58:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:58:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/127 places, 315/341 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 315/315 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 116/127 places, 315/341 transitions.
[2024-06-02 20:58:46] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:58:46] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:46] [INFO ] Input system was already deterministic with 315 transitions.
[2024-06-02 20:58:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:58:46] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:58:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality18433264243240660992.gal : 9 ms
[2024-06-02 20:58:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5354208128918441742.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/CTLCardinality18433264243240660992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5354208128918441742.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,6.38442e+06,6.8937,197036,2,9059,5,526306,6,0,778,716564,0


Converting to forward existential form...Done !
original formula: EF((((p114==1) + AG((AX((p103==1)) + ((p70==0)&&(p125==1))))) + (A(((EX(TRUE) + (p47==0)) + (p9==1)) U AG(((p124==0)||(p86==1)))) * (p42=...161
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * (p114==1))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!((p103==1)))) + ((p70==0)&&...411
(forward)formula 0,1,6.89494,197036,1,0,7,526306,8,1,781,716564,1
FORMULA FireWire-PT-09-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 334
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 332
Applied a total of 8 rules in 4 ms. Remains 124 /127 variables (removed 3) and now considering 332/341 (removed 9) transitions.
[2024-06-02 20:58:53] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
// Phase 1: matrix 306 rows 124 cols
[2024-06-02 20:58:53] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:58:53] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:58:53] [INFO ] Flow matrix only has 306 transitions (discarded 26 similar events)
[2024-06-02 20:58:53] [INFO ] Invariant cache hit.
[2024-06-02 20:58:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 20:58:53] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 221 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/127 places, 332/341 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 226 ms. Remains : 123/127 places, 332/341 transitions.
[2024-06-02 20:58:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 20:58:53] [INFO ] Input system was already deterministic with 332 transitions.
[2024-06-02 20:58:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:53] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:58:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality16944966990319102804.gal : 2 ms
[2024-06-02 20:58:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality7571322270212867396.ctl : 4 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/CTLCardinality16944966990319102804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7571322270212867396.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,6.45644e+06,1.54225,48912,2,2951,5,127377,6,0,823,132790,0


Converting to forward existential form...Done !
original formula: E((!(E(((EF(((p32==0)||(p128==1))) * AG((p58==0))) * (AF((p104==1)) * AF(((p121==0)||(p120==1))))) U AF(AG(((p124==0)||(p98==1)))))) + (!...386
=> equivalent forward existential formula: ([(FwdU(Init,(!(E(((E(TRUE U ((p32==0)||(p128==1))) * !(E(TRUE U !((p58==0))))) * (!(EG(!((p104==1)))) * !(EG(!(...813
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...694
Detected timeout of ITS tools.
[2024-06-02 20:59:23] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:59:23] [INFO ] Applying decomposition
[2024-06-02 20:59:23] [INFO ] Flatten gal took : 13 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/graph7714377842285521888.txt' '-o' '/tmp/graph7714377842285521888.bin' '-w' '/tmp/graph7714377842285521888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7714377842285521888.bin' '-l' '-1' '-v' '-w' '/tmp/graph7714377842285521888.weights' '-q' '0' '-e' '0.001'
[2024-06-02 20:59:23] [INFO ] Decomposing Gal with order
[2024-06-02 20:59:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:59:23] [INFO ] Removed a total of 531 redundant transitions.
[2024-06-02 20:59:23] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:59:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 6 ms.
[2024-06-02 20:59:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality16327851667673118636.gal : 7 ms
[2024-06-02 20:59:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5592147062168899970.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/CTLCardinality16327851667673118636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5592147062168899970.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,6.45644e+06,10.6916,262656,2310,216,336468,3605,678,1.35465e+06,85,32258,0


Converting to forward existential form...Done !
original formula: E((!(E(((EF(((i2.u12.p32==0)||(i3.i2.u3.p128==1))) * AG((i4.u20.p58==0))) * (AF((i5.i2.u44.p104==1)) * AF(((i0.u42.p121==0)||(i0.u41.p120...597
=> equivalent forward existential formula: ([(FwdU(Init,(!(E(((E(TRUE U ((i2.u12.p32==0)||(i3.i2.u3.p128==1))) * !(E(TRUE U !((i4.u20.p58==0))))) * (!(EG(!...1143
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t57, t61, t66, t71, t76, t84, t88, t89, t90, t91, t94,...848
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 338
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 337
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 1 with 2 rules applied. Total rules applied 5 place count 124 transition count 336
Applied a total of 5 rules in 16 ms. Remains 124 /127 variables (removed 3) and now considering 336/341 (removed 5) transitions.
[2024-06-02 20:59:54] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 124 cols
[2024-06-02 20:59:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:59:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:59:54] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2024-06-02 20:59:54] [INFO ] Invariant cache hit.
[2024-06-02 20:59:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:59:54] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 264 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 123/127 places, 336/341 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 336/336 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 285 ms. Remains : 123/127 places, 336/341 transitions.
[2024-06-02 20:59:54] [INFO ] Flatten gal took : 7 ms
[2024-06-02 20:59:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 20:59:54] [INFO ] Input system was already deterministic with 336 transitions.
[2024-06-02 20:59:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:59:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 20:59:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16440444892583990489.gal : 2 ms
[2024-06-02 20:59:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality17932584679541265082.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/CTLCardinality16440444892583990489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17932584679541265082.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,5.46046e+06,1.59704,56988,2,2477,5,182648,6,0,827,177161,0


Converting to forward existential form...Done !
original formula: EF(EG(((p78==0)&&(p99==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p78==0)&&(p99==1)))] != FALSE
Hit Full ! (commute/partial/dont) 328/8/8
(forward)formula 0,1,1.98155,56988,1,0,11,182648,19,3,4742,177161,8
FORMULA FireWire-PT-09-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 336
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 125 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 123 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 123 transition count 330
Applied a total of 9 rules in 3 ms. Remains 123 /127 variables (removed 4) and now considering 330/341 (removed 11) transitions.
[2024-06-02 20:59:56] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
// Phase 1: matrix 304 rows 123 cols
[2024-06-02 20:59:56] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 20:59:56] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:59:56] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2024-06-02 20:59:56] [INFO ] Invariant cache hit.
[2024-06-02 20:59:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 20:59:56] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2024-06-02 20:59:56] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2024-06-02 20:59:56] [INFO ] Invariant cache hit.
[2024-06-02 20:59:56] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 20:59:58] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-06-02 20:59:58] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:59:58] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:59:58] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:59:58] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:59:59] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 303/426 variables, 123/136 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 1/427 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (OVERLAPS) 0/427 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 179 constraints, problems are : Problem set: 0 solved, 329 unsolved in 13247 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 303/426 variables, 123/136 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 329/507 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 21:00:16] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (OVERLAPS) 1/427 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-02 21:00:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 510 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 8/8 constraints]
After SMT, in 43507ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 43510ms
Starting structural reductions in LTL mode, iteration 1 : 123/127 places, 330/341 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43733 ms. Remains : 123/127 places, 330/341 transitions.
[2024-06-02 21:00:40] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:00:40] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:00:40] [INFO ] Input system was already deterministic with 330 transitions.
[2024-06-02 21:00:40] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:00:40] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:00:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality5183473813992375583.gal : 2 ms
[2024-06-02 21:00:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13121347360246228314.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/CTLCardinality5183473813992375583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13121347360246228314.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,6.61586e+06,1.59158,48636,2,3066,5,130398,6,0,821,128472,0


Converting to forward existential form...Done !
original formula: ((AG(E(((EX(((p14==0)||(p128==1))) * AX((p95==0))) * (((p45==0)||(!((p107==0)||(p2==1))))||(!(((p76==0)||(p85==1))&&(p81==0))))) U EG((((...385
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(((EX(((p14==0)||(p128==1))) * !(EX(!((p95==0))))) * (((p45==0)||(!((p107==0)||(p2==1))...507
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...688
Detected timeout of ITS tools.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:01:10] [INFO ] Applying decomposition
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 8 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/graph4814303366140079532.txt' '-o' '/tmp/graph4814303366140079532.bin' '-w' '/tmp/graph4814303366140079532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4814303366140079532.bin' '-l' '-1' '-v' '-w' '/tmp/graph4814303366140079532.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:01:10] [INFO ] Decomposing Gal with order
[2024-06-02 21:01:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:01:10] [INFO ] Removed a total of 525 redundant transitions.
[2024-06-02 21:01:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 6 ms.
[2024-06-02 21:01:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality12307172859917174946.gal : 2 ms
[2024-06-02 21:01:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16516337019985714579.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/CTLCardinality12307172859917174946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16516337019985714579.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 -...264
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,6.61586e+06,5.63969,163852,2082,168,268655,2171,651,630703,87,16901,0


Converting to forward existential form...Done !
original formula: ((AG(E(((EX(((i2.i0.u4.p14==0)||(i1.u3.p128==1))) * AX((i5.u34.p95==0))) * (((i4.u21.p45==0)||(!((i6.i2.u38.p107==0)||(i0.u0.p2==1))))||(...601
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(((EX(((i2.i0.u4.p14==0)||(i1.u3.p128==1))) * !(EX(!((i5.u34.p95==0))))) * (((i4.u21.p4...723
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t62, t66, t71, t76, t91, t94, t96, t133, t134, t1...825
Using saturation style SCC detection
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 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
(forward)formula 0,0,26.2322,619768,1,0,915731,5697,3449,2.5685e+06,372,44578,2153891
FORMULA FireWire-PT-09-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 333
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 122 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 122 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 120 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 120 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 118 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 118 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 116 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 116 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 113 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 112 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 112 transition count 305
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 1 with 2 rules applied. Total rules applied 32 place count 111 transition count 304
Applied a total of 32 rules in 24 ms. Remains 111 /127 variables (removed 16) and now considering 304/341 (removed 37) transitions.
[2024-06-02 21:01:36] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
// Phase 1: matrix 278 rows 111 cols
[2024-06-02 21:01:36] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:01:36] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 21:01:36] [INFO ] Flow matrix only has 278 transitions (discarded 26 similar events)
[2024-06-02 21:01:36] [INFO ] Invariant cache hit.
[2024-06-02 21:01:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:01:37] [INFO ] Implicit Places using invariants and state equation in 169 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 283 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/127 places, 304/341 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 311 ms. Remains : 110/127 places, 304/341 transitions.
[2024-06-02 21:01:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:37] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 21:01:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:01:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2348729526603666634.gal : 6 ms
[2024-06-02 21:01:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality17153350210971192831.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/CTLCardinality2348729526603666634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17153350210971192831.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,5.27902e+06,3.77712,118720,2,5768,5,307969,6,0,743,397076,0


Converting to forward existential form...Done !
original formula: AF((AF((p108==1)) + EF((p47==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((p108==1)))) + E(TRUE U (p47==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...627
Detected timeout of ITS tools.
[2024-06-02 21:02:07] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:02:07] [INFO ] Applying decomposition
[2024-06-02 21:02:07] [INFO ] Flatten gal took : 7 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/graph3710750195508598986.txt' '-o' '/tmp/graph3710750195508598986.bin' '-w' '/tmp/graph3710750195508598986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3710750195508598986.bin' '-l' '-1' '-v' '-w' '/tmp/graph3710750195508598986.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:02:07] [INFO ] Decomposing Gal with order
[2024-06-02 21:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:02:07] [INFO ] Removed a total of 474 redundant transitions.
[2024-06-02 21:02:07] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 6 ms.
[2024-06-02 21:02:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality597397188975112288.gal : 2 ms
[2024-06-02 21:02:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality6251576311030858734.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/CTLCardinality597397188975112288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6251576311030858734.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 -...261
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,5.27902e+06,4.79785,121584,2441,223,140160,2467,632,758481,84,25323,0


Converting to forward existential form...Done !
original formula: AF((AF((i5.i1.u36.p108==1)) + EF((i2.i1.u15.p47==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((i5.i1.u36.p108==1)))) + E(TRUE U (i2.i1.u15.p47==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t47, t55, t60, t65, t70, t75, t78, t87, t88, t89, t90, t93, t136...778
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 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
(forward)formula 0,1,25.1226,477244,1,0,536896,7235,3048,2.82676e+06,349,48873,1410456
FORMULA FireWire-PT-09-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 333
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 122 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 122 transition count 329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 120 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 120 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 118 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 118 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 116 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 116 transition count 314
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 1 with 2 rules applied. Total rules applied 24 place count 115 transition count 313
Applied a total of 24 rules in 17 ms. Remains 115 /127 variables (removed 12) and now considering 313/341 (removed 28) transitions.
[2024-06-02 21:02:32] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
// Phase 1: matrix 287 rows 115 cols
[2024-06-02 21:02:32] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:02:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 21:02:32] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2024-06-02 21:02:32] [INFO ] Invariant cache hit.
[2024-06-02 21:02:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 21:02:32] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 293 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 114/127 places, 313/341 transitions.
Applied a total of 0 rules in 11 ms. Remains 114 /114 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 321 ms. Remains : 114/127 places, 313/341 transitions.
[2024-06-02 21:02:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:02:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:02:32] [INFO ] Input system was already deterministic with 313 transitions.
[2024-06-02 21:02:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:02:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:02:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15875419757801468228.gal : 1 ms
[2024-06-02 21:02:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality11274468197860256682.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/CTLCardinality15875419757801468228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11274468197860256682.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,5.31922e+06,5.40204,161584,2,6927,5,432438,6,0,768,526241,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((p86==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p86==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...651
Detected timeout of ITS tools.
[2024-06-02 21:03:02] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:03:02] [INFO ] Applying decomposition
[2024-06-02 21:03:02] [INFO ] Flatten gal took : 7 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/graph12482969421050766055.txt' '-o' '/tmp/graph12482969421050766055.bin' '-w' '/tmp/graph12482969421050766055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12482969421050766055.bin' '-l' '-1' '-v' '-w' '/tmp/graph12482969421050766055.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:03:02] [INFO ] Decomposing Gal with order
[2024-06-02 21:03:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:03:02] [INFO ] Removed a total of 494 redundant transitions.
[2024-06-02 21:03:02] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:03:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 4 ms.
[2024-06-02 21:03:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality14499424462344421786.gal : 2 ms
[2024-06-02 21:03:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality4198544223736113834.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/CTLCardinality14499424462344421786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4198544223736113834.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,5.31922e+06,8.98639,196564,2192,136,172433,2265,666,1.5027e+06,80,24501,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((i5.u30.p86==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((i5.u30.p86==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t47, t55, t60, t65, t70, t74, t75, t83, t87, t88, t89, t90, t93,...792
(forward)formula 0,0,15.9605,221380,1,0,275950,2868,3028,1.5027e+06,327,24501,728972
FORMULA FireWire-PT-09-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 127/127 places, 341/341 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 337
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 125 transition count 335
Applied a total of 6 rules in 11 ms. Remains 125 /127 variables (removed 2) and now considering 335/341 (removed 6) transitions.
[2024-06-02 21:03:18] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
// Phase 1: matrix 309 rows 125 cols
[2024-06-02 21:03:18] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:03:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 21:03:19] [INFO ] Flow matrix only has 309 transitions (discarded 26 similar events)
[2024-06-02 21:03:19] [INFO ] Invariant cache hit.
[2024-06-02 21:03:19] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:03:19] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 233 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 124/127 places, 335/341 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 247 ms. Remains : 124/127 places, 335/341 transitions.
[2024-06-02 21:03:19] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:03:19] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:03:19] [INFO ] Input system was already deterministic with 335 transitions.
[2024-06-02 21:03:19] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:03:19] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:03:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality17242821013457692957.gal : 1 ms
[2024-06-02 21:03:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12739667654259731365.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/CTLCardinality17242821013457692957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12739667654259731365.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,6.46653e+06,8.43362,240060,2,10190,5,607769,6,0,830,761905,0


Converting to forward existential form...Done !
original formula: E(AG(!(EG((!(((p72==0)||(p4==1))) * A((p55==1) U (p116==0)))))) U AG((((EF((p47==1)) * EG((p66==1))) * ((p40!=0)&&(p82==1))) * (((p34==0)...192
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!(EG((!(((p72==0)||(p4==1))) * !((E(!((p116==0)) U (!((p55==1)) * !((p116==0)))) + EG(!...315
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...705
Detected timeout of ITS tools.
[2024-06-02 21:03:49] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:03:49] [INFO ] Applying decomposition
[2024-06-02 21:03:49] [INFO ] Flatten gal took : 7 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/graph332343023423273479.txt' '-o' '/tmp/graph332343023423273479.bin' '-w' '/tmp/graph332343023423273479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph332343023423273479.bin' '-l' '-1' '-v' '-w' '/tmp/graph332343023423273479.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:03:49] [INFO ] Decomposing Gal with order
[2024-06-02 21:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:03:49] [INFO ] Removed a total of 541 redundant transitions.
[2024-06-02 21:03:49] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:03:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 3 ms.
[2024-06-02 21:03:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9538790857278522185.gal : 2 ms
[2024-06-02 21:03:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11315302347223877745.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/CTLCardinality9538790857278522185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11315302347223877745.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,6.46653e+06,14.7983,341072,2767,97,459132,2858,681,1.60939e+06,78,19083,0


Converting to forward existential form...Done !
original formula: E(AG(!(EG((!(((i5.i0.u24.p72==0)||(i1.i2.u1.p4==1))) * A((i4.u19.p55==1) U (i0.u25.p116==0)))))) U AG((((EF((i3.i2.u16.p47==1)) * EG((i5....292
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!(EG((!(((i5.i0.u24.p72==0)||(i1.i2.u1.p4==1))) * !((E(!((i0.u25.p116==0)) U (!((i4.u19...429
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t55, t56, t61, t66, t71, t76, t84, t88, t89, t90, t91, t94,...865
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 an SCC at level 4
Fast SCC detection found a local SCC at level 2
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
(forward)formula 0,0,20.4867,341072,1,0,459132,2858,3468,1.60939e+06,319,19083,645527
FORMULA FireWire-PT-09-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 21:04:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:04:09] [INFO ] Flatten gal took : 8 ms
[2024-06-02 21:04:09] [INFO ] Applying decomposition
[2024-06-02 21:04:09] [INFO ] Flatten gal took : 8 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/graph17053342085963958377.txt' '-o' '/tmp/graph17053342085963958377.bin' '-w' '/tmp/graph17053342085963958377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17053342085963958377.bin' '-l' '-1' '-v' '-w' '/tmp/graph17053342085963958377.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:04:10] [INFO ] Decomposing Gal with order
[2024-06-02 21:04:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:04:10] [INFO ] Removed a total of 551 redundant transitions.
[2024-06-02 21:04:10] [INFO ] Flatten gal took : 39 ms
[2024-06-02 21:04:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 26 ms.
[2024-06-02 21:04:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality1425403268464858099.gal : 15 ms
[2024-06-02 21:04:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality2159865055223384962.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/CTLCardinality1425403268464858099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2159865055223384962.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 2 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,6.72833e+06,12.9741,273172,2498,75,359418,1264,673,1.09313e+06,82,5327,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(((i2.i1.u23.p72==0)&&(i3.i2.u8.p22==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((i2.i1.u23.p72==0)&&(i3.i2.u8.p22==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t42, t45, t46, t55, t56, t61, t66, t71, t76, t84, t88, t89, t90, t91, t94, t103, t13...834
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 1
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
(forward)formula 0,1,71.0195,1316424,1,0,1.8439e+06,1939,3478,6.04325e+06,350,9120,3789867
FORMULA FireWire-PT-09-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2024-06-02 21:06:12] [INFO ] Applying decomposition
[2024-06-02 21:06:12] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:06:12] [INFO ] Decomposing Gal with order
[2024-06-02 21:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:06:12] [INFO ] Removed a total of 431 redundant transitions.
[2024-06-02 21:06:12] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 2 ms.
[2024-06-02 21:06:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality4762697382128925602.gal : 1 ms
[2024-06-02 21:06:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality16724292037513061175.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/CTLCardinality4762697382128925602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16724292037513061175.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,6.72833e+06,0.370176,17740,390,1435,9560,15770,175,23691,405,119529,0


Converting to forward existential form...Done !
original formula: E((!(E(((EF(((u3.p32==0)||(u9.p128==1))) * AG((u5.p58==0))) * (AF((u9.p104==1)) * AF(((u9.p121==0)||(u9.p120==1))))) U AF(AG(((u9.p124==0...461
=> equivalent forward existential formula: ([(FwdU(Init,(!(E(((E(TRUE U ((u3.p32==0)||(u9.p128==1))) * !(E(TRUE U !((u5.p58==0))))) * (!(EG(!((u9.p104==1))...930
Reverse transition relation is NOT exact ! Due to transitions t80, t93, t94, t102, t179, t191, t234, t235, t243, t293, t294, t307, t311, t319, t321, t324, ...478
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 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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
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 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 7
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,20.0348,622952,1,0,957791,222137,1026,1.56298e+06,1824,1.44899e+06,1822335
FORMULA FireWire-PT-09-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 751254 ms.

BK_STOP 1717362392737

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-09"
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-09, 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-171734898900233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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