Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028600514.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 CO4-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028600514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 239K 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 CO4-PT-18-CTLFireability-2024-12
FORMULA_NAME CO4-PT-18-CTLFireability-2024-13
FORMULA_NAME CO4-PT-18-CTLFireability-2024-14
FORMULA_NAME CO4-PT-18-CTLFireability-2024-15
FORMULA_NAME CO4-PT-18-CTLFireability-2025-00
FORMULA_NAME CO4-PT-18-CTLFireability-2025-01
FORMULA_NAME CO4-PT-18-CTLFireability-2025-02
FORMULA_NAME CO4-PT-18-CTLFireability-2025-03
FORMULA_NAME CO4-PT-18-CTLFireability-2025-04
FORMULA_NAME CO4-PT-18-CTLFireability-2025-05
FORMULA_NAME CO4-PT-18-CTLFireability-2025-06
FORMULA_NAME CO4-PT-18-CTLFireability-2025-07
FORMULA_NAME CO4-PT-18-CTLFireability-2025-08
FORMULA_NAME CO4-PT-18-CTLFireability-2025-09
FORMULA_NAME CO4-PT-18-CTLFireability-2025-10
FORMULA_NAME CO4-PT-18-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748609500045

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 12:51:41] [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-30 12:51:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:51:41] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-05-30 12:51:41] [INFO ] Transformed 979 places.
[2025-05-30 12:51:41] [INFO ] Transformed 1111 transitions.
[2025-05-30 12:51:41] [INFO ] Found NUPN structural information;
[2025-05-30 12:51:41] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 157 places in 14 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-18-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-CTLFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 136 place count 689 transition count 810
Iterating global reduction 1 with 119 rules applied. Total rules applied 255 place count 689 transition count 810
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 349 place count 595 transition count 716
Iterating global reduction 1 with 94 rules applied. Total rules applied 443 place count 595 transition count 716
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 446 place count 595 transition count 713
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 488 place count 553 transition count 671
Iterating global reduction 2 with 42 rules applied. Total rules applied 530 place count 553 transition count 671
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 531 place count 553 transition count 670
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 560 place count 524 transition count 641
Iterating global reduction 3 with 29 rules applied. Total rules applied 589 place count 524 transition count 641
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 591 place count 524 transition count 639
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 603 place count 512 transition count 627
Iterating global reduction 4 with 12 rules applied. Total rules applied 615 place count 512 transition count 627
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 617 place count 512 transition count 625
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 621 place count 508 transition count 621
Iterating global reduction 5 with 4 rules applied. Total rules applied 625 place count 508 transition count 621
Applied a total of 625 rules in 254 ms. Remains 508 /822 variables (removed 314) and now considering 621/934 (removed 313) transitions.
// Phase 1: matrix 621 rows 508 cols
[2025-05-30 12:51:41] [INFO ] Computed 5 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:42] [INFO ] Implicit Places using invariants in 321 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 354 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 507/822 places, 621/934 transitions.
Applied a total of 0 rules in 27 ms. Remains 507 /507 variables (removed 0) and now considering 621/621 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 650 ms. Remains : 507/822 places, 621/934 transitions.
Support contains 71 out of 507 places after structural reductions.
[2025-05-30 12:51:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:51:42] [INFO ] Flatten gal took : 58 ms
FORMULA CO4-PT-18-CTLFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:51:42] [INFO ] Flatten gal took : 30 ms
[2025-05-30 12:51:42] [INFO ] Input system was already deterministic with 621 transitions.
Support contains 70 out of 507 places (down from 71) after GAL structural reductions.
RANDOM walk for 40000 steps (108 resets) in 1500 ms. (26 steps per ms) remains 38/50 properties
BEST_FIRST walk for 4003 steps (23 resets) in 34 ms. (114 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (19 resets) in 48 ms. (81 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (22 resets) in 12 ms. (307 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (22 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (23 resets) in 51 ms. (77 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (20 resets) in 25 ms. (153 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (23 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (22 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (19 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (20 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (18 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4001 steps (21 resets) in 27 ms. (142 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (23 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (21 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (22 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (19 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (21 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (18 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (24 resets) in 19 ms. (200 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4002 steps (19 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
// Phase 1: matrix 621 rows 507 cols
[2025-05-30 12:51:43] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 152/200 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 412/612 variables, 173/221 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 14/626 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 13/639 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 327/966 variables, 185/410 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 117/1083 variables, 70/480 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1083 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 40/1123 variables, 27/507 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1123 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 15 (OVERLAPS) 5/1128 variables, 4/511 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1128 variables, 0/511 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 0/1128 variables, 0/511 constraints. Problems are: Problem set: 2 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1128/1128 variables, and 511 constraints, problems are : Problem set: 2 solved, 29 unsolved in 4534 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 29 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 143/186 variables, 43/43 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 2/45 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 403/589 variables, 168/213 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 27/240 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/240 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 14/603 variables, 2/242 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/603 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 13/616 variables, 2/244 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/244 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 344/960 variables, 191/435 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/960 variables, 0/435 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 13 (OVERLAPS) 123/1083 variables, 74/509 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1083 variables, 0/509 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 40/1123 variables, 27/536 constraints. Problems are: Problem set: 2 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1123/1128 variables, and 536 constraints, problems are : Problem set: 2 solved, 29 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 503/507 constraints, PredecessorRefiner: 29/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9600ms problems are : Problem set: 2 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 621/621 transitions.
Graph (trivial) has 457 edges and 507 vertex of which 3 / 507 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 767 edges and 505 vertex of which 488 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 208 rules applied. Total rules applied 210 place count 488 transition count 399
Reduce places removed 192 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 404 place count 296 transition count 397
Reduce places removed 1 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 15 rules applied. Total rules applied 419 place count 295 transition count 383
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 433 place count 281 transition count 383
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 433 place count 281 transition count 345
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 509 place count 243 transition count 345
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 511 place count 241 transition count 343
Iterating global reduction 4 with 2 rules applied. Total rules applied 513 place count 241 transition count 343
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 514 place count 240 transition count 342
Iterating global reduction 4 with 1 rules applied. Total rules applied 515 place count 240 transition count 342
Performed 66 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 647 place count 174 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 650 place count 174 transition count 260
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 653 place count 171 transition count 257
Iterating global reduction 5 with 3 rules applied. Total rules applied 656 place count 171 transition count 257
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 714 place count 142 transition count 260
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 728 place count 142 transition count 246
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 741 place count 129 transition count 220
Iterating global reduction 6 with 13 rules applied. Total rules applied 754 place count 129 transition count 220
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 761 place count 129 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 765 place count 129 transition count 209
Free-agglomeration rule applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 775 place count 129 transition count 199
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 786 place count 119 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 787 place count 119 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 796 place count 119 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 798 place count 119 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 799 place count 118 transition count 194
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 8 with 5 rules applied. Total rules applied 804 place count 115 transition count 192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 806 place count 113 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 810 place count 111 transition count 190
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 811 place count 110 transition count 188
Iterating global reduction 10 with 1 rules applied. Total rules applied 812 place count 110 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 813 place count 110 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 820 place count 110 transition count 180
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 822 place count 108 transition count 178
Iterating global reduction 11 with 2 rules applied. Total rules applied 824 place count 108 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 826 place count 108 transition count 176
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 830 place count 108 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 834 place count 104 transition count 172
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 836 place count 104 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 837 place count 104 transition count 171
Applied a total of 837 rules in 163 ms. Remains 104 /507 variables (removed 403) and now considering 171/621 (removed 450) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 104/507 places, 171/621 transitions.
RANDOM walk for 40000 steps (2777 resets) in 441 ms. (90 steps per ms) remains 4/29 properties
BEST_FIRST walk for 40003 steps (409 resets) in 73 ms. (540 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (484 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (493 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (520 resets) in 69 ms. (571 steps per ms) remains 2/3 properties
[2025-05-30 12:51:53] [INFO ] Flow matrix only has 164 transitions (discarded 7 similar events)
// Phase 1: matrix 164 rows 104 cols
[2025-05-30 12:51:53] [INFO ] Computed 1 invariants in 1 ms
[2025-05-30 12:51:53] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/92 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/167 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 87/254 variables, 49/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/268 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/92 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/167 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 87/254 variables, 49/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/268 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 109 constraints, problems are : Problem set: 0 solved, 2 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 38 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Parikh walk visited 2 properties in 9 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2025-05-30 12:51:53] [INFO ] Flatten gal took : 23 ms
[2025-05-30 12:51:53] [INFO ] Flatten gal took : 25 ms
[2025-05-30 12:51:53] [INFO ] Input system was already deterministic with 621 transitions.
Support contains 64 out of 507 places (down from 65) after GAL structural reductions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 770 edges and 507 vertex of which 500 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 476 transition count 590
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 476 transition count 590
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 84 place count 454 transition count 568
Iterating global reduction 0 with 22 rules applied. Total rules applied 106 place count 454 transition count 568
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 444 transition count 558
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 444 transition count 558
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 442 transition count 556
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 442 transition count 556
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 440 transition count 554
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 440 transition count 554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 438 transition count 552
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 438 transition count 552
Applied a total of 138 rules in 59 ms. Remains 438 /507 variables (removed 69) and now considering 552/621 (removed 69) transitions.
// Phase 1: matrix 552 rows 438 cols
[2025-05-30 12:51:53] [INFO ] Computed 4 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-30 12:51:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:51:54] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2025-05-30 12:51:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 552/990 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:52:17] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:52:17] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/990 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 551 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 Real declared 990/990 variables, and 444 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (OVERLAPS) 552/990 variables, 438/444 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/990 variables, 551/995 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/990 variables, and 995 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 438/507 places, 552/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60538 ms. Remains : 438/507 places, 552/621 transitions.
[2025-05-30 12:52:54] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:52:54] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:52:54] [INFO ] Input system was already deterministic with 552 transitions.
[2025-05-30 12:52:54] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:52:54] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:52:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13219736547015876057.gal : 11 ms
[2025-05-30 12:52:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12983495486835783844.ctl : 3 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/CTLFireability13219736547015876057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12983495486835783844.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.51879e+08,1.06832,40960,2,5709,5,115637,6,0,2302,197368,0


Converting to forward existential form...Done !
original formula: EG((AF(EG(EX((p216==1)))) + AX(((A((p369==1) U (p898==1)) * !(A((p575==1) U (p341==1)))) * ((p841==1)&&(p964==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG(EX((p216==1)))))) + !(EX(!(((!((E(!((p898==1)) U (!((p369==1)) * !((p898==1)))) + EG(!((p8...284
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t53, t54, t56, t59, t10...462
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-30 12:53:24] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:53:24] [INFO ] Applying decomposition
[2025-05-30 12:53:24] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10157271109765718886.txt' '-o' '/tmp/graph10157271109765718886.bin' '-w' '/tmp/graph10157271109765718886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10157271109765718886.bin' '-l' '-1' '-v' '-w' '/tmp/graph10157271109765718886.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:53:24] [INFO ] Decomposing Gal with order
[2025-05-30 12:53:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:53:24] [INFO ] Removed a total of 169 redundant transitions.
[2025-05-30 12:53:24] [INFO ] Flatten gal took : 108 ms
[2025-05-30 12:53:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2025-05-30 12:53:24] [INFO ] Time to serialize gal into /tmp/CTLFireability678475582100500135.gal : 17 ms
[2025-05-30 12:53:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3529061012036228146.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/CTLFireability678475582100500135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3529061012036228146.ctl'

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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.51879e+08,0.149134,9776,569,93,9338,1402,969,14074,95,5101,0


Converting to forward existential form...Done !
original formula: EG((AF(EG(EX((i1.u21.p216==1)))) + AX(((A((i6.u55.p369==1) U (i18.u161.p898==1)) * !(A((i10.i1.i0.u96.p575==1) U (i6.u48.p341==1)))) * ((...197
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG(EX((i1.u21.p216==1)))))) + !(EX(!(((!((E(!((i18.u161.p898==1)) U (!((i6.u55.p369==1)) * !(...378
Reverse transition relation is NOT exact ! Due to transitions t48, t59, t103, t272, t284, t298, t343, t377, t389, t432, t469, t496, t497, i0.i0.i0.t460, i0...729
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 479 transition count 593
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 479 transition count 593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 479 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 459 transition count 572
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 459 transition count 572
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 106 place count 450 transition count 563
Iterating global reduction 1 with 9 rules applied. Total rules applied 115 place count 450 transition count 563
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 449 transition count 562
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 449 transition count 562
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 448 transition count 561
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 448 transition count 561
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 447 transition count 560
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 447 transition count 560
Applied a total of 121 rules in 64 ms. Remains 447 /507 variables (removed 60) and now considering 560/621 (removed 61) transitions.
// Phase 1: matrix 560 rows 447 cols
[2025-05-30 12:53:55] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:53:55] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-30 12:53:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:53:55] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 559 sub problems to find dead transitions.
[2025-05-30 12:53:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (OVERLAPS) 560/1007 variables, 447/451 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:54:19] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:54:19] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 7 ms to minimize.
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 Real declared 1007/1007 variables, and 453 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 447/447 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 559 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (OVERLAPS) 1/447 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (OVERLAPS) 560/1007 variables, 447/453 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1007 variables, 559/1012 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 1012 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 447/447 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 559 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 447/507 places, 560/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60639 ms. Remains : 447/507 places, 560/621 transitions.
[2025-05-30 12:54:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:54:55] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:54:55] [INFO ] Input system was already deterministic with 560 transitions.
[2025-05-30 12:54:55] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:54:55] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:54:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18170542186160011313.gal : 2 ms
[2025-05-30 12:54:55] [INFO ] Time to serialize properties into /tmp/CTLFireability8891241314620308951.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/CTLFireability18170542186160011313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8891241314620308951.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,6.59326e+08,1.26192,45840,2,5720,5,127290,6,0,2346,227660,0


Converting to forward existential form...Done !
original formula: EF(((p540==1) * E(((AX((p282==1)) + (p471!=1)) + ((((p754==1)&&(p496==1))&&((p609==1)&&(p352==1)))&&(p862==1))) U E(AG((p636==1)) U AX((p...167
=> equivalent forward existential formula: [(FwdU(FwdU((FwdU(Init,TRUE) * (p540==1)),((!(EX(!((p282==1)))) + (p471!=1)) + ((((p754==1)&&(p496==1))&&((p609=...245
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t52, t54, t57, t101, t1...469
(forward)formula 0,1,27.1892,813828,1,0,815,3.64946e+06,1157,588,13639,4.60289e+06,1300
FORMULA CO4-PT-18-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 475 transition count 589
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 475 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 475 transition count 588
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 87 place count 453 transition count 566
Iterating global reduction 1 with 22 rules applied. Total rules applied 109 place count 453 transition count 566
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 120 place count 442 transition count 555
Iterating global reduction 1 with 11 rules applied. Total rules applied 131 place count 442 transition count 555
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 440 transition count 553
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 440 transition count 553
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 438 transition count 551
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 438 transition count 551
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 436 transition count 549
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 436 transition count 549
Applied a total of 143 rules in 56 ms. Remains 436 /507 variables (removed 71) and now considering 549/621 (removed 72) transitions.
// Phase 1: matrix 549 rows 436 cols
[2025-05-30 12:55:23] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:55:23] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-30 12:55:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:55:23] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2025-05-30 12:55:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:55:46] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:55:46] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:56:20] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 991 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 436/507 places, 549/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60443 ms. Remains : 436/507 places, 549/621 transitions.
[2025-05-30 12:56:23] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:56:23] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:56:23] [INFO ] Input system was already deterministic with 549 transitions.
[2025-05-30 12:56:23] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:56:23] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:56:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3287202986579097109.gal : 2 ms
[2025-05-30 12:56:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10047712750140091367.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/CTLFireability3287202986579097109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10047712750140091367.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,6.24824e+08,1.09178,40104,2,5582,5,111674,6,0,2291,194537,0


Converting to forward existential form...Done !
original formula: EX(A(AF(((AF((p391==1)) + (p778==1)) + (p335==1))) U (p366==1)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((p366==1))))) * !(E(!((p366==1)) U (!(!(EG(!(((!(EG(!((p391==1)))) + (p778==1)) + (p335==1)...189
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...463
Detected timeout of ITS tools.
[2025-05-30 12:56:53] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:56:53] [INFO ] Applying decomposition
[2025-05-30 12:56:53] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15495812388979947157.txt' '-o' '/tmp/graph15495812388979947157.bin' '-w' '/tmp/graph15495812388979947157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15495812388979947157.bin' '-l' '-1' '-v' '-w' '/tmp/graph15495812388979947157.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:56:53] [INFO ] Decomposing Gal with order
[2025-05-30 12:56:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:56:53] [INFO ] Removed a total of 160 redundant transitions.
[2025-05-30 12:56:53] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:56:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2025-05-30 12:56:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1615225813448406704.gal : 4 ms
[2025-05-30 12:56:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1726855515398688444.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/CTLFireability1615225813448406704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1726855515398688444.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.24824e+08,0.254778,13504,587,95,15821,3212,1073,28585,96,13886,0


Converting to forward existential form...Done !
original formula: EX(A(AF(((AF((i4.i0.i2.u52.p391==1)) + (i15.u135.p778==1)) + (i1.i1.i0.u11.p335==1))) U (i5.i0.i0.u48.p366==1)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((i5.i0.i0.u48.p366==1))))) * !(E(!((i5.i0.i0.u48.p366==1)) U (!(!(EG(!(((!(EG(!((i4.i0.i2.u...263
Reverse transition relation is NOT exact ! Due to transitions t17, t47, t56, t100, t184, t268, t292, t295, t340, t386, t466, t493, t494, i1.i0.t426, i1.i0....779
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 475 transition count 589
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 475 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 475 transition count 588
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 87 place count 453 transition count 566
Iterating global reduction 1 with 22 rules applied. Total rules applied 109 place count 453 transition count 566
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 119 place count 443 transition count 556
Iterating global reduction 1 with 10 rules applied. Total rules applied 129 place count 443 transition count 556
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 441 transition count 554
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 441 transition count 554
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 439 transition count 552
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 439 transition count 552
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 437 transition count 550
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 437 transition count 550
Applied a total of 141 rules in 54 ms. Remains 437 /507 variables (removed 70) and now considering 550/621 (removed 71) transitions.
// Phase 1: matrix 550 rows 437 cols
[2025-05-30 12:57:23] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:57:24] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-30 12:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:57:24] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2025-05-30 12:57:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:57:47] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:57:47] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 992 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 437/507 places, 550/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60478 ms. Remains : 437/507 places, 550/621 transitions.
[2025-05-30 12:58:24] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:58:24] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:58:24] [INFO ] Input system was already deterministic with 550 transitions.
[2025-05-30 12:58:24] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:58:24] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:58:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9095006479771204954.gal : 2 ms
[2025-05-30 12:58:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11430106816295163441.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/CTLFireability9095006479771204954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11430106816295163441.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,6.29911e+08,1.0753,41520,2,5699,5,116459,6,0,2296,199167,0


Converting to forward existential form...Done !
original formula: EX((EF((((p933==1)&&(p332==1))&&(p862==1))) * AF((p329!=1))))
=> equivalent forward existential formula: [((EY(Init) * E(TRUE U (((p933==1)&&(p332==1))&&(p862==1)))) * !(EG(!((p329!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
Detected timeout of ITS tools.
[2025-05-30 12:58:54] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:58:54] [INFO ] Applying decomposition
[2025-05-30 12:58:54] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4603304064025565333.txt' '-o' '/tmp/graph4603304064025565333.bin' '-w' '/tmp/graph4603304064025565333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4603304064025565333.bin' '-l' '-1' '-v' '-w' '/tmp/graph4603304064025565333.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:58:54] [INFO ] Decomposing Gal with order
[2025-05-30 12:58:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:58:54] [INFO ] Removed a total of 162 redundant transitions.
[2025-05-30 12:58:54] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:58:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2025-05-30 12:58:54] [INFO ] Time to serialize gal into /tmp/CTLFireability9545654783225828598.gal : 4 ms
[2025-05-30 12:58:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10321498180748105273.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/CTLFireability9545654783225828598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10321498180748105273.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.29911e+08,0.266055,14852,670,94,18571,4070,918,36657,95,18199,0


Converting to forward existential form...Done !
original formula: EX((EF((((i19.u164.p933==1)&&(i2.i0.i0.u38.p332==1))&&(i9.u156.p862==1))) * AF((i4.u44.p329!=1))))
=> equivalent forward existential formula: [((EY(Init) * E(TRUE U (((i19.u164.p933==1)&&(i2.i0.i0.u38.p332==1))&&(i9.u156.p862==1)))) * !(EG(!((i4.u44.p329...173
Reverse transition relation is NOT exact ! Due to transitions t17, t47, t56, t184, t269, t295, t375, t387, t418, t458, t467, t494, t495, i0.t449, i1.t427, ...737
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,5.55897,215940,1,0,298356,4699,6523,1.583e+06,502,22357,325587
FORMULA CO4-PT-18-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 480 transition count 594
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 480 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 480 transition count 593
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 462 transition count 575
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 462 transition count 575
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 100 place count 453 transition count 566
Iterating global reduction 1 with 9 rules applied. Total rules applied 109 place count 453 transition count 566
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 452 transition count 565
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 452 transition count 565
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 451 transition count 564
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 451 transition count 564
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 450 transition count 563
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 450 transition count 563
Applied a total of 115 rules in 47 ms. Remains 450 /507 variables (removed 57) and now considering 563/621 (removed 58) transitions.
// Phase 1: matrix 563 rows 450 cols
[2025-05-30 12:59:00] [INFO ] Computed 4 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:59:00] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-30 12:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:59:00] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 562 sub problems to find dead transitions.
[2025-05-30 12:59:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (OVERLAPS) 563/1013 variables, 450/454 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:59:25] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:59:25] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1013/1013 variables, and 456 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (OVERLAPS) 563/1013 variables, 450/456 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1013 variables, 562/1018 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1013/1013 variables, and 1018 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 450/507 places, 563/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60438 ms. Remains : 450/507 places, 563/621 transitions.
[2025-05-30 13:00:00] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:00:00] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:00:00] [INFO ] Input system was already deterministic with 563 transitions.
[2025-05-30 13:00:00] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:00:00] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:00:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15370504317921135934.gal : 2 ms
[2025-05-30 13:00:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3476070675725049180.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/CTLFireability15370504317921135934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3476070675725049180.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,6.70388e+08,1.23551,45380,2,5830,5,124931,6,0,2361,228805,0


Converting to forward existential form...Done !
original formula: (!(A(((EX(((p724==1)&&(p152==1))) + EX((p554!=1))) + (((p307==1)&&((p212==1)||(p848==1))) + (((p854==1) + EF((p838==1))) * EG((p354==1)))...205
=> equivalent forward existential formula: ([((Init * !(EG(!(E(TRUE U ((p309==1)&&(p758==1))))))) * !(E(!(E(TRUE U ((p309==1)&&(p758==1)))) U (!(((EX(((p72...374
Hit Full ! (commute/partial/dont) 556/0/7
(forward)formula 0,0,6.86146,205940,1,0,29,1.12097e+06,20,4,10803,355086,26
FORMULA CO4-PT-18-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 475 transition count 589
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 475 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 475 transition count 588
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 87 place count 453 transition count 566
Iterating global reduction 1 with 22 rules applied. Total rules applied 109 place count 453 transition count 566
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 120 place count 442 transition count 555
Iterating global reduction 1 with 11 rules applied. Total rules applied 131 place count 442 transition count 555
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 440 transition count 553
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 440 transition count 553
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 438 transition count 551
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 438 transition count 551
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 436 transition count 549
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 436 transition count 549
Applied a total of 143 rules in 48 ms. Remains 436 /507 variables (removed 71) and now considering 549/621 (removed 72) transitions.
// Phase 1: matrix 549 rows 436 cols
[2025-05-30 13:00:07] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:00:07] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 13:00:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:00:08] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2025-05-30 13:00:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:00:31] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:00:31] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:01:05] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 991 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 436/507 places, 549/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60473 ms. Remains : 436/507 places, 549/621 transitions.
[2025-05-30 13:01:08] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:01:08] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:01:08] [INFO ] Input system was already deterministic with 549 transitions.
[2025-05-30 13:01:08] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:01:08] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:01:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16437225857168264399.gal : 2 ms
[2025-05-30 13:01:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15271931753815754580.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/CTLFireability16437225857168264399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15271931753815754580.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.23624e+08,1.10154,41128,2,5722,5,114607,6,0,2291,198283,0


Converting to forward existential form...Done !
original formula: EG(AG(((AX(FALSE) + EF((p234==1))) + ((p585==1)||((p517==1)&&(p809==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((!(EX(!(FALSE))) + E(TRUE U (p234==1))) + ((p585==1)||((p517==1)&&(p809==0))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
Detected timeout of ITS tools.
[2025-05-30 13:01:38] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:01:38] [INFO ] Applying decomposition
[2025-05-30 13:01:38] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12362168913837505708.txt' '-o' '/tmp/graph12362168913837505708.bin' '-w' '/tmp/graph12362168913837505708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12362168913837505708.bin' '-l' '-1' '-v' '-w' '/tmp/graph12362168913837505708.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:01:38] [INFO ] Decomposing Gal with order
[2025-05-30 13:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:01:38] [INFO ] Removed a total of 161 redundant transitions.
[2025-05-30 13:01:38] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 13:01:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8900929700561461388.gal : 5 ms
[2025-05-30 13:01:38] [INFO ] Time to serialize properties into /tmp/CTLFireability8006724013304324121.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/CTLFireability8900929700561461388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8006724013304324121.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.23624e+08,0.137141,9148,552,93,7677,1400,1026,12294,86,4997,0


Converting to forward existential form...Done !
original formula: EG(AG(((AX(FALSE) + EF((i3.i0.i2.u24.p234==1))) + ((i10.u97.p585==1)||((i8.i1.i0.u79.p517==1)&&(i16.u145.p809==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((!(EX(!(FALSE))) + E(TRUE U (i3.i0.i2.u24.p234==1))) + ((i10.u97.p585==1)||((i8.i1.i0.u...203
Reverse transition relation is NOT exact ! Due to transitions t47, t56, t100, t271, t283, t297, t387, t467, t494, t495, i3.i0.t427, i3.i0.i1.u16.t424, i3.i...763
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,1.00876,48188,1,0,84127,2894,6971,199250,443,12305,193122
FORMULA CO4-PT-18-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 477 transition count 591
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 477 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 477 transition count 590
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 82 place count 456 transition count 569
Iterating global reduction 1 with 21 rules applied. Total rules applied 103 place count 456 transition count 569
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 113 place count 446 transition count 559
Iterating global reduction 1 with 10 rules applied. Total rules applied 123 place count 446 transition count 559
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 444 transition count 557
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 444 transition count 557
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 442 transition count 555
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 442 transition count 555
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 440 transition count 553
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 440 transition count 553
Applied a total of 135 rules in 48 ms. Remains 440 /507 variables (removed 67) and now considering 553/621 (removed 68) transitions.
// Phase 1: matrix 553 rows 440 cols
[2025-05-30 13:01:39] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:01:39] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-05-30 13:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:01:39] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 552 sub problems to find dead transitions.
[2025-05-30 13:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (OVERLAPS) 1/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (OVERLAPS) 553/993 variables, 440/444 constraints. Problems are: Problem set: 0 solved, 552 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:02:03] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:02:03] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/993 variables, and 446 constraints, problems are : Problem set: 0 solved, 552 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (OVERLAPS) 1/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 553/993 variables, 440/446 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/993 variables, 552/998 constraints. Problems are: Problem set: 0 solved, 552 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:02:39] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/993 variables, and 999 constraints, problems are : Problem set: 0 solved, 552 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 440/507 places, 553/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60405 ms. Remains : 440/507 places, 553/621 transitions.
[2025-05-30 13:02:39] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:02:39] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:02:39] [INFO ] Input system was already deterministic with 553 transitions.
[2025-05-30 13:02:39] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:02:39] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:02:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3606794765341583627.gal : 3 ms
[2025-05-30 13:02:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4890568669102630622.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/CTLFireability3606794765341583627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4890568669102630622.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,6.37151e+08,1.11402,42172,2,5644,5,116726,6,0,2310,204477,0


Converting to forward existential form...Done !
original formula: (AF(AX((AG((p200==0)) * (p624==0)))) + (EG(((p213==0)&&(p602==1))) * EF(AG(AF((p652==1))))))
=> equivalent forward existential formula: [FwdG((Init * !((EG(((p213==0)&&(p602==1))) * E(TRUE U !(E(TRUE U !(!(EG(!((p652==1))))))))))),!(!(EX(!((!(E(TRU...200
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t52, t54, t57, t101, t1...457
Detected timeout of ITS tools.
[2025-05-30 13:03:09] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:03:09] [INFO ] Applying decomposition
[2025-05-30 13:03:09] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9911694844926537109.txt' '-o' '/tmp/graph9911694844926537109.bin' '-w' '/tmp/graph9911694844926537109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9911694844926537109.bin' '-l' '-1' '-v' '-w' '/tmp/graph9911694844926537109.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:03:09] [INFO ] Decomposing Gal with order
[2025-05-30 13:03:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:03:09] [INFO ] Removed a total of 166 redundant transitions.
[2025-05-30 13:03:10] [INFO ] Flatten gal took : 33 ms
[2025-05-30 13:03:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2025-05-30 13:03:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15895090478154762219.gal : 4 ms
[2025-05-30 13:03:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5605862216590953616.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/CTLFireability15895090478154762219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5605862216590953616.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.37151e+08,0.158322,10056,619,93,10030,1659,975,15508,90,5875,0


Converting to forward existential form...Done !
original formula: (AF(AX((AG((i5.u19.p200==0)) * (i9.u112.p624==0)))) + (EG(((i2.u21.p213==0)&&(i11.u106.p602==1))) * EF(AG(AF((i13.u117.p652==1))))))
=> equivalent forward existential formula: [FwdG((Init * !((EG(((i2.u21.p213==0)&&(i11.u106.p602==1))) * E(TRUE U !(E(TRUE U !(!(EG(!((i13.u117.p652==1))))...240
Reverse transition relation is NOT exact ! Due to transitions t48, t57, t101, t186, t204, t284, t298, t389, t460, t469, t496, t497, i1.t451, i3.i0.t429, i3...749
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 475 transition count 589
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 475 transition count 589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 475 transition count 588
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 87 place count 453 transition count 566
Iterating global reduction 1 with 22 rules applied. Total rules applied 109 place count 453 transition count 566
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 120 place count 442 transition count 555
Iterating global reduction 1 with 11 rules applied. Total rules applied 131 place count 442 transition count 555
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 440 transition count 553
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 440 transition count 553
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 438 transition count 551
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 438 transition count 551
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 436 transition count 549
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 436 transition count 549
Applied a total of 143 rules in 49 ms. Remains 436 /507 variables (removed 71) and now considering 549/621 (removed 72) transitions.
// Phase 1: matrix 549 rows 436 cols
[2025-05-30 13:03:40] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:03:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-30 13:03:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:03:40] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2025-05-30 13:03:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:04:03] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:04:03] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 436/507 places, 549/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60428 ms. Remains : 436/507 places, 549/621 transitions.
[2025-05-30 13:04:40] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:04:40] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:04:40] [INFO ] Input system was already deterministic with 549 transitions.
[2025-05-30 13:04:40] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:04:40] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:04:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2755126984683941688.gal : 2 ms
[2025-05-30 13:04:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10020113776317152364.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/CTLFireability2755126984683941688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10020113776317152364.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,6.25979e+08,1.10092,41384,2,5630,5,114937,6,0,2291,199569,0


Converting to forward existential form...Done !
original formula: EF(EX(EG((p228==0))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),(p228==0))] != FALSE
Hit Full ! (commute/partial/dont) 547/0/2
(forward)formula 0,1,6.67047,191872,1,0,28,1.02792e+06,19,4,10471,366724,27
FORMULA CO4-PT-18-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 476 transition count 590
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 476 transition count 590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 476 transition count 589
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 84 place count 455 transition count 568
Iterating global reduction 1 with 21 rules applied. Total rules applied 105 place count 455 transition count 568
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 444 transition count 557
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 444 transition count 557
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 442 transition count 555
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 442 transition count 555
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 440 transition count 553
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 440 transition count 553
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 438 transition count 551
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 438 transition count 551
Applied a total of 139 rules in 54 ms. Remains 438 /507 variables (removed 69) and now considering 551/621 (removed 70) transitions.
// Phase 1: matrix 551 rows 438 cols
[2025-05-30 13:04:47] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:04:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-30 13:04:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:04:47] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 550 sub problems to find dead transitions.
[2025-05-30 13:04:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (OVERLAPS) 551/989 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:05:11] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:05:11] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 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 989/989 variables, and 444 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 551/989 variables, 438/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 550/994 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:05:46] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 989/989 variables, and 995 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 438/507 places, 551/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60420 ms. Remains : 438/507 places, 551/621 transitions.
[2025-05-30 13:05:47] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:05:47] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:05:47] [INFO ] Input system was already deterministic with 551 transitions.
[2025-05-30 13:05:47] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:05:47] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:05:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11177707253121562178.gal : 1 ms
[2025-05-30 13:05:47] [INFO ] Time to serialize properties into /tmp/CTLFireability578727760201439477.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/CTLFireability11177707253121562178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability578727760201439477.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,6.31561e+08,1.12806,41648,2,5652,5,115895,6,0,2301,202082,0


Converting to forward existential form...Done !
original formula: EF((((AG((p400==1)) + EG((A((p529==1) U (p524==1)) * EX((p635==1))))) + (EF(EX((p202==1))) + (p296==1))) + (p546==1)))
=> equivalent forward existential formula: ((([(FwdU(Init,TRUE) * !(E(TRUE U !((p400==1)))))] != FALSE + [FwdG(FwdU(Init,TRUE),(!((E(!((p524==1)) U (!((p52...376
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
Detected timeout of ITS tools.
[2025-05-30 13:06:17] [INFO ] Flatten gal took : 14 ms
[2025-05-30 13:06:17] [INFO ] Applying decomposition
[2025-05-30 13:06:17] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13298828024476175785.txt' '-o' '/tmp/graph13298828024476175785.bin' '-w' '/tmp/graph13298828024476175785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13298828024476175785.bin' '-l' '-1' '-v' '-w' '/tmp/graph13298828024476175785.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:06:17] [INFO ] Decomposing Gal with order
[2025-05-30 13:06:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:06:17] [INFO ] Removed a total of 160 redundant transitions.
[2025-05-30 13:06:17] [INFO ] Flatten gal took : 29 ms
[2025-05-30 13:06:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 13:06:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17070449585712108503.gal : 4 ms
[2025-05-30 13:06:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6285507106706438479.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/CTLFireability17070449585712108503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6285507106706438479.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.31561e+08,0.190614,11904,709,95,13246,2753,1013,22395,92,11032,0


Converting to forward existential form...Done !
original formula: EF((((AG((i3.u61.p400==1)) + EG((A((i9.u84.p529==1) U (i15.u83.p524==1)) * EX((i3.u27.p635==1))))) + (EF(EX((i3.u4.p202==1))) + (i5.u34.p...185
=> equivalent forward existential formula: ((([(FwdU(Init,TRUE) * !(E(TRUE U !((i3.u61.p400==1)))))] != FALSE + [FwdG(FwdU(Init,TRUE),(!((E(!((i15.u83.p524...441
Reverse transition relation is NOT exact ! Due to transitions t17, t47, t56, t100, t240, t297, t375, t389, t469, t496, t497, i1.i0.t429, i1.i0.i1.u18.t426,...750
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,19.3275,536252,1,0,749618,5469,8125,3.42542e+06,518,25004,690325
FORMULA CO4-PT-18-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 478 transition count 592
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 478 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 478 transition count 591
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 79 place count 458 transition count 571
Iterating global reduction 1 with 20 rules applied. Total rules applied 99 place count 458 transition count 571
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 108 place count 449 transition count 562
Iterating global reduction 1 with 9 rules applied. Total rules applied 117 place count 449 transition count 562
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 447 transition count 560
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 447 transition count 560
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 445 transition count 558
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 445 transition count 558
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 443 transition count 556
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 443 transition count 556
Applied a total of 129 rules in 50 ms. Remains 443 /507 variables (removed 64) and now considering 556/621 (removed 65) transitions.
// Phase 1: matrix 556 rows 443 cols
[2025-05-30 13:06:37] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:06:37] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-30 13:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:06:37] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2025-05-30 13:06:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/999 variables, 443/447 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:07:01] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:07:01] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/999 variables, and 449 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/443 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 556/999 variables, 443/449 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 555/1004 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:07:36] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/999 variables, and 1005 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 443/443 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 443/507 places, 556/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60410 ms. Remains : 443/507 places, 556/621 transitions.
[2025-05-30 13:07:37] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:07:37] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:07:37] [INFO ] Input system was already deterministic with 556 transitions.
[2025-05-30 13:07:37] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:07:37] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:07:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11270470481559599265.gal : 2 ms
[2025-05-30 13:07:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17501765348772341763.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/CTLFireability11270470481559599265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17501765348772341763.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.53975e+08,1.31422,47156,2,6216,5,131813,6,0,2326,234067,0


Converting to forward existential form...Done !
original formula: A((((EX(EG((p966==1))) * EX(((p941!=1) + AX((p795==1))))) * (p329==1)) + (!(EG((p667==1))) * (p660==1))) U (EG(!(EF((p460==1)))) + ((p735...173
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!(E(TRUE U (p460==1)))) + ((p735==1)&&(p964==1))))))) * !(E(!((EG(!(E(TRUE U (p460==1)))) +...368
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t26, t29, t38, t49, t53, t59, t104, t138, t150, t168, t189...479
Detected timeout of ITS tools.
[2025-05-30 13:08:07] [INFO ] Flatten gal took : 14 ms
[2025-05-30 13:08:07] [INFO ] Applying decomposition
[2025-05-30 13:08:07] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17594718087139333798.txt' '-o' '/tmp/graph17594718087139333798.bin' '-w' '/tmp/graph17594718087139333798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17594718087139333798.bin' '-l' '-1' '-v' '-w' '/tmp/graph17594718087139333798.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:08:08] [INFO ] Decomposing Gal with order
[2025-05-30 13:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:08:08] [INFO ] Removed a total of 164 redundant transitions.
[2025-05-30 13:08:08] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-05-30 13:08:08] [INFO ] Time to serialize gal into /tmp/CTLFireability10446298598196082240.gal : 3 ms
[2025-05-30 13:08:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8167105701390962709.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/CTLFireability10446298598196082240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8167105701390962709.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.53975e+08,0.165852,10456,673,96,11020,1505,911,17845,97,5303,0


Converting to forward existential form...Done !
original formula: A((((EX(EG((i19.u162.p966==1))) * EX(((i19.u168.p941!=1) + AX((i17.u152.p795==1))))) * (i6.u41.p329==1)) + (!(EG((i13.u117.p667==1))) * (...249
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!(E(TRUE U (i8.u71.p460==1)))) + ((i14.u130.p735==1)&&(i19.u169.p964==1))))))) * !(E(!((EG(...494
Reverse transition relation is NOT exact ! Due to transitions t49, t59, t104, t138, t150, t189, t197, t233, t297, t300, t380, t403, t472, t499, t500, i1.i0...731
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,27.8756,826704,1,0,1.16418e+06,5353,6852,5.29733e+06,545,27859,943350
FORMULA CO4-PT-18-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 621/621 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 478 transition count 592
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 478 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 478 transition count 591
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 80 place count 457 transition count 570
Iterating global reduction 1 with 21 rules applied. Total rules applied 101 place count 457 transition count 570
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 110 place count 448 transition count 561
Iterating global reduction 1 with 9 rules applied. Total rules applied 119 place count 448 transition count 561
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 446 transition count 559
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 446 transition count 559
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 444 transition count 557
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 444 transition count 557
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 442 transition count 555
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 442 transition count 555
Applied a total of 131 rules in 52 ms. Remains 442 /507 variables (removed 65) and now considering 555/621 (removed 66) transitions.
// Phase 1: matrix 555 rows 442 cols
[2025-05-30 13:08:36] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:08:36] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-30 13:08:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:08:36] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 554 sub problems to find dead transitions.
[2025-05-30 13:08:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (OVERLAPS) 555/997 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:08:59] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:08:59] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/997 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/997 variables, and 448 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 555/997 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/997 variables, 554/1002 constraints. Problems are: Problem set: 0 solved, 554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/997 variables, and 1002 constraints, problems are : Problem set: 0 solved, 554 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 442/507 places, 555/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60416 ms. Remains : 442/507 places, 555/621 transitions.
[2025-05-30 13:09:36] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:09:36] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:09:36] [INFO ] Input system was already deterministic with 555 transitions.
[2025-05-30 13:09:36] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:09:36] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:09:36] [INFO ] Time to serialize gal into /tmp/CTLFireability8472510316392696169.gal : 2 ms
[2025-05-30 13:09:36] [INFO ] Time to serialize properties into /tmp/CTLFireability4212136119182546476.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/CTLFireability8472510316392696169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4212136119182546476.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,6.41479e+08,1.11555,41804,2,5528,5,113894,6,0,2321,208136,0


Converting to forward existential form...Done !
original formula: !(E(EX((p462==1)) U E(EF(((p301==1)&&(p487!=1))) U AF(EX((p845==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX((p462==1))),E(TRUE U ((p301==1)&&(p487!=1)))) * !(EG(!(EX((p845==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t24, t29, t38, t47, t49, t50, t51, t52, t53, t55, t58, t103, t1...457
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-05-30 13:10:06] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:10:06] [INFO ] Applying decomposition
[2025-05-30 13:10:06] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9181933747443749660.txt' '-o' '/tmp/graph9181933747443749660.bin' '-w' '/tmp/graph9181933747443749660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9181933747443749660.bin' '-l' '-1' '-v' '-w' '/tmp/graph9181933747443749660.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:10:06] [INFO ] Decomposing Gal with order
[2025-05-30 13:10:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:10:06] [INFO ] Removed a total of 160 redundant transitions.
[2025-05-30 13:10:06] [INFO ] Flatten gal took : 24 ms
[2025-05-30 13:10:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-30 13:10:06] [INFO ] Time to serialize gal into /tmp/CTLFireability607322842623616214.gal : 3 ms
[2025-05-30 13:10:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5772700818208243338.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/CTLFireability607322842623616214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5772700818208243338.ctl'

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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.41479e+08,0.177334,11192,643,96,12603,1441,957,21695,94,4971,0


Converting to forward existential form...Done !
original formula: !(E(EX((i8.u72.p462==1)) U E(EF(((i3.u35.p301==1)&&(i11.u73.p487!=1))) U AF(EX((i17.u152.p845==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX((i8.u72.p462==1))),E(TRUE U ((i3.u35.p301==1)&&(i11.u73.p487!=1)))) * !(EG(!(EX((i17.u152.p8...175
Reverse transition relation is NOT exact ! Due to transitions t49, t58, t285, t299, t343, t390, t421, t433, t470, t497, t498, i0.t452, i0.u6.t461, i2.t399,...725
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
[2025-05-30 13:10:36] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:10:36] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:10:36] [INFO ] Applying decomposition
[2025-05-30 13:10:36] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18322049734766903628.txt' '-o' '/tmp/graph18322049734766903628.bin' '-w' '/tmp/graph18322049734766903628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18322049734766903628.bin' '-l' '-1' '-v' '-w' '/tmp/graph18322049734766903628.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:10:36] [INFO ] Decomposing Gal with order
[2025-05-30 13:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:10:36] [INFO ] Removed a total of 160 redundant transitions.
[2025-05-30 13:10:36] [INFO ] Flatten gal took : 18 ms
[2025-05-30 13:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-05-30 13:10:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3227811256197636366.gal : 4 ms
[2025-05-30 13:10:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17923960421596622653.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/CTLFireability3227811256197636366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17923960421596622653.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 4 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,9.09826e+08,0.330792,17164,857,102,22117,2334,1165,52433,101,8902,0


Converting to forward existential form...Done !
original formula: EG((AF(EG(EX((i3.u22.p216==1)))) + AX(((A((i5.u60.p369==1) U (i21.u189.p898==1)) * !(A((i14.i1.i0.u110.p575==1) U (i1.i1.i1.u52.p341==1))...204
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG(EX((i3.u22.p216==1)))))) + !(EX(!(((!((E(!((i21.u189.p898==1)) U (!((i5.u60.p369==1)) * !(...397
Reverse transition relation is NOT exact ! Due to transitions t70, t121, t157, t171, t214, t232, t275, t306, t307, t320, t334, t383, t510, t519, t547, t548...954
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,124.21,2202948,1,0,2.36241e+06,8190,2431,1.77596e+07,212,54106,576131
FORMULA CO4-PT-18-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(A(AF(((AF((i7.i1.i1.u65.p391==1)) + (i19.u165.p778==1)) + (i1.i1.i0.u10.p335==1))) U (i6.u58.p366==1)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((i6.u58.p366==1))))) * !(E(!((i6.u58.p366==1)) U (!(!(EG(!(((!(EG(!((i7.i1.i1.u65.p391==1))...245
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 1,0,180.752,2267716,1,0,2.67511e+06,8190,4625,1.77596e+07,294,54106,1877609
FORMULA CO4-PT-18-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(AX((AG((i8.u18.p200==0)) * (i12.i0.i2.u121.p624==0)))) + (EG(((i3.u20.p213==0)&&(i13.u116.p602==1))) * EF(AG(AF((i15.i1.i0.u130.p652=...163
=> equivalent forward existential formula: [FwdG((Init * !((EG(((i3.u20.p213==0)&&(i13.u116.p602==1))) * E(TRUE U !(E(TRUE U !(!(EG(!((i15.i1.i0.u130.p652=...253
(forward)formula 2,0,241.958,2427204,1,0,2.89484e+06,8515,4299,1.77596e+07,266,54106,821743
FORMULA CO4-PT-18-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(E(EX((i9.u85.p462==1)) U E(EF(((i7.i0.i1.u38.p301==1)&&(i10.u86.p487!=1))) U AF(EX((i20.u181.p845==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX((i9.u85.p462==1))),E(TRUE U ((i7.i0.i1.u38.p301==1)&&(i10.u86.p487!=1)))) * !(EG(!(EX((i20.u...181
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 3,0,302.984,2620996,1,0,3.15668e+06,12349,4575,1.94425e+07,293,81812,1983262
FORMULA CO4-PT-18-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1439340 ms.

BK_STOP 1748610940576

--------------------
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="CO4-PT-18"
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 CO4-PT-18, 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 r044-tall-174854028600514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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