Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067200322.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DLCshifumi-PT-4a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067200322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.9M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2023-12
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2023-13
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2023-14
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2023-15
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-00
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-01
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-02
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-03
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-04
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-05
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-06
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-07
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-08
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-09
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-10
FORMULA_NAME DLCshifumi-PT-4a-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748694601028

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-4a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-31 12:30:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 12:30:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 12:30:02] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2025-05-31 12:30:02] [INFO ] Transformed 1178 places.
[2025-05-31 12:30:02] [INFO ] Transformed 7504 transitions.
[2025-05-31 12:30:02] [INFO ] Found NUPN structural information;
[2025-05-31 12:30:02] [INFO ] Parsed PT model containing 1178 places and 7504 transitions and 28610 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 924 transitions
Reduce redundant transitions removed 924 transitions.
Support contains 196 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 6580/6580 transitions.
Discarding 137 places :
Symmetric choice reduction at 0 with 137 rule applications. Total rules 137 place count 1041 transition count 5820
Iterating global reduction 0 with 137 rules applied. Total rules applied 274 place count 1041 transition count 5820
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 340 place count 1041 transition count 5754
Drop transitions (Redundant composition of simpler transitions.) removed 2082 transitions
Redundant transition composition rules discarded 2082 transitions
Iterating global reduction 1 with 2082 rules applied. Total rules applied 2422 place count 1041 transition count 3672
Applied a total of 2422 rules in 420 ms. Remains 1041 /1178 variables (removed 137) and now considering 3672/6580 (removed 2908) transitions.
[2025-05-31 12:30:03] [INFO ] Flow matrix only has 613 transitions (discarded 3059 similar events)
// Phase 1: matrix 613 rows 1041 cols
[2025-05-31 12:30:03] [INFO ] Computed 691 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:30:07] [INFO ] Implicit Places using invariants in 3867 ms returned [429, 430, 433, 434, 435, 436, 437, 438, 439, 440, 441, 443, 444, 445, 446, 447, 451, 452, 453, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 467, 468, 469, 471, 472, 473, 474, 475, 476, 479, 480, 481, 482, 483, 484, 485, 487, 489, 490, 491, 492, 493, 494, 495, 496, 497, 499, 501, 502, 503, 505, 507, 508, 509, 510, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 525, 527, 529, 530, 531, 532, 533, 535, 536, 537, 539, 540, 542, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 558, 559, 561, 562, 563, 564, 565, 566, 567, 570, 571, 572, 573, 575, 576, 577, 579, 580, 583, 584, 585, 587, 589, 590, 592, 593, 595, 596, 597, 598, 599, 600, 601, 603, 604, 605, 606, 610, 611, 613, 614, 615, 616, 617, 618, 619, 620, 621, 623, 624, 626, 627, 628, 629, 630, 631, 632, 633, 635, 636, 637, 638, 639, 640, 641, 642, 643, 645, 647, 648, 651, 652, 653, 654, 655, 657, 658, 659, 660, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 675, 676, 677, 679, 680, 681, 682, 683, 685, 686, 687, 688, 689, 690, 691, 693, 694, 695, 696, 698, 699, 701, 703, 704, 705, 707, 708, 709, 710, 712, 713, 715, 716, 717, 718, 719, 720, 721, 722, 723, 725, 727, 728, 729, 731, 733, 734, 735, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 755, 756, 757, 758, 759, 760, 761, 762, 763, 765, 766, 768, 769, 770, 772, 773, 774, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 814, 815, 816, 817, 818, 819, 820, 821, 823, 825, 826, 827, 828, 829, 831, 832, 833, 834, 835, 837, 838, 839, 840, 841, 842, 843, 845, 846, 847, 848, 849, 850, 851, 852, 853, 855, 856, 857, 858, 859, 861, 863, 864, 865, 867, 869, 870, 871, 872, 873, 875, 876, 877, 878, 879, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 901, 902, 903, 904, 905, 907, 908, 909, 910, 911, 913, 917, 918, 919, 920, 921, 922, 923, 925, 927, 928, 929, 930, 932, 933, 934, 935, 937, 938, 939, 940, 941, 943, 944, 945, 946, 949, 950, 951, 952, 953, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 971, 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 999, 1000, 1001, 1002, 1003, 1004, 1005, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1027, 1028, 1029, 1030, 1032, 1034, 1036, 1039]
Discarding 496 places :
Ensure Unique test removed 2155 transitions
Reduce isomorphic transitions removed 2155 transitions.
Implicit Place search using SMT only with invariants took 3948 ms to find 496 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 545/1178 places, 1517/6580 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 718 transitions
Redundant transition composition rules discarded 718 transitions
Iterating global reduction 0 with 718 rules applied. Total rules applied 718 place count 545 transition count 799
Applied a total of 718 rules in 23 ms. Remains 545 /545 variables (removed 0) and now considering 799/1517 (removed 718) transitions.
[2025-05-31 12:30:07] [INFO ] Flow matrix only has 613 transitions (discarded 186 similar events)
// Phase 1: matrix 613 rows 545 cols
[2025-05-31 12:30:07] [INFO ] Computed 195 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:30:07] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-31 12:30:07] [INFO ] Flow matrix only has 613 transitions (discarded 186 similar events)
[2025-05-31 12:30:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:30:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:30:07] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 545/1178 places, 799/6580 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4800 ms. Remains : 545/1178 places, 799/6580 transitions.
Support contains 196 out of 545 places after structural reductions.
[2025-05-31 12:30:07] [INFO ] Flatten gal took : 80 ms
[2025-05-31 12:30:07] [INFO ] Flatten gal took : 39 ms
[2025-05-31 12:30:07] [INFO ] Input system was already deterministic with 799 transitions.
RANDOM walk for 40000 steps (8 resets) in 1712 ms. (23 steps per ms) remains 1/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
[2025-05-31 12:30:08] [INFO ] Flow matrix only has 613 transitions (discarded 186 similar events)
[2025-05-31 12:30:08] [INFO ] Invariant cache hit.
[2025-05-31 12:30:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 506/545 variables, 187/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 612/1157 variables, 545/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1157 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1158 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1158 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/1158 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 741 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 195/195 constraints, State Equation: 545/545 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 506/545 variables, 187/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 612/1157 variables, 545/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1157 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1157 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1158 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1158 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1158 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 742 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 195/195 constraints, State Equation: 545/545 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1062ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 6 ms.
[2025-05-31 12:30:09] [INFO ] Flatten gal took : 32 ms
[2025-05-31 12:30:09] [INFO ] Flatten gal took : 26 ms
[2025-05-31 12:30:09] [INFO ] Input system was already deterministic with 799 transitions.
Computed a total of 117 stabilizing places and 1 stable transitions
Graph (complete) has 993 edges and 545 vertex of which 429 are kept as prefixes of interest. Removing 116 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 438 transition count 799
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 126 place count 419 transition count 761
Iterating global reduction 1 with 19 rules applied. Total rules applied 145 place count 419 transition count 761
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 154 place count 419 transition count 752
Applied a total of 154 rules in 30 ms. Remains 419 /545 variables (removed 126) and now considering 752/799 (removed 47) transitions.
[2025-05-31 12:30:09] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
// Phase 1: matrix 585 rows 419 cols
[2025-05-31 12:30:09] [INFO ] Computed 88 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:30:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-31 12:30:09] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
[2025-05-31 12:30:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:30:10] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 751 sub problems to find dead transitions.
[2025-05-31 12:30:10] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
[2025-05-31 12:30:10] [INFO ] Invariant cache hit.
[2025-05-31 12:30:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 3 (OVERLAPS) 9/419 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1004 variables, and 88 constraints, problems are : Problem set: 0 solved, 751 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 0/419 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 751/751 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 751 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 3 (OVERLAPS) 9/419 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 5 (OVERLAPS) 584/1003 variables, 419/507 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 751/1258 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1004 variables, and 1258 constraints, problems are : Problem set: 0 solved, 751 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 419/419 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 751/751 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 751 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 419/545 places, 752/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60523 ms. Remains : 419/545 places, 752/799 transitions.
[2025-05-31 12:31:10] [INFO ] Flatten gal took : 17 ms
[2025-05-31 12:31:10] [INFO ] Flatten gal took : 27 ms
[2025-05-31 12:31:10] [INFO ] Input system was already deterministic with 752 transitions.
[2025-05-31 12:31:10] [INFO ] Flatten gal took : 18 ms
[2025-05-31 12:31:10] [INFO ] Flatten gal took : 39 ms
[2025-05-31 12:31:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16369271893251105947.gal : 13 ms
[2025-05-31 12:31:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16876641869072259545.ctl : 6 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16369271893251105947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16876641869072259545.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37219e+56,0.197634,7204,2,1168,5,4437,6,0,2235,3021,0


Converting to forward existential form...Done !
original formula: A(EG(EF(((p532==1)&&(p637==1)))) U (!(A(A(EF(((p543==1)&&(p725==1))) U !(((p533==1)&&(p569==1)))) U AF((((p448==1)&&(p534==1))&&(p585==1)...324
=> equivalent forward existential formula: [((Init * !(EG(!((!(!((E(!(!(EG(!((((p448==1)&&(p534==1))&&(p585==1)))))) U (!(!((E(!(!(((p533==1)&&(p569==1))))...1577
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,1.14919,36664,1,0,35,181086,53,22,10517,24581,41
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 437 transition count 799
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 125 place count 420 transition count 765
Iterating global reduction 1 with 17 rules applied. Total rules applied 142 place count 420 transition count 765
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 150 place count 420 transition count 757
Applied a total of 150 rules in 16 ms. Remains 420 /545 variables (removed 125) and now considering 757/799 (removed 42) transitions.
[2025-05-31 12:31:11] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
// Phase 1: matrix 588 rows 420 cols
[2025-05-31 12:31:11] [INFO ] Computed 87 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:31:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-31 12:31:11] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
[2025-05-31 12:31:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:31:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:31:11] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 756 sub problems to find dead transitions.
[2025-05-31 12:31:11] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
[2025-05-31 12:31:11] [INFO ] Invariant cache hit.
[2025-05-31 12:31:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 3 (OVERLAPS) 8/420 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1008 variables, and 87 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 0/420 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 3 (OVERLAPS) 8/420 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (OVERLAPS) 587/1007 variables, 420/507 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 756/1263 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1008 variables, and 1263 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 420/420 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 420/545 places, 757/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60485 ms. Remains : 420/545 places, 757/799 transitions.
[2025-05-31 12:32:12] [INFO ] Flatten gal took : 14 ms
[2025-05-31 12:32:12] [INFO ] Flatten gal took : 29 ms
[2025-05-31 12:32:12] [INFO ] Input system was already deterministic with 757 transitions.
[2025-05-31 12:32:12] [INFO ] Flatten gal took : 12 ms
[2025-05-31 12:32:12] [INFO ] Flatten gal took : 12 ms
[2025-05-31 12:32:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6509773834993480028.gal : 5 ms
[2025-05-31 12:32:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16477971636572902600.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6509773834993480028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16477971636572902600.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95156e+56,0.1912,7392,2,1172,5,4464,6,0,2245,3038,0


Converting to forward existential form...Done !
original formula: (EX((EX(((AF(((p548==1)&&(p981==1))) * (((p544==1)&&(p746==1))||((p533==1)&&(p643==1)))) * ((p77==1)&&(p587==1)))) * EG(EF(((p551==0)||(p...252
=> equivalent forward existential formula: ([FwdG((EY(Init) * EX(((!(EG(!(((p548==1)&&(p981==1))))) * (((p544==1)&&(p746==1))||((p533==1)&&(p643==1)))) * (...455
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 749/0/8
(forward)formula 0,0,1.08246,37040,1,0,18,173349,39,6,10048,12898,19
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 442 transition count 799
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 121 place count 424 transition count 763
Iterating global reduction 1 with 18 rules applied. Total rules applied 139 place count 424 transition count 763
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 147 place count 424 transition count 755
Applied a total of 147 rules in 16 ms. Remains 424 /545 variables (removed 121) and now considering 755/799 (removed 44) transitions.
[2025-05-31 12:32:13] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
// Phase 1: matrix 587 rows 424 cols
[2025-05-31 12:32:13] [INFO ] Computed 92 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:32:13] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-31 12:32:13] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
[2025-05-31 12:32:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:32:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:32:13] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2025-05-31 12:32:13] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
[2025-05-31 12:32:13] [INFO ] Invariant cache hit.
[2025-05-31 12:32:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 13/424 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/1011 variables, and 92 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, State Equation: 0/424 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 13/424 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 586/1010 variables, 424/516 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 754/1270 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1011 variables, and 1270 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 92/92 constraints, State Equation: 424/424 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 424/545 places, 755/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60433 ms. Remains : 424/545 places, 755/799 transitions.
[2025-05-31 12:33:13] [INFO ] Flatten gal took : 13 ms
[2025-05-31 12:33:13] [INFO ] Flatten gal took : 13 ms
[2025-05-31 12:33:13] [INFO ] Input system was already deterministic with 755 transitions.
[2025-05-31 12:33:13] [INFO ] Flatten gal took : 12 ms
[2025-05-31 12:33:13] [INFO ] Flatten gal took : 12 ms
[2025-05-31 12:33:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1244680882851070275.gal : 3 ms
[2025-05-31 12:33:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2230768383143732129.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1244680882851070275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2230768383143732129.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64663e+56,0.197791,7392,2,1179,5,4478,6,0,2245,3046,0


Converting to forward existential form...Done !
original formula: E((!((((p434==1) + AX(E(((p533==1)&&(p591==1)) U ((p554==1)&&(p1005==1))))) + AF(!((((p366==1)&&(p552==1))&&(p949==1)))))) + E((AF(EG(((p...498
=> equivalent forward existential formula: ([(EY(FwdU(Init,(!((((p434==1) + !(EX(!(E(((p533==1)&&(p591==1)) U ((p554==1)&&(p1005==1))))))) + !(EG(!(!((((p3...1418
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 753/0/2
Hit Full ! (commute/partial/dont) 751/4/4
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 753/0/2
(forward)formula 0,1,1.46784,43336,1,0,49,211525,83,27,11524,65433,46
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 437 transition count 799
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 127 place count 418 transition count 761
Iterating global reduction 1 with 19 rules applied. Total rules applied 146 place count 418 transition count 761
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 155 place count 418 transition count 752
Applied a total of 155 rules in 10 ms. Remains 418 /545 variables (removed 127) and now considering 752/799 (removed 47) transitions.
[2025-05-31 12:33:15] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
// Phase 1: matrix 585 rows 418 cols
[2025-05-31 12:33:15] [INFO ] Computed 87 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:33:15] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-31 12:33:15] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
[2025-05-31 12:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:33:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:33:15] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 751 sub problems to find dead transitions.
[2025-05-31 12:33:15] [INFO ] Flow matrix only has 585 transitions (discarded 167 similar events)
[2025-05-31 12:33:15] [INFO ] Invariant cache hit.
[2025-05-31 12:33:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 3 (OVERLAPS) 8/418 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1003 variables, and 87 constraints, problems are : Problem set: 0 solved, 751 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 0/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 751/751 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 751 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 3 (OVERLAPS) 8/418 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 5 (OVERLAPS) 584/1002 variables, 418/505 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 751/1256 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1002/1003 variables, and 1256 constraints, problems are : Problem set: 0 solved, 751 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 418/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 751/751 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 751 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 418/545 places, 752/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60399 ms. Remains : 418/545 places, 752/799 transitions.
[2025-05-31 12:34:15] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:34:15] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:34:15] [INFO ] Input system was already deterministic with 752 transitions.
[2025-05-31 12:34:15] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:34:15] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:34:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13517047371937436903.gal : 2 ms
[2025-05-31 12:34:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17126569216822828787.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13517047371937436903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17126569216822828787.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37219e+56,0.16611,7244,2,1166,5,4431,6,0,2234,3018,0


Converting to forward existential form...Done !
original formula: ((AF(((p558==0)||(p1037==0))) + !(A((AX(((p526==1)&&(p711==1))) + A(((p533==1)&&(p697==1)) U (((p416==1)&&(p210==1))&&(p625==1)))) U AX(!...287
=> equivalent forward existential formula: ([FwdG((Init * !(!(!((E(!(!(EX(!(!(((p534==1)&&(p678==1))))))) U (!((!(EX(!(((p526==1)&&(p711==1))))) + !((E(!((...576
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 743/0/9
Using saturation style SCC detection
(forward)formula 0,1,1.02973,36788,1,0,21,178261,50,10,10516,18021,29
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Graph (trivial) has 793 edges and 545 vertex of which 422 / 545 are part of one of the 79 SCC in 2 ms
Free SCC test removed 343 places
Ensure Unique test removed 705 transitions
Reduce isomorphic transitions removed 705 transitions.
Graph (complete) has 288 edges and 202 vertex of which 87 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.1 ms
Discarding 115 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 87 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 86 transition count 93
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 82 place count 8 transition count 14
Iterating global reduction 2 with 78 rules applied. Total rules applied 160 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 8 transition count 12
Applied a total of 162 rules in 15 ms. Remains 8 /545 variables (removed 537) and now considering 12/799 (removed 787) transitions.
[2025-05-31 12:34:16] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
// Phase 1: matrix 8 rows 8 cols
[2025-05-31 12:34:16] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:34:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-31 12:34:16] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
[2025-05-31 12:34:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:34:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:34:16] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 12:34:16] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2025-05-31 12:34:16] [INFO ] Flow matrix only has 8 transitions (discarded 4 similar events)
[2025-05-31 12:34:16] [INFO ] Invariant cache hit.
[2025-05-31 12:34:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 11 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 23 constraints, problems are : Problem set: 0 solved, 11 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 287ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/545 places, 12/799 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 346 ms. Remains : 8/545 places, 12/799 transitions.
[2025-05-31 12:34:17] [INFO ] Flatten gal took : 1 ms
[2025-05-31 12:34:17] [INFO ] Flatten gal took : 0 ms
[2025-05-31 12:34:17] [INFO ] Input system was already deterministic with 12 transitions.
[2025-05-31 12:34:17] [INFO ] Flatten gal took : 0 ms
[2025-05-31 12:34:17] [INFO ] Flatten gal took : 1 ms
[2025-05-31 12:34:17] [INFO ] Time to serialize gal into /tmp/CTLFireability13764445168790286367.gal : 0 ms
[2025-05-31 12:34:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12448379523446258949.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13764445168790286367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12448379523446258949.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6,0.002839,3788,2,20,5,61,6,0,36,39,0


Converting to forward existential form...Done !
original formula: EG(((p540==0)||(p793==0)))
=> equivalent forward existential formula: [FwdG(Init,((p540==0)||(p793==0)))] != FALSE
Hit Full ! (commute/partial/dont) 8/0/4
(forward)formula 0,1,0.004511,3916,1,0,8,159,19,1,174,104,9
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 453 transition count 799
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 107 place count 438 transition count 769
Iterating global reduction 1 with 15 rules applied. Total rules applied 122 place count 438 transition count 769
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 130 place count 438 transition count 761
Applied a total of 130 rules in 11 ms. Remains 438 /545 variables (removed 107) and now considering 761/799 (removed 38) transitions.
[2025-05-31 12:34:17] [INFO ] Flow matrix only has 590 transitions (discarded 171 similar events)
// Phase 1: matrix 590 rows 438 cols
[2025-05-31 12:34:17] [INFO ] Computed 103 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:34:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 12:34:17] [INFO ] Flow matrix only has 590 transitions (discarded 171 similar events)
[2025-05-31 12:34:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:34:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:34:17] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 760 sub problems to find dead transitions.
[2025-05-31 12:34:17] [INFO ] Flow matrix only has 590 transitions (discarded 171 similar events)
[2025-05-31 12:34:17] [INFO ] Invariant cache hit.
[2025-05-31 12:34:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (OVERLAPS) 1/414 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (OVERLAPS) 24/438 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/1028 variables, and 103 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 0/438 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (OVERLAPS) 1/414 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (OVERLAPS) 24/438 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 5 (OVERLAPS) 589/1027 variables, 438/541 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1027 variables, 760/1301 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1027/1028 variables, and 1301 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 103/103 constraints, State Equation: 438/438 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 438/545 places, 761/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60405 ms. Remains : 438/545 places, 761/799 transitions.
[2025-05-31 12:35:17] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:35:17] [INFO ] Flatten gal took : 12 ms
[2025-05-31 12:35:17] [INFO ] Input system was already deterministic with 761 transitions.
[2025-05-31 12:35:17] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:35:17] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:35:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17691094647090816756.gal : 2 ms
[2025-05-31 12:35:17] [INFO ] Time to serialize properties into /tmp/CTLFireability3507435214651381224.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17691094647090816756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3507435214651381224.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.43945e+56,0.180263,7352,2,1210,5,4589,6,0,2271,3104,0


Converting to forward existential form...Done !
original formula: A(E(((EX(AX(((p533==1)&&(p675==1)))) + (EG(AF(((p534==1)&&(p715==1)))) * (p4==1))) + ((p433!=1) * (AF(((p126==1)&&(p901==1))) + ((p34==1)...799
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!(E(((p118==1)||((p238==1)&&(p933==1))) U ((((p564==1)&&(p1084==1))&&((p550==1)&&(p961==1...1764
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 752/0/9
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 757/4/4
Using saturation style SCC detection
(forward)formula 0,1,2.14355,70568,1,0,66,338355,81,41,11452,287738,66
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 109 places and 0 transitions.
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 436 transition count 799
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 127 place count 418 transition count 763
Iterating global reduction 1 with 18 rules applied. Total rules applied 145 place count 418 transition count 763
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 153 place count 418 transition count 755
Applied a total of 153 rules in 17 ms. Remains 418 /545 variables (removed 127) and now considering 755/799 (removed 44) transitions.
[2025-05-31 12:35:19] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
// Phase 1: matrix 587 rows 418 cols
[2025-05-31 12:35:19] [INFO ] Computed 86 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:35:20] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 12:35:20] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
[2025-05-31 12:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:35:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:35:20] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2025-05-31 12:35:20] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
[2025-05-31 12:35:20] [INFO ] Invariant cache hit.
[2025-05-31 12:35:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 7/418 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1005 variables, and 86 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 0/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 7/418 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 586/1004 variables, 418/504 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1004 variables, 754/1258 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1005 variables, and 1258 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 86/86 constraints, State Equation: 418/418 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 418/545 places, 755/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60418 ms. Remains : 418/545 places, 755/799 transitions.
[2025-05-31 12:36:20] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:36:20] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:36:20] [INFO ] Input system was already deterministic with 755 transitions.
[2025-05-31 12:36:20] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:36:20] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:36:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14572935415298966032.gal : 2 ms
[2025-05-31 12:36:20] [INFO ] Time to serialize properties into /tmp/CTLFireability14131276584746544240.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14572935415298966032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14131276584746544240.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64663e+56,0.164714,7380,2,1167,5,4442,6,0,2239,3028,0


Converting to forward existential form...Done !
original formula: AG(((EF((p304==0)) + AG(((p398==0)||(p227==0)))) + (((p564==1)&&(p1124==1)) * (EX(((((p539==1)&&(p745==1))||((p289==1)&&(p798==1))) * A((...258
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((((p564==1)&&(p1124==1)) * (EX(((((p539==1)&&(p745==1))||((p289==1)&&(p798==1))) * ...404
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.884452,33632,1,0,9,165316,16,1,9394,5869,6
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 447 transition count 799
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 113 place count 432 transition count 769
Iterating global reduction 1 with 15 rules applied. Total rules applied 128 place count 432 transition count 769
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 133 place count 432 transition count 764
Applied a total of 133 rules in 17 ms. Remains 432 /545 variables (removed 113) and now considering 764/799 (removed 35) transitions.
[2025-05-31 12:36:21] [INFO ] Flow matrix only has 593 transitions (discarded 171 similar events)
// Phase 1: matrix 593 rows 432 cols
[2025-05-31 12:36:21] [INFO ] Computed 97 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:36:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-31 12:36:21] [INFO ] Flow matrix only has 593 transitions (discarded 171 similar events)
[2025-05-31 12:36:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:36:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:36:21] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 763 sub problems to find dead transitions.
[2025-05-31 12:36:21] [INFO ] Flow matrix only has 593 transitions (discarded 171 similar events)
[2025-05-31 12:36:21] [INFO ] Invariant cache hit.
[2025-05-31 12:36:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (OVERLAPS) 1/414 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 3 (OVERLAPS) 18/432 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/1025 variables, and 97 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 0/432 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 763/763 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 763 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (OVERLAPS) 1/414 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 3 (OVERLAPS) 18/432 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 5 (OVERLAPS) 592/1024 variables, 432/529 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1024 variables, 763/1292 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1025 variables, and 1292 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 97/97 constraints, State Equation: 432/432 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 763/763 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 763 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 432/545 places, 764/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60411 ms. Remains : 432/545 places, 764/799 transitions.
[2025-05-31 12:37:21] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:37:21] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:37:21] [INFO ] Input system was already deterministic with 764 transitions.
[2025-05-31 12:37:21] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:37:21] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:37:21] [INFO ] Time to serialize gal into /tmp/CTLFireability85091787757163493.gal : 2 ms
[2025-05-31 12:37:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2512740593119444117.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability85091787757163493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2512740593119444117.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.84538e+56,0.175178,7356,2,1198,5,4556,6,0,2268,3089,0


Converting to forward existential form...Done !
original formula: ((AG(AX((((((p448==0)||(p693==0)) * AG(((p560==1)&&(p1177==1)))) * ((p528==1)&&(p661==1))) * (p402==1)))) * AX(((p91==0)||(p891==0)))) + ...663
=> equivalent forward existential formula: ([((Init * !((!(E(TRUE U !(!(EX(!((((((p448==0)||(p693==0)) * !(E(TRUE U !(((p560==1)&&(p1177==1)))))) * ((p528=...1955
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 761/0/3
Hit Full ! (commute/partial/dont) 757/6/7
(forward)formula 0,1,1.60901,48944,1,0,51,251186,89,26,10488,111278,52
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 440 transition count 799
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 123 place count 422 transition count 763
Iterating global reduction 1 with 18 rules applied. Total rules applied 141 place count 422 transition count 763
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 149 place count 422 transition count 755
Applied a total of 149 rules in 16 ms. Remains 422 /545 variables (removed 123) and now considering 755/799 (removed 44) transitions.
[2025-05-31 12:37:23] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
// Phase 1: matrix 587 rows 422 cols
[2025-05-31 12:37:23] [INFO ] Computed 90 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:37:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-31 12:37:23] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
[2025-05-31 12:37:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:37:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:37:23] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2025-05-31 12:37:23] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
[2025-05-31 12:37:23] [INFO ] Invariant cache hit.
[2025-05-31 12:37:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 11/422 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1009 variables, and 90 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 0/422 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 11/422 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 586/1008 variables, 422/512 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 754/1266 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/1009 variables, and 1266 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 422/422 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 422/545 places, 755/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60407 ms. Remains : 422/545 places, 755/799 transitions.
[2025-05-31 12:38:23] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:38:23] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:38:23] [INFO ] Input system was already deterministic with 755 transitions.
[2025-05-31 12:38:23] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:38:23] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15475571975533129265.gal : 2 ms
[2025-05-31 12:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1209633024280195519.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15475571975533129265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1209633024280195519.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64663e+56,0.171156,7260,2,1175,5,4467,6,0,2243,3043,0


Converting to forward existential form...Done !
original formula: AX((EG(EX(((EX(((p541==1)&&(p815==1))) + ((p296==1)&&(p950==1))) + ((p534==1)&&(p614==1))))) + A(((p554==1)&&(p999==1)) U ((AX(((p540==1)...334
=> equivalent forward existential formula: [((EY(Init) * !(!((E(!(((!(EX(!(((p540==1)&&(p1170==1))))) * (((((p559==1)&&(p1049==1))&&((p541==1)&&(p759==1)))...813
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,1.06431,36488,1,0,21,174818,30,6,10559,14933,21
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 435 transition count 799
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 128 place count 417 transition count 763
Iterating global reduction 1 with 18 rules applied. Total rules applied 146 place count 417 transition count 763
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 154 place count 417 transition count 755
Applied a total of 154 rules in 13 ms. Remains 417 /545 variables (removed 128) and now considering 755/799 (removed 44) transitions.
[2025-05-31 12:38:25] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
// Phase 1: matrix 587 rows 417 cols
[2025-05-31 12:38:25] [INFO ] Computed 85 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:38:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-31 12:38:25] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
[2025-05-31 12:38:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:38:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:38:25] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2025-05-31 12:38:25] [INFO ] Flow matrix only has 587 transitions (discarded 168 similar events)
[2025-05-31 12:38:25] [INFO ] Invariant cache hit.
[2025-05-31 12:38:25] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 6/417 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/1004 variables, and 85 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 0/417 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 6/417 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 586/1003 variables, 417/502 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1003 variables, 754/1256 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1004 variables, and 1256 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 85/85 constraints, State Equation: 417/417 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 417/545 places, 755/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60379 ms. Remains : 417/545 places, 755/799 transitions.
[2025-05-31 12:39:25] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:39:25] [INFO ] Flatten gal took : 13 ms
[2025-05-31 12:39:25] [INFO ] Input system was already deterministic with 755 transitions.
[2025-05-31 12:39:25] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:39:25] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:39:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8881947703526940839.gal : 2 ms
[2025-05-31 12:39:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10300546235722492627.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8881947703526940839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10300546235722492627.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64663e+56,0.171382,7256,2,1165,5,4435,6,0,2238,3022,0


Converting to forward existential form...Done !
original formula: AF(((((p558==1)&&(p1143==1)) * (((p560==0)||(p1017==0)) * (AX(((p538==1)&&(p821==1))) + AG(((p378==1)&&(p973==1)))))) + (((p100==1)&&(p74...193
=> equivalent forward existential formula: [FwdG(Init,!(((((p558==1)&&(p1143==1)) * (((p560==0)||(p1017==0)) * (!(EX(!(((p538==1)&&(p821==1))))) + !(E(TRUE...256
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,5.5393,179672,1,0,497,648103,27,330,9825,1.36897e+06,343
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Graph (trivial) has 792 edges and 545 vertex of which 423 / 545 are part of one of the 78 SCC in 4 ms
Free SCC test removed 345 places
Ensure Unique test removed 711 transitions
Reduce isomorphic transitions removed 711 transitions.
Graph (complete) has 282 edges and 200 vertex of which 85 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.1 ms
Discarding 115 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 85 transition count 86
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 83 transition count 85
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 84 place count 6 transition count 8
Iterating global reduction 2 with 77 rules applied. Total rules applied 161 place count 6 transition count 8
Applied a total of 161 rules in 14 ms. Remains 6 /545 variables (removed 539) and now considering 8/799 (removed 791) transitions.
[2025-05-31 12:39:31] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 6 cols
[2025-05-31 12:39:31] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:39:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 12:39:31] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-05-31 12:39:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:39:31] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 12:39:31] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-05-31 12:39:31] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-05-31 12:39:31] [INFO ] Invariant cache hit.
[2025-05-31 12:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 7 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/12 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/545 places, 8/799 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 206 ms. Remains : 6/545 places, 8/799 transitions.
[2025-05-31 12:39:31] [INFO ] Flatten gal took : 0 ms
[2025-05-31 12:39:31] [INFO ] Flatten gal took : 1 ms
[2025-05-31 12:39:31] [INFO ] Input system was already deterministic with 8 transitions.
[2025-05-31 12:39:31] [INFO ] Flatten gal took : 0 ms
[2025-05-31 12:39:31] [INFO ] Flatten gal took : 0 ms
[2025-05-31 12:39:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4953979494165715800.gal : 0 ms
[2025-05-31 12:39:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2860714849314909534.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4953979494165715800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2860714849314909534.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4,0.00212,3660,2,12,5,39,6,0,26,24,0


Converting to forward existential form...Done !
original formula: EF(AG(((p448==1)&&(p843==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p448==1)&&(p843==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.003343,3916,1,0,6,81,15,0,113,52,5
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-10 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 : 545/545 places, 799/799 transitions.
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 438 transition count 799
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 124 place count 421 transition count 765
Iterating global reduction 1 with 17 rules applied. Total rules applied 141 place count 421 transition count 765
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 149 place count 421 transition count 757
Applied a total of 149 rules in 11 ms. Remains 421 /545 variables (removed 124) and now considering 757/799 (removed 42) transitions.
[2025-05-31 12:39:31] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
// Phase 1: matrix 588 rows 421 cols
[2025-05-31 12:39:31] [INFO ] Computed 88 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:39:31] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-31 12:39:31] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
[2025-05-31 12:39:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:39:31] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 756 sub problems to find dead transitions.
[2025-05-31 12:39:31] [INFO ] Flow matrix only has 588 transitions (discarded 169 similar events)
[2025-05-31 12:39:31] [INFO ] Invariant cache hit.
[2025-05-31 12:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 3 (OVERLAPS) 9/421 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1009 variables, and 88 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 0/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 3 (OVERLAPS) 9/421 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 5 (OVERLAPS) 587/1008 variables, 421/509 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1008 variables, 756/1265 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1008/1009 variables, and 1265 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 421/421 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 421/545 places, 757/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60392 ms. Remains : 421/545 places, 757/799 transitions.
[2025-05-31 12:40:31] [INFO ] Flatten gal took : 15 ms
[2025-05-31 12:40:31] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:40:31] [INFO ] Input system was already deterministic with 757 transitions.
[2025-05-31 12:40:31] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:40:31] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5971935354289359343.gal : 2 ms
[2025-05-31 12:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12847919002830897396.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5971935354289359343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12847919002830897396.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.85246e+56,0.1649,7272,2,1174,5,4469,6,0,2246,3045,0


Converting to forward existential form...Done !
original formula: A((EX(A(((!((p541==1)&&(p739==1)))||(((p543==1)&&(p839==1))&&((p545==1)&&(p843==1)))) U !(((p559==1)&&(p1063==1))))) * E(((p542==1)&&(p78...285
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(EX(!(E(!(((p534==1)&&(p680==1))) U (((p552==1)&&(p867==1))||((p86==1)&&(p890==1)))))))...663
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 746/0/11
Hit Full ! (commute/partial/dont) 754/3/3
Hit Full ! (commute/partial/dont) 753/4/4
Using saturation style SCC detection
(forward)formula 0,0,1.12653,36952,1,0,19,174769,50,4,10712,14140,24
FORMULA DLCshifumi-PT-4a-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 432 transition count 799
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 133 place count 412 transition count 759
Iterating global reduction 1 with 20 rules applied. Total rules applied 153 place count 412 transition count 759
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 162 place count 412 transition count 750
Applied a total of 162 rules in 8 ms. Remains 412 /545 variables (removed 133) and now considering 750/799 (removed 49) transitions.
[2025-05-31 12:40:32] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
// Phase 1: matrix 584 rows 412 cols
[2025-05-31 12:40:32] [INFO ] Computed 82 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:40:32] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 12:40:32] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2025-05-31 12:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:40:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:40:33] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 749 sub problems to find dead transitions.
[2025-05-31 12:40:33] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2025-05-31 12:40:33] [INFO ] Invariant cache hit.
[2025-05-31 12:40:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 3/412 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/996 variables, and 82 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 3/412 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 583/995 variables, 412/494 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/995 variables, 749/1243 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 995/996 variables, and 1243 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 412/412 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 412/545 places, 750/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60363 ms. Remains : 412/545 places, 750/799 transitions.
[2025-05-31 12:41:33] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:41:33] [INFO ] Flatten gal took : 10 ms
[2025-05-31 12:41:33] [INFO ] Input system was already deterministic with 750 transitions.
[2025-05-31 12:41:33] [INFO ] Flatten gal took : 8 ms
[2025-05-31 12:41:33] [INFO ] Flatten gal took : 18 ms
[2025-05-31 12:41:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8921104699585728784.gal : 1 ms
[2025-05-31 12:41:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4132637561991328946.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8921104699585728784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4132637561991328946.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30104e+56,0.167434,7232,2,1153,5,4388,6,0,2224,2994,0


Converting to forward existential form...Done !
original formula: AG(E(A(AX((p208!=1)) U !((EF(((p564==1)&&(p1061==1))) * AG(((p186==1)&&(p1068==1)))))) U AX(((p533==1)&&(p641==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!((E(!(!((E(TRUE U ((p564==1)&&(p1061==1))) * !(E(TRUE U !(((p186==1)&&(p1068==1))))))))...408
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.00066,34420,1,0,8,162491,27,0,9738,6331,10
FORMULA DLCshifumi-PT-4a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 433 transition count 799
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 131 place count 414 transition count 761
Iterating global reduction 1 with 19 rules applied. Total rules applied 150 place count 414 transition count 761
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 158 place count 414 transition count 753
Applied a total of 158 rules in 8 ms. Remains 414 /545 variables (removed 131) and now considering 753/799 (removed 46) transitions.
[2025-05-31 12:41:34] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
// Phase 1: matrix 586 rows 414 cols
[2025-05-31 12:41:34] [INFO ] Computed 83 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:41:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-31 12:41:34] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
[2025-05-31 12:41:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:41:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:41:34] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 752 sub problems to find dead transitions.
[2025-05-31 12:41:34] [INFO ] Flow matrix only has 586 transitions (discarded 167 similar events)
[2025-05-31 12:41:34] [INFO ] Invariant cache hit.
[2025-05-31 12:41:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 3 (OVERLAPS) 4/414 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1000 variables, and 83 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 752 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (OVERLAPS) 1/410 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 3 (OVERLAPS) 4/414 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 5 (OVERLAPS) 585/999 variables, 414/497 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 752/1249 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1000 variables, and 1249 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, State Equation: 414/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 752 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 414/545 places, 753/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60367 ms. Remains : 414/545 places, 753/799 transitions.
[2025-05-31 12:42:34] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:42:34] [INFO ] Flatten gal took : 8 ms
[2025-05-31 12:42:34] [INFO ] Input system was already deterministic with 753 transitions.
[2025-05-31 12:42:34] [INFO ] Flatten gal took : 8 ms
[2025-05-31 12:42:34] [INFO ] Flatten gal took : 8 ms
[2025-05-31 12:42:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1184761676973298236.gal : 2 ms
[2025-05-31 12:42:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1016610377063031609.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1184761676973298236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1016610377063031609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46367e+56,0.165463,7252,2,1158,5,4410,6,0,2231,3010,0


Converting to forward existential form...Done !
original formula: EF(EG((EF(((p126==1)&&(p1051==1))) + (A(((p231==1)&&(p781==1)) U ((p127==1)&&(p1052==1))) * EX(((p539==1)&&(p771==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(E(TRUE U ((p126==1)&&(p1051==1))) + (!((E(!(((p127==1)&&(p1052==1))) U (!(((p231==1)&&(p7...271
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 749/0/4
(forward)formula 0,1,1.21216,37476,1,0,13,168411,32,3,10965,12877,18
FORMULA DLCshifumi-PT-4a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 430 transition count 799
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 135 place count 410 transition count 759
Iterating global reduction 1 with 20 rules applied. Total rules applied 155 place count 410 transition count 759
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 164 place count 410 transition count 750
Applied a total of 164 rules in 8 ms. Remains 410 /545 variables (removed 135) and now considering 750/799 (removed 49) transitions.
[2025-05-31 12:42:35] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
// Phase 1: matrix 584 rows 410 cols
[2025-05-31 12:42:35] [INFO ] Computed 80 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:42:36] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-31 12:42:36] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2025-05-31 12:42:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:42:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:42:36] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 749 sub problems to find dead transitions.
[2025-05-31 12:42:36] [INFO ] Flow matrix only has 584 transitions (discarded 166 similar events)
[2025-05-31 12:42:36] [INFO ] Invariant cache hit.
[2025-05-31 12:42:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 1/410 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/994 variables, and 80 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 749 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 1 (OVERLAPS) 1/409 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 3 (OVERLAPS) 1/410 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 5 (OVERLAPS) 583/993 variables, 410/490 constraints. Problems are: Problem set: 0 solved, 749 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/993 variables, 749/1239 constraints. Problems are: Problem set: 0 solved, 749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/994 variables, and 1239 constraints, problems are : Problem set: 0 solved, 749 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, State Equation: 410/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 749/749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 749 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 410/545 places, 750/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60385 ms. Remains : 410/545 places, 750/799 transitions.
[2025-05-31 12:43:36] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:43:36] [INFO ] Flatten gal took : 8 ms
[2025-05-31 12:43:36] [INFO ] Input system was already deterministic with 750 transitions.
[2025-05-31 12:43:36] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:43:36] [INFO ] Flatten gal took : 8 ms
[2025-05-31 12:43:36] [INFO ] Time to serialize gal into /tmp/CTLFireability18210745610131173768.gal : 2 ms
[2025-05-31 12:43:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14379292667729150669.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18210745610131173768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14379292667729150669.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21973e+56,0.171294,7228,2,1149,5,4376,6,0,2222,2992,0


Converting to forward existential form...Done !
original formula: EX(EG(EX(AX(((p539==0)||(p851==0))))))
=> equivalent forward existential formula: [FwdG(EY(Init),EX(!(EX(!(((p539==0)||(p851==0)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.05783,107732,1,0,334,422537,17,328,9044,713192,339
FORMULA DLCshifumi-PT-4a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 545/545 places, 799/799 transitions.
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 432 transition count 799
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 134 place count 411 transition count 757
Iterating global reduction 1 with 21 rules applied. Total rules applied 155 place count 411 transition count 757
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 164 place count 411 transition count 748
Applied a total of 164 rules in 13 ms. Remains 411 /545 variables (removed 134) and now considering 748/799 (removed 51) transitions.
[2025-05-31 12:43:39] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
// Phase 1: matrix 583 rows 411 cols
[2025-05-31 12:43:39] [INFO ] Computed 82 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:43:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-31 12:43:39] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
[2025-05-31 12:43:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:43:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 12:43:39] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 747 sub problems to find dead transitions.
[2025-05-31 12:43:39] [INFO ] Flow matrix only has 583 transitions (discarded 165 similar events)
[2025-05-31 12:43:39] [INFO ] Invariant cache hit.
[2025-05-31 12:43:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 1 (OVERLAPS) 1/408 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 3 (OVERLAPS) 3/411 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 747 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 timeout
0.0)
(s158 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/994 variables, and 82 constraints, problems are : Problem set: 0 solved, 747 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 747/747 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 747 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 1 (OVERLAPS) 1/408 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 3 (OVERLAPS) 3/411 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 5 (OVERLAPS) 582/993 variables, 411/493 constraints. Problems are: Problem set: 0 solved, 747 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/993 variables, 747/1240 constraints. Problems are: Problem set: 0 solved, 747 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/994 variables, and 1240 constraints, problems are : Problem set: 0 solved, 747 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 411/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 747/747 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 747 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 411/545 places, 748/799 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60399 ms. Remains : 411/545 places, 748/799 transitions.
[2025-05-31 12:44:39] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:44:39] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:44:39] [INFO ] Input system was already deterministic with 748 transitions.
[2025-05-31 12:44:39] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:44:39] [INFO ] Flatten gal took : 9 ms
[2025-05-31 12:44:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13523360593136941408.gal : 2 ms
[2025-05-31 12:44:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13166735992293221818.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13523360593136941408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13166735992293221818.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0842e+56,0.169264,7228,2,1150,5,4373,6,0,2219,2987,0


Converting to forward existential form...Done !
original formula: AX(AX((AF(AG(((p544==1)&&(p834==1)))) + (((p49==1)&&(p579==1)) * EG(((p563==1)&&(p1135==1)))))))
=> equivalent forward existential formula: [FwdG((EY(EY(Init)) * !((((p49==1)&&(p579==1)) * EG(((p563==1)&&(p1135==1)))))),!(!(E(TRUE U !(((p544==1)&&(p834...174
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.10259,35432,1,0,13,163446,27,4,10367,10157,16
FORMULA DLCshifumi-PT-4a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-05-31 12:44:41] [INFO ] Flatten gal took : 16 ms
[2025-05-31 12:44:41] [INFO ] Flatten gal took : 12 ms
Total runtime 878896 ms.

BK_STOP 1748695481141

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="DLCshifumi-PT-4a"
export BK_EXAMINATION="CTLFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is DLCshifumi-PT-4a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067200322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-4a.tgz
mv DLCshifumi-PT-4a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;