About the Execution of ITS-Tools for DLCflexbar-PT-3a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 457.659 | 294018.00 | 347581.00 | 981.40 | FTTTTTTTFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r114-smll-171624275100017.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 DLCflexbar-PT-3a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275100017
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 22:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 996K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-00
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-01
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-02
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-03
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-04
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-05
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-06
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-07
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-08
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-09
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-10
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2024-11
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2023-12
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2023-13
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2023-14
FORMULA_NAME DLCflexbar-PT-3a-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716299045292
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-3a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 13:44:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 13:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:44:07] [INFO ] Load time of PNML (sax parser for PT used): 404 ms
[2024-05-21 13:44:07] [INFO ] Transformed 581 places.
[2024-05-21 13:44:07] [INFO ] Transformed 3891 transitions.
[2024-05-21 13:44:07] [INFO ] Found NUPN structural information;
[2024-05-21 13:44:07] [INFO ] Parsed PT model containing 581 places and 3891 transitions and 14956 arcs in 612 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 131 ms.
Ensure Unique test removed 455 transitions
Reduce redundant transitions removed 455 transitions.
FORMULA DLCflexbar-PT-3a-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCflexbar-PT-3a-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 3436/3436 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 523 transition count 2848
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 523 transition count 2848
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 140 place count 523 transition count 2824
Drop transitions (Redundant composition of simpler transitions.) removed 878 transitions
Redundant transition composition rules discarded 878 transitions
Iterating global reduction 1 with 878 rules applied. Total rules applied 1018 place count 523 transition count 1946
Applied a total of 1018 rules in 249 ms. Remains 523 /581 variables (removed 58) and now considering 1946/3436 (removed 1490) transitions.
[2024-05-21 13:44:08] [INFO ] Flow matrix only has 300 transitions (discarded 1646 similar events)
// Phase 1: matrix 300 rows 523 cols
[2024-05-21 13:44:08] [INFO ] Computed 355 invariants in 28 ms
[2024-05-21 13:44:11] [INFO ] Implicit Places using invariants in 2835 ms returned [205, 206, 208, 209, 210, 211, 213, 214, 215, 216, 220, 221, 222, 223, 224, 225, 226, 227, 228, 230, 231, 232, 233, 234, 235, 236, 237, 239, 240, 241, 243, 245, 246, 247, 248, 249, 250, 251, 252, 254, 255, 256, 258, 259, 260, 261, 262, 263, 264, 267, 268, 269, 270, 271, 272, 273, 274, 276, 277, 278, 279, 280, 281, 283, 284, 285, 286, 287, 288, 289, 290, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 308, 310, 311, 313, 314, 315, 316, 320, 321, 322, 325, 326, 327, 328, 329, 330, 331, 332, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 346, 347, 348, 349, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 393, 394, 395, 396, 397, 398, 399, 401, 402, 405, 406, 407, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 421, 424, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 454, 455, 457, 459, 460, 461, 463, 464, 465, 466, 468, 470, 471, 472, 474, 475, 476, 477, 478, 479, 481, 482, 484, 485, 487, 488, 489, 492, 493, 494, 496, 497, 498, 499, 501, 502, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522]
Discarding 266 places :
Ensure Unique test removed 1280 transitions
Reduce isomorphic transitions removed 1280 transitions.
Implicit Place search using SMT only with invariants took 2910 ms to find 266 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 257/581 places, 666/3436 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 275 transitions
Redundant transition composition rules discarded 275 transitions
Iterating global reduction 0 with 275 rules applied. Total rules applied 275 place count 257 transition count 391
Applied a total of 275 rules in 14 ms. Remains 257 /257 variables (removed 0) and now considering 391/666 (removed 275) transitions.
[2024-05-21 13:44:11] [INFO ] Flow matrix only has 300 transitions (discarded 91 similar events)
// Phase 1: matrix 300 rows 257 cols
[2024-05-21 13:44:11] [INFO ] Computed 89 invariants in 5 ms
[2024-05-21 13:44:11] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 13:44:11] [INFO ] Flow matrix only has 300 transitions (discarded 91 similar events)
[2024-05-21 13:44:11] [INFO ] Invariant cache hit.
[2024-05-21 13:44:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:44:11] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/581 places, 391/3436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3649 ms. Remains : 257/581 places, 391/3436 transitions.
Support contains 83 out of 257 places after structural reductions.
[2024-05-21 13:44:11] [INFO ] Flatten gal took : 86 ms
[2024-05-21 13:44:12] [INFO ] Flatten gal took : 30 ms
[2024-05-21 13:44:12] [INFO ] Input system was already deterministic with 391 transitions.
RANDOM walk for 40000 steps (8 resets) in 3455 ms. (11 steps per ms) remains 14/49 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
[2024-05-21 13:44:13] [INFO ] Flow matrix only has 300 transitions (discarded 91 similar events)
[2024-05-21 13:44:13] [INFO ] Invariant cache hit.
[2024-05-21 13:44:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/71 variables, 33/33 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 186/257 variables, 56/89 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 299/556 variables, 257/346 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/346 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/347 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 347 constraints, problems are : Problem set: 2 solved, 12 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 257/257 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
After SMT solving in domain Int declared 65/557 variables, and 27 constraints, problems are : Problem set: 14 solved, 0 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 27/89 constraints, State Equation: 0/257 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 1408ms problems are : Problem set: 14 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 14 atomic propositions for a total of 14 simplifications.
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:44:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 13:44:15] [INFO ] Flatten gal took : 21 ms
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 13:44:15] [INFO ] Flatten gal took : 21 ms
[2024-05-21 13:44:15] [INFO ] Input system was already deterministic with 391 transitions.
Computed a total of 55 stabilizing places and 1 stable transitions
Graph (complete) has 479 edges and 257 vertex of which 203 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 204 transition count 391
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 193 transition count 369
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 193 transition count 369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 193 transition count 364
Applied a total of 80 rules in 22 ms. Remains 193 /257 variables (removed 64) and now considering 364/391 (removed 27) transitions.
[2024-05-21 13:44:15] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
// Phase 1: matrix 284 rows 193 cols
[2024-05-21 13:44:15] [INFO ] Computed 36 invariants in 3 ms
[2024-05-21 13:44:15] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 13:44:15] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
[2024-05-21 13:44:15] [INFO ] Invariant cache hit.
[2024-05-21 13:44:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:44:15] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-21 13:44:15] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
[2024-05-21 13:44:15] [INFO ] Invariant cache hit.
[2024-05-21 13:44:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 1/193 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 283/476 variables, 193/229 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 1/477 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (OVERLAPS) 0/477 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 230 constraints, problems are : Problem set: 0 solved, 363 unsolved in 25865 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 193/193 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 1/193 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 283/476 variables, 193/229 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 363/592 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (OVERLAPS) 1/477 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 10 (OVERLAPS) 0/477 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 593 constraints, problems are : Problem set: 0 solved, 363 unsolved in 23295 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 193/193 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
After SMT, in 49280ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 49292ms
Starting structural reductions in LTL mode, iteration 1 : 193/257 places, 364/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49606 ms. Remains : 193/257 places, 364/391 transitions.
[2024-05-21 13:45:05] [INFO ] Flatten gal took : 16 ms
[2024-05-21 13:45:05] [INFO ] Flatten gal took : 15 ms
[2024-05-21 13:45:05] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-21 13:45:05] [INFO ] Flatten gal took : 14 ms
[2024-05-21 13:45:05] [INFO ] Flatten gal took : 13 ms
[2024-05-21 13:45:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2053267063829015351.gal : 7 ms
[2024-05-21 13:45:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15910679176148188261.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/CTLCardinality2053267063829015351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15910679176148188261.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,3.66211e+25,0.091262,4832,2,542,5,2087,6,0,1054,1440,0
Converting to forward existential form...Done !
original formula: EX(AG(((p92==0)&&(p450==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p92==0)&&(p450==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.322522,10460,1,0,6,37815,15,0,4402,2315,5
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 204 transition count 391
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 65 place count 192 transition count 367
Iterating global reduction 1 with 12 rules applied. Total rules applied 77 place count 192 transition count 367
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 83 place count 192 transition count 361
Applied a total of 83 rules in 14 ms. Remains 192 /257 variables (removed 65) and now considering 361/391 (removed 30) transitions.
[2024-05-21 13:45:05] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 192 cols
[2024-05-21 13:45:05] [INFO ] Computed 36 invariants in 4 ms
[2024-05-21 13:45:05] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 13:45:05] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:45:05] [INFO ] Invariant cache hit.
[2024-05-21 13:45:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:45:05] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-21 13:45:05] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:45:05] [INFO ] Invariant cache hit.
[2024-05-21 13:45:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 229 constraints, problems are : Problem set: 0 solved, 360 unsolved in 22451 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 360/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 589 constraints, problems are : Problem set: 0 solved, 360 unsolved in 18638 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 41160ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 41168ms
Starting structural reductions in LTL mode, iteration 1 : 192/257 places, 361/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41458 ms. Remains : 192/257 places, 361/391 transitions.
[2024-05-21 13:45:47] [INFO ] Flatten gal took : 13 ms
[2024-05-21 13:45:47] [INFO ] Flatten gal took : 12 ms
[2024-05-21 13:45:47] [INFO ] Input system was already deterministic with 361 transitions.
[2024-05-21 13:45:47] [INFO ] Flatten gal took : 12 ms
[2024-05-21 13:45:47] [INFO ] Flatten gal took : 12 ms
[2024-05-21 13:45:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality12801055621984206709.gal : 7 ms
[2024-05-21 13:45:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality4647641586147379213.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/CTLCardinality12801055621984206709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4647641586147379213.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,3.05176e+25,0.069399,4932,2,539,5,2071,6,0,1048,1431,0
Converting to forward existential form...Done !
original formula: AX(AG((p403==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p403==1)))] = FALSE
(forward)formula 0,1,0.123253,5248,1,0,7,2071,10,2,1934,1431,4
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Graph (trivial) has 388 edges and 257 vertex of which 200 / 257 are part of one of the 35 SCC in 5 ms
Free SCC test removed 165 places
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Graph (complete) has 127 edges and 92 vertex of which 38 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.0 ms
Discarding 54 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 70 place count 3 transition count 3
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 72 place count 2 transition count 3
Applied a total of 72 rules in 25 ms. Remains 2 /257 variables (removed 255) and now considering 3/391 (removed 388) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-21 13:45:47] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 13:45:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 13:45:47] [INFO ] Invariant cache hit.
[2024-05-21 13:45:47] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-21 13:45:47] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-21 13:45:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 51ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/257 places, 3/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 130 ms. Remains : 2/257 places, 3/391 transitions.
[2024-05-21 13:45:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:45:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:45:47] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-21 13:45:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:45:47] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:45:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality6578272448894814062.gal : 1 ms
[2024-05-21 13:45:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality7704514085052985042.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/CTLCardinality6578272448894814062.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7704514085052985042.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.001613,3276,2,4,5,12,5,0,12,6,0
Converting to forward existential form...Done !
original formula: EG(EF((p40!=0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p40!=0)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.00246,3592,1,0,6,19,16,1,45,11,10
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 204 transition count 391
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 65 place count 192 transition count 367
Iterating global reduction 1 with 12 rules applied. Total rules applied 77 place count 192 transition count 367
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 83 place count 192 transition count 361
Applied a total of 83 rules in 13 ms. Remains 192 /257 variables (removed 65) and now considering 361/391 (removed 30) transitions.
[2024-05-21 13:45:47] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 192 cols
[2024-05-21 13:45:47] [INFO ] Computed 36 invariants in 1 ms
[2024-05-21 13:45:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 13:45:47] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:45:47] [INFO ] Invariant cache hit.
[2024-05-21 13:45:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:45:47] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-21 13:45:47] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:45:47] [INFO ] Invariant cache hit.
[2024-05-21 13:45:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 229 constraints, problems are : Problem set: 0 solved, 360 unsolved in 22447 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 360/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 589 constraints, problems are : Problem set: 0 solved, 360 unsolved in 18150 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 40655ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 40660ms
Starting structural reductions in LTL mode, iteration 1 : 192/257 places, 361/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40909 ms. Remains : 192/257 places, 361/391 transitions.
[2024-05-21 13:46:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 13:46:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 13:46:28] [INFO ] Input system was already deterministic with 361 transitions.
[2024-05-21 13:46:28] [INFO ] Flatten gal took : 11 ms
[2024-05-21 13:46:28] [INFO ] Flatten gal took : 22 ms
[2024-05-21 13:46:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality16542492688562818555.gal : 3 ms
[2024-05-21 13:46:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3997950875586473559.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/CTLCardinality16542492688562818555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3997950875586473559.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,3.05176e+25,0.068943,4936,2,539,5,2071,6,0,1048,1431,0
Converting to forward existential form...Done !
original formula: AX(EX(AX(AG((p381!=0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EX(!(!(E(TRUE U !((p381!=0))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.283341,10268,1,0,5,37367,15,0,4373,2270,6
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 205 transition count 391
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 194 transition count 369
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 194 transition count 369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 79 place count 194 transition count 364
Applied a total of 79 rules in 9 ms. Remains 194 /257 variables (removed 63) and now considering 364/391 (removed 27) transitions.
[2024-05-21 13:46:28] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
// Phase 1: matrix 284 rows 194 cols
[2024-05-21 13:46:28] [INFO ] Computed 37 invariants in 4 ms
[2024-05-21 13:46:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 13:46:28] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
[2024-05-21 13:46:28] [INFO ] Invariant cache hit.
[2024-05-21 13:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:46:29] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-21 13:46:29] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
[2024-05-21 13:46:29] [INFO ] Invariant cache hit.
[2024-05-21 13:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 2/194 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 283/477 variables, 194/231 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 1/478 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (OVERLAPS) 0/478 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 232 constraints, problems are : Problem set: 0 solved, 363 unsolved in 29693 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 194/194 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 2/194 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 283/477 variables, 194/231 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 363/594 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (OVERLAPS) 1/478 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 595 constraints, problems are : Problem set: 0 solved, 363 unsolved in 22226 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 194/194 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
After SMT, in 51971ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 51977ms
Starting structural reductions in LTL mode, iteration 1 : 194/257 places, 364/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52274 ms. Remains : 194/257 places, 364/391 transitions.
[2024-05-21 13:47:21] [INFO ] Flatten gal took : 19 ms
[2024-05-21 13:47:21] [INFO ] Flatten gal took : 18 ms
[2024-05-21 13:47:21] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-21 13:47:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 13:47:21] [INFO ] Flatten gal took : 9 ms
[2024-05-21 13:47:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1292880443639086492.gal : 3 ms
[2024-05-21 13:47:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality3014146799238146548.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1292880443639086492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3014146799238146548.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,3.66211e+25,0.111479,4952,2,544,5,2093,6,0,1055,1444,0
Converting to forward existential form...Done !
original formula: AG(AX(((AG((p516==1)) + AX((p79==0))) + AG(EF((p349==1))))))
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,TRUE)) * !((!(E(TRUE U !((p516==1)))) + !(EX(!((p79==0))))))),TRUE) * !(E(TRUE U (p349==1))...166
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.445441,10284,1,0,6,37958,14,0,4407,2297,5
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 206 transition count 391
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 195 transition count 369
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 195 transition count 369
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 78 place count 195 transition count 364
Applied a total of 78 rules in 8 ms. Remains 195 /257 variables (removed 62) and now considering 364/391 (removed 27) transitions.
[2024-05-21 13:47:21] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
// Phase 1: matrix 284 rows 195 cols
[2024-05-21 13:47:21] [INFO ] Computed 38 invariants in 2 ms
[2024-05-21 13:47:21] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 13:47:21] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
[2024-05-21 13:47:21] [INFO ] Invariant cache hit.
[2024-05-21 13:47:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:47:21] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-05-21 13:47:21] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
[2024-05-21 13:47:21] [INFO ] Invariant cache hit.
[2024-05-21 13:47:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 3/195 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 283/478 variables, 195/233 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (OVERLAPS) 0/479 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 234 constraints, problems are : Problem set: 0 solved, 363 unsolved in 26701 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 195/195 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 3/195 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 283/478 variables, 195/233 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 363/596 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (OVERLAPS) 1/479 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 597 constraints, problems are : Problem set: 0 solved, 363 unsolved in 20668 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 195/195 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
After SMT, in 47419ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 47424ms
Starting structural reductions in LTL mode, iteration 1 : 195/257 places, 364/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47660 ms. Remains : 195/257 places, 364/391 transitions.
[2024-05-21 13:48:09] [INFO ] Flatten gal took : 14 ms
[2024-05-21 13:48:09] [INFO ] Flatten gal took : 9 ms
[2024-05-21 13:48:09] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-21 13:48:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 13:48:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 13:48:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality16870689143377676591.gal : 2 ms
[2024-05-21 13:48:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality5983964022761327501.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/CTLCardinality16870689143377676591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5983964022761327501.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,3.66211e+25,0.114574,4956,2,546,5,2099,6,0,1056,1446,0
Converting to forward existential form...Done !
original formula: EF((AG((p324==1)) + (AX((p148==1)) * (AF((p520==1)) + (p462==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((p324==1)))))] != FALSE + ([((FwdU(Init,TRUE) * !(EX(!((p148==1))))) * !(EG(!(...247
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.451674,10552,1,0,6,38165,15,2,4416,2295,5
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 204 transition count 391
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 65 place count 192 transition count 367
Iterating global reduction 1 with 12 rules applied. Total rules applied 77 place count 192 transition count 367
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 83 place count 192 transition count 361
Applied a total of 83 rules in 7 ms. Remains 192 /257 variables (removed 65) and now considering 361/391 (removed 30) transitions.
[2024-05-21 13:48:09] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
// Phase 1: matrix 282 rows 192 cols
[2024-05-21 13:48:09] [INFO ] Computed 36 invariants in 1 ms
[2024-05-21 13:48:09] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 13:48:09] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:48:09] [INFO ] Invariant cache hit.
[2024-05-21 13:48:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:48:10] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-21 13:48:10] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2024-05-21 13:48:10] [INFO ] Invariant cache hit.
[2024-05-21 13:48:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 229 constraints, problems are : Problem set: 0 solved, 360 unsolved in 26367 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 360/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 589 constraints, problems are : Problem set: 0 solved, 360 unsolved in 21433 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 47847ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 47851ms
Starting structural reductions in LTL mode, iteration 1 : 192/257 places, 361/391 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48080 ms. Remains : 192/257 places, 361/391 transitions.
[2024-05-21 13:48:57] [INFO ] Flatten gal took : 15 ms
[2024-05-21 13:48:57] [INFO ] Flatten gal took : 11 ms
[2024-05-21 13:48:57] [INFO ] Input system was already deterministic with 361 transitions.
[2024-05-21 13:48:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 13:48:57] [INFO ] Flatten gal took : 6 ms
[2024-05-21 13:48:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13366587205092597988.gal : 3 ms
[2024-05-21 13:48:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7762250215436517989.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/CTLCardinality13366587205092597988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7762250215436517989.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,3.05176e+25,0.068321,4936,2,539,5,2071,6,0,1048,1431,0
Converting to forward existential form...Done !
original formula: AG(AX(EF((p483==1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U (p483==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.274124,10268,1,0,6,37367,14,0,4373,2277,5
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Graph (trivial) has 386 edges and 257 vertex of which 199 / 257 are part of one of the 35 SCC in 1 ms
Free SCC test removed 164 places
Ensure Unique test removed 350 transitions
Reduce isomorphic transitions removed 350 transitions.
Graph (complete) has 129 edges and 93 vertex of which 42 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 42 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 41 transition count 40
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 36 place count 9 transition count 8
Iterating global reduction 2 with 32 rules applied. Total rules applied 68 place count 9 transition count 8
Applied a total of 68 rules in 8 ms. Remains 9 /257 variables (removed 248) and now considering 8/391 (removed 383) transitions.
[2024-05-21 13:48:58] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 9 cols
[2024-05-21 13:48:58] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 13:48:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 13:48:58] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-21 13:48:58] [INFO ] Invariant cache hit.
[2024-05-21 13:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:48:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-21 13:48:58] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-21 13:48:58] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-21 13:48:58] [INFO ] Invariant cache hit.
[2024-05-21 13:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/14 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/15 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/14 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/15 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/15 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 23 constraints, problems are : Problem set: 0 solved, 7 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 231ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/257 places, 8/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 300 ms. Remains : 9/257 places, 8/391 transitions.
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Input system was already deterministic with 8 transitions.
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13916192272521649024.gal : 1 ms
[2024-05-21 13:48:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14248542956528168384.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/CTLCardinality13916192272521649024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14248542956528168384.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,0.002428,3320,2,18,5,60,6,0,32,36,0
Converting to forward existential form...Done !
original formula: E((!(AF(!((((p562==0)||(p511==1))&&(p143==1))))) + (p311==0)) U AF(!(AF((p13==0)))))
=> equivalent forward existential formula: [(FwdU(Init,(!(!(EG(!(!((((p562==0)||(p511==1))&&(p143==1))))))) + (p311==0))) * !(EG(!(!(!(EG(!((p13==0))))))))...166
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.005647,3900,1,0,12,133,36,8,172,153,17
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Graph (trivial) has 390 edges and 257 vertex of which 202 / 257 are part of one of the 35 SCC in 1 ms
Free SCC test removed 167 places
Ensure Unique test removed 355 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 124 edges and 90 vertex of which 37 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.0 ms
Discarding 53 places :
Also discarding 0 output transitions
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 36 place count 3 transition count 2
Iterating global reduction 0 with 34 rules applied. Total rules applied 70 place count 3 transition count 2
Applied a total of 70 rules in 4 ms. Remains 3 /257 variables (removed 254) and now considering 2/391 (removed 389) transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-05-21 13:48:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:48:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 13:48:58] [INFO ] Invariant cache hit.
[2024-05-21 13:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:48:58] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-21 13:48:58] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-21 13:48:58] [INFO ] Invariant cache hit.
[2024-05-21 13:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 57ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/257 places, 2/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 3/257 places, 2/391 transitions.
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Input system was already deterministic with 2 transitions.
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality157862895080975151.gal : 0 ms
[2024-05-21 13:48:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality2714180712599367489.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/CTLCardinality157862895080975151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2714180712599367489.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,2,0.001635,3276,2,6,5,16,6,0,10,8,0
Converting to forward existential form...Done !
original formula: AF(EG(AG((p375==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(TRUE U !((p375==0)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002861,3592,1,0,6,22,24,1,50,14,11
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Graph (trivial) has 388 edges and 257 vertex of which 200 / 257 are part of one of the 35 SCC in 1 ms
Free SCC test removed 165 places
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Graph (complete) has 127 edges and 92 vertex of which 38 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.0 ms
Discarding 54 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 2 transition count 3
Applied a total of 72 rules in 3 ms. Remains 2 /257 variables (removed 255) and now considering 3/391 (removed 388) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-21 13:48:58] [INFO ] Computed 1 invariants in 0 ms
[2024-05-21 13:48:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 13:48:58] [INFO ] Invariant cache hit.
[2024-05-21 13:48:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-21 13:48:58] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-21 13:48:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 47ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/257 places, 3/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 2/257 places, 3/391 transitions.
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Input system was already deterministic with 3 transitions.
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality12232613378863097678.gal : 2 ms
[2024-05-21 13:48:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality11811529462019016931.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/CTLCardinality12232613378863097678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11811529462019016931.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.001563,3280,2,4,5,12,5,0,12,6,0
Converting to forward existential form...Done !
original formula: EG(AF((p41==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p41==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002447,3596,1,0,6,19,22,2,47,13,6
FORMULA DLCflexbar-PT-3a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Graph (trivial) has 385 edges and 257 vertex of which 200 / 257 are part of one of the 35 SCC in 1 ms
Free SCC test removed 165 places
Ensure Unique test removed 350 transitions
Reduce isomorphic transitions removed 350 transitions.
Graph (complete) has 129 edges and 92 vertex of which 43 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.0 ms
Discarding 49 places :
Also discarding 0 output transitions
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 34 place count 11 transition count 9
Iterating global reduction 0 with 32 rules applied. Total rules applied 66 place count 11 transition count 9
Applied a total of 66 rules in 3 ms. Remains 11 /257 variables (removed 246) and now considering 9/391 (removed 382) transitions.
[2024-05-21 13:48:58] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
// Phase 1: matrix 6 rows 11 cols
[2024-05-21 13:48:58] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 13:48:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 13:48:58] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-05-21 13:48:58] [INFO ] Invariant cache hit.
[2024-05-21 13:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:48:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-21 13:48:58] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-21 13:48:58] [INFO ] Flow matrix only has 6 transitions (discarded 3 similar events)
[2024-05-21 13:48:58] [INFO ] Invariant cache hit.
[2024-05-21 13:48:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/16 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/17 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/16 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/17 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 28 constraints, problems are : Problem set: 0 solved, 8 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/257 places, 9/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 300 ms. Remains : 11/257 places, 9/391 transitions.
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:48:59] [INFO ] Input system was already deterministic with 9 transitions.
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality1364194902219763127.gal : 0 ms
[2024-05-21 13:48:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13916048987215486359.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/CTLCardinality1364194902219763127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13916048987215486359.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,0.002345,3328,2,23,5,71,6,0,34,42,0
Converting to forward existential form...Done !
original formula: AG(A(EF(((p376==0)||(p25==1))) U AF((((p115==0)&&((p296==0)||(p275==1)))&&((p270==0)||(p544==1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),!(!(EG(!((((p115==0)&&((p296==0)||(p275==1)))&&((p270==0)||(p544==1)))))))) * !(E(T...370
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.004733,3644,1,0,7,151,23,2,193,80,11
FORMULA DLCflexbar-PT-3a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 257/257 places, 391/391 transitions.
Graph (trivial) has 390 edges and 257 vertex of which 202 / 257 are part of one of the 35 SCC in 1 ms
Free SCC test removed 167 places
Ensure Unique test removed 355 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 124 edges and 90 vertex of which 37 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 0 output transitions
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 36 place count 3 transition count 2
Iterating global reduction 0 with 34 rules applied. Total rules applied 70 place count 3 transition count 2
Applied a total of 70 rules in 3 ms. Remains 3 /257 variables (removed 254) and now considering 2/391 (removed 389) transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-05-21 13:48:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 13:48:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-21 13:48:59] [INFO ] Invariant cache hit.
[2024-05-21 13:48:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 13:48:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-21 13:48:59] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-21 13:48:59] [INFO ] Invariant cache hit.
[2024-05-21 13:48:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 82ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3/257 places, 2/391 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 127 ms. Remains : 3/257 places, 2/391 transitions.
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 1 ms
[2024-05-21 13:48:59] [INFO ] Input system was already deterministic with 2 transitions.
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 0 ms
[2024-05-21 13:48:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality1745693990906686029.gal : 1 ms
[2024-05-21 13:48:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality4598883000433760348.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/CTLCardinality1745693990906686029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4598883000433760348.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2,0.001471,3276,2,6,5,16,6,0,10,8,0
Converting to forward existential form...Done !
original formula: AF(AG((p527==0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p527==0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002284,3592,1,0,6,22,19,1,48,14,11
FORMULA DLCflexbar-PT-3a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 9 ms
[2024-05-21 13:48:59] [INFO ] Flatten gal took : 9 ms
Total runtime 292172 ms.
BK_STOP 1716299339310
--------------------
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="DLCflexbar-PT-3a"
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 DLCflexbar-PT-3a, 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 r114-smll-171624275100017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCflexbar-PT-3a.tgz
mv DLCflexbar-PT-3a 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 '
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 ;