Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008000482.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 GPUForwardProgress-PT-28b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008000482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 141K 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 GPUForwardProgress-PT-28b-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2023-15
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-00
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-01
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-02
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-03
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-04
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-05
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-06
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-07
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-08
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-09
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-10
FORMULA_NAME GPUForwardProgress-PT-28b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748972329601

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 17:38:52] [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-06-03 17:38:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 17:38:52] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2025-06-03 17:38:52] [INFO ] Transformed 568 places.
[2025-06-03 17:38:52] [INFO ] Transformed 597 transitions.
[2025-06-03 17:38:52] [INFO ] Found NUPN structural information;
[2025-06-03 17:38:52] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 464 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 75 out of 568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 47 place count 521 transition count 551
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 521 transition count 551
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 110 place count 504 transition count 534
Iterating global reduction 1 with 17 rules applied. Total rules applied 127 place count 504 transition count 534
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 144 place count 504 transition count 517
Applied a total of 144 rules in 271 ms. Remains 504 /568 variables (removed 64) and now considering 517/597 (removed 80) transitions.
// Phase 1: matrix 517 rows 504 cols
[2025-06-03 17:38:53] [INFO ] Computed 29 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:38:54] [INFO ] Implicit Places using invariants in 804 ms returned []
[2025-06-03 17:38:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:38:55] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
Running 516 sub problems to find dead transitions.
[2025-06-03 17:38: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/503 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 517/1020 variables, 503/532 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1021 variables, and 532 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 503/504 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 517/1020 variables, 503/532 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1020 variables, 516/1048 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1021 variables, and 1048 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 503/504 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60472ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Starting structural reductions in LTL mode, iteration 1 : 504/568 places, 517/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62715 ms. Remains : 504/568 places, 517/597 transitions.
Support contains 75 out of 504 places after structural reductions.
[2025-06-03 17:39:56] [INFO ] Flatten gal took : 128 ms
[2025-06-03 17:39:56] [INFO ] Flatten gal took : 69 ms
[2025-06-03 17:39:56] [INFO ] Input system was already deterministic with 517 transitions.
Support contains 73 out of 504 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (164 resets) in 2276 ms. (17 steps per ms) remains 20/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
[2025-06-03 17:39:57] [INFO ] Invariant cache hit.
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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 471/503 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 517/1020 variables, 503/532 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/1021 variables, 1/533 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/1021 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1021/1021 variables, and 533 constraints, problems are : Problem set: 1 solved, 19 unsolved in 1628 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 473/503 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 517/1020 variables, 503/532 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1020 variables, 19/551 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/1021 variables, 1/552 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1021 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 552 constraints, problems are : Problem set: 1 solved, 19 unsolved in 5008 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6655ms problems are : Problem set: 1 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 376 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 771 edges and 499 vertex of which 467 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 217 rules applied. Total rules applied 219 place count 467 transition count 290
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 222 rules applied. Total rules applied 441 place count 251 transition count 284
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 10 rules applied. Total rules applied 451 place count 249 transition count 276
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 459 place count 241 transition count 276
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 459 place count 241 transition count 224
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 563 place count 189 transition count 224
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 591 place count 161 transition count 196
Iterating global reduction 4 with 28 rules applied. Total rules applied 619 place count 161 transition count 196
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 765 place count 88 transition count 123
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 776 place count 77 transition count 101
Iterating global reduction 4 with 11 rules applied. Total rules applied 787 place count 77 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 799 place count 71 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 803 place count 71 transition count 97
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 808 place count 71 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 809 place count 70 transition count 96
Applied a total of 809 rules in 124 ms. Remains 70 /504 variables (removed 434) and now considering 96/517 (removed 421) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 70/504 places, 96/517 transitions.
RANDOM walk for 35305 steps (1506 resets) in 1026 ms. (34 steps per ms) remains 0/19 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-03 17:40:04] [INFO ] Flatten gal took : 50 ms
[2025-06-03 17:40:04] [INFO ] Flatten gal took : 32 ms
[2025-06-03 17:40:04] [INFO ] Input system was already deterministic with 517 transitions.
Computed a total of 97 stabilizing places and 97 stable transitions
Graph (complete) has 778 edges and 504 vertex of which 472 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 484 transition count 497
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 484 transition count 497
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 484 transition count 494
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 475 transition count 485
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 475 transition count 485
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 475 transition count 478
Applied a total of 68 rules in 59 ms. Remains 475 /504 variables (removed 29) and now considering 478/517 (removed 39) transitions.
// Phase 1: matrix 478 rows 475 cols
[2025-06-03 17:40:04] [INFO ] Computed 29 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:40:04] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-03 17:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:40:05] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2025-06-03 17:40:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 2.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 3.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 4.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 5.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 6.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 7.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 8.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 9.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 10.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 11.0)
(s269 10.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 13.0)
(s301 14.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 952/953 variables, and 503 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 952/953 variables, and 980 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 475/504 places, 478/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61016 ms. Remains : 475/504 places, 478/517 transitions.
[2025-06-03 17:41:05] [INFO ] Flatten gal took : 43 ms
[2025-06-03 17:41:05] [INFO ] Flatten gal took : 41 ms
[2025-06-03 17:41:05] [INFO ] Input system was already deterministic with 478 transitions.
[2025-06-03 17:41:05] [INFO ] Flatten gal took : 40 ms
[2025-06-03 17:41:05] [INFO ] Flatten gal took : 41 ms
[2025-06-03 17:41:05] [INFO ] Time to serialize gal into /tmp/CTLFireability713550311961879745.gal : 27 ms
[2025-06-03 17:41:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4211572692440951234.ctl : 7 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/CTLFireability713550311961879745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4211572692440951234.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 17:41:36] [INFO ] Flatten gal took : 37 ms
[2025-06-03 17:41:36] [INFO ] Applying decomposition
[2025-06-03 17:41:36] [INFO ] Flatten gal took : 34 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/graph5812037649879887057.txt' '-o' '/tmp/graph5812037649879887057.bin' '-w' '/tmp/graph5812037649879887057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5812037649879887057.bin' '-l' '-1' '-v' '-w' '/tmp/graph5812037649879887057.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:41:36] [INFO ] Decomposing Gal with order
[2025-06-03 17:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:41:36] [INFO ] Removed a total of 141 redundant transitions.
[2025-06-03 17:41:36] [INFO ] Flatten gal took : 103 ms
[2025-06-03 17:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-03 17:41:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2755777631539828116.gal : 17 ms
[2025-06-03 17:41:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12475320172846137326.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/CTLFireability2755777631539828116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12475320172846137326.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.86601e+34,0.568996,20748,1581,28,33867,353,696,51025,36,862,0


Converting to forward existential form...Done !
original formula: A((EG(!(((i5.u47.p125!=1)||((i25.u180.p495==1)&&((((i16.u118.p328==1)&&(i29.u198.p549==1))&&(i29.u200.p564==1))||(i29.u198.p558==1)))))) ...355
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U ((i14.u104.p291==1)&&(i19.u139.p385==1)))) + E(TRUE U (i14.u104.p291==1))))))) * !(...691
Reverse transition relation is NOT exact ! Due to transitions t420, i0.t415, i0.t408, i1.t402, i1.u24.t395, i2.t388, i2.t381, i3.t374, i3.t367, i4.t360, i4...855
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 a local SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,1.72557,48012,1,0,68862,353,5125,118147,174,862,426005
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 484 transition count 497
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 484 transition count 497
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 484 transition count 494
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 475 transition count 485
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 475 transition count 485
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 475 transition count 478
Applied a total of 68 rules in 46 ms. Remains 475 /504 variables (removed 29) and now considering 478/517 (removed 39) transitions.
// Phase 1: matrix 478 rows 475 cols
[2025-06-03 17:41:38] [INFO ] Computed 29 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:38] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-03 17:41:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:41:39] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2025-06-03 17:41: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/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.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 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.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 3.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 3.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 3.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 3.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.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 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)timeout

(s155 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 952/953 variables, and 503 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 952/953 variables, and 980 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 475/504 places, 478/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60864 ms. Remains : 475/504 places, 478/517 transitions.
[2025-06-03 17:42:39] [INFO ] Flatten gal took : 25 ms
[2025-06-03 17:42:39] [INFO ] Flatten gal took : 24 ms
[2025-06-03 17:42:39] [INFO ] Input system was already deterministic with 478 transitions.
[2025-06-03 17:42:39] [INFO ] Flatten gal took : 24 ms
[2025-06-03 17:42:39] [INFO ] Flatten gal took : 22 ms
[2025-06-03 17:42:39] [INFO ] Time to serialize gal into /tmp/CTLFireability4950945446914013504.gal : 6 ms
[2025-06-03 17:42:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2027963169934687043.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/CTLFireability4950945446914013504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2027963169934687043.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.
Detected timeout of ITS tools.
[2025-06-03 17:43:09] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:43:09] [INFO ] Applying decomposition
[2025-06-03 17:43:09] [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/graph5928398421028511053.txt' '-o' '/tmp/graph5928398421028511053.bin' '-w' '/tmp/graph5928398421028511053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5928398421028511053.bin' '-l' '-1' '-v' '-w' '/tmp/graph5928398421028511053.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:43:09] [INFO ] Decomposing Gal with order
[2025-06-03 17:43:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:43:09] [INFO ] Removed a total of 147 redundant transitions.
[2025-06-03 17:43:09] [INFO ] Flatten gal took : 48 ms
[2025-06-03 17:43:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 17:43:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1596640730371606146.gal : 7 ms
[2025-06-03 17:43:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6453090006802298276.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/CTLFireability1596640730371606146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6453090006802298276.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.86601e+34,0.664657,17224,1171,28,27414,293,731,37503,36,589,0


Converting to forward existential form...Done !
original formula: EX(((i6.u43.p101==0) * AG(((((i0.i1.i2.u165.p456==0) + AF((i22.u153.p410==0))) * (i8.u54.p145==0)) * EF((i1.i1.i1.u108.p294==0))))))
=> equivalent forward existential formula: [((EY(Init) * (i6.u43.p101==0)) * !(E(TRUE U !(((((i0.i1.i2.u165.p456==0) + !(EG(!((i22.u153.p410==0))))) * (i8....219
Reverse transition relation is NOT exact ! Due to transitions t420, i0.i1.t90, i0.i1.i1.t83, i1.i1.t217, i1.i1.i1.u104.t210, i2.t415, i2.t408, i3.i1.t402, ...867
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 a local SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,12.4243,247752,1,0,428497,293,5403,661693,178,633,520920
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 425 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 772 edges and 499 vertex of which 467 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 466 transition count 257
Reduce places removed 250 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 265 rules applied. Total rules applied 517 place count 216 transition count 242
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 522 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 523 place count 211 transition count 241
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 523 place count 211 transition count 183
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 639 place count 153 transition count 183
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 668 place count 124 transition count 154
Iterating global reduction 4 with 29 rules applied. Total rules applied 697 place count 124 transition count 154
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 811 place count 67 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 813 place count 66 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 814 place count 65 transition count 95
Applied a total of 814 rules in 46 ms. Remains 65 /504 variables (removed 439) and now considering 95/517 (removed 422) transitions.
// Phase 1: matrix 95 rows 65 cols
[2025-06-03 17:43:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 17:43:22] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:43:22] [INFO ] Redundant transitions in 3 ms returned []
Running 66 sub problems to find dead transitions.
[2025-06-03 17:43:22] [INFO ] Invariant cache hit.
[2025-06-03 17:43:22] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 94/131 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 28/159 variables, 28/65 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 1/160 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/160 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 66 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3833 ms.
Refiners :[State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 94/131 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 28/159 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 56/131 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/160 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 132 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3801 ms.
Refiners :[State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7653ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 7654ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/504 places, 95/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7845 ms. Remains : 65/504 places, 95/517 transitions.
[2025-06-03 17:43:30] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:43:30] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:43:30] [INFO ] Input system was already deterministic with 95 transitions.
[2025-06-03 17:43:30] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:43:30] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:43:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1189612872620687615.gal : 2 ms
[2025-06-03 17:43:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12405236190863179834.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/CTLFireability1189612872620687615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12405236190863179834.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,4.0619e+15,2.24785,49264,2,3933,5,317831,6,0,355,175135,0


Converting to forward existential form...Done !
original formula: AF(!(A(AF((p102==1)) U (p504==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((p504==1)) U (!(!(EG(!((p102==1))))) * !((p504==1)))) + EG(!((p504==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t10, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39, t...317
Detected timeout of ITS tools.
[2025-06-03 17:44:00] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:44:00] [INFO ] Applying decomposition
[2025-06-03 17:44:00] [INFO ] Flatten gal took : 2 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/graph3933196301213967096.txt' '-o' '/tmp/graph3933196301213967096.bin' '-w' '/tmp/graph3933196301213967096.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3933196301213967096.bin' '-l' '-1' '-v' '-w' '/tmp/graph3933196301213967096.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:44:00] [INFO ] Decomposing Gal with order
[2025-06-03 17:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:44:00] [INFO ] Removed a total of 53 redundant transitions.
[2025-06-03 17:44:00] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2025-06-03 17:44:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11589063883666615117.gal : 1 ms
[2025-06-03 17:44:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9252203003572234021.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/CTLFireability11589063883666615117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9252203003572234021.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,4.0619e+15,1.02821,31572,527,232,65661,1639,204,95201,33,11807,0


Converting to forward existential form...Done !
original formula: AF(!(A(AF((i3.u4.p102==1)) U (u27.p504==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((u27.p504==1)) U (!(!(EG(!((i3.u4.p102==1))))) * !((u27.p504==1)))) + EG(!((u27.p504==1)))...169
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t13, t17, t19, t21, t23, t25, t29, t31, t33, t35, t39, t41, t43, t45, t47, t51, t53,...354
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 23
(forward)formula 0,1,5.53896,189268,1,0,465890,15803,1062,578008,194,115820,570334
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 422 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 772 edges and 499 vertex of which 467 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 249 transitions
Trivial Post-agglo rules discarded 249 transitions
Performed 249 trivial Post agglomeration. Transition count delta: 249
Iterating post reduction 0 with 249 rules applied. Total rules applied 251 place count 466 transition count 258
Reduce places removed 249 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 264 rules applied. Total rules applied 515 place count 217 transition count 243
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 520 place count 213 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 521 place count 212 transition count 242
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 521 place count 212 transition count 186
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 633 place count 156 transition count 186
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 663 place count 126 transition count 156
Iterating global reduction 4 with 30 rules applied. Total rules applied 693 place count 126 transition count 156
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 805 place count 70 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 807 place count 69 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 808 place count 68 transition count 98
Applied a total of 808 rules in 42 ms. Remains 68 /504 variables (removed 436) and now considering 98/517 (removed 419) transitions.
// Phase 1: matrix 98 rows 68 cols
[2025-06-03 17:44:05] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 17:44:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 17:44:05] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:44:06] [INFO ] Redundant transitions in 3 ms returned []
Running 95 sub problems to find dead transitions.
[2025-06-03 17:44:06] [INFO ] Invariant cache hit.
[2025-06-03 17:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 97/162 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 3/165 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 1/166 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 69 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6042 ms.
Refiners :[State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 97/162 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 3/165 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 89/163 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 1/166 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 164 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6604 ms.
Refiners :[State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12684ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12685ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/504 places, 98/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12886 ms. Remains : 68/504 places, 98/517 transitions.
[2025-06-03 17:44:18] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:44:18] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:44:18] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-03 17:44:18] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:44:18] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:44:18] [INFO ] Time to serialize gal into /tmp/CTLFireability15363637387958057959.gal : 1 ms
[2025-06-03 17:44:18] [INFO ] Time to serialize properties into /tmp/CTLFireability5020790326945299548.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/CTLFireability15363637387958057959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5020790326945299548.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08995e+16,4.54975,97724,2,1592,5,637544,6,0,370,416241,0


Converting to forward existential form...Done !
original formula: E(AG(((p48!=1) + EF((((p490==1)&&(p549==1))&&(p564==1))))) U AG((p255!=1)))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(((p48!=1) + E(TRUE U (((p490==1)&&(p549==1))&&(p564==1)))))))) * !(E(TRUE U !((p255!=1)...169
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t7, t14, t16, t18, t20, t22, t25, t26, t28, t30, t32, t34, t36, t38, t40, t42, t4...316
(forward)formula 0,0,5.32265,97724,1,0,257,637544,223,119,2624,416241,243
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 424 edges and 504 vertex of which 5 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 774 edges and 500 vertex of which 468 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 253 place count 467 transition count 258
Reduce places removed 251 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 266 rules applied. Total rules applied 519 place count 216 transition count 243
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 524 place count 212 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 211 transition count 242
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 525 place count 211 transition count 184
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 641 place count 153 transition count 184
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 671 place count 123 transition count 154
Iterating global reduction 4 with 30 rules applied. Total rules applied 701 place count 123 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 702 place count 123 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 702 place count 123 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 704 place count 122 transition count 152
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 818 place count 65 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 820 place count 64 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 821 place count 63 transition count 93
Applied a total of 821 rules in 36 ms. Remains 63 /504 variables (removed 441) and now considering 93/517 (removed 424) transitions.
// Phase 1: matrix 93 rows 63 cols
[2025-06-03 17:44:24] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-03 17:44:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 17:44:24] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:44:24] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-03 17:44:24] [INFO ] Invariant cache hit.
[2025-06-03 17:44:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 92/127 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 28/155 variables, 28/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/156 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 64 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2794 ms.
Refiners :[State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 92/127 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 28/155 variables, 28/71 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 56/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 128 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3618 ms.
Refiners :[State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6422ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6422ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/504 places, 93/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6603 ms. Remains : 63/504 places, 93/517 transitions.
[2025-06-03 17:44:30] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:44:30] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:44:30] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-03 17:44:30] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:44:30] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:44:30] [INFO ] Time to serialize gal into /tmp/CTLFireability12934636308163442017.gal : 1 ms
[2025-06-03 17:44:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7837417709239476975.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/CTLFireability12934636308163442017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7837417709239476975.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37919e+15,3.33235,76632,2,1423,5,568168,6,0,345,272582,0


Converting to forward existential form...Done !
original formula: EF(EG(((p544==0) * AF((p108==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p544==0) * !(EG(!((p108==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t7, t9, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t39...315
(forward)formula 0,1,9.4869,184628,1,0,689,1.30291e+06,213,313,2265,1.05524e+06,736
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-04 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 : 504/504 places, 517/517 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 483 transition count 496
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 483 transition count 496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 483 transition count 494
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 473 transition count 484
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 473 transition count 484
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 72 place count 473 transition count 476
Applied a total of 72 rules in 38 ms. Remains 473 /504 variables (removed 31) and now considering 476/517 (removed 41) transitions.
// Phase 1: matrix 476 rows 473 cols
[2025-06-03 17:44:40] [INFO ] Computed 29 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:40] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-03 17:44:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:44:41] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2025-06-03 17:44:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 476/948 variables, 472/501 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 948/949 variables, and 501 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/473 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 476/948 variables, 472/501 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/948 variables, 475/976 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/949 variables, and 976 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/473 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 473/504 places, 476/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61309 ms. Remains : 473/504 places, 476/517 transitions.
[2025-06-03 17:45:41] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:45:41] [INFO ] Flatten gal took : 16 ms
[2025-06-03 17:45:41] [INFO ] Input system was already deterministic with 476 transitions.
[2025-06-03 17:45:41] [INFO ] Flatten gal took : 31 ms
[2025-06-03 17:45:41] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:45:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3744048546699315488.gal : 4 ms
[2025-06-03 17:45:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13378398254190350943.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/CTLFireability3744048546699315488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13378398254190350943.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.
Detected timeout of ITS tools.
[2025-06-03 17:46:11] [INFO ] Flatten gal took : 10 ms
[2025-06-03 17:46:11] [INFO ] Applying decomposition
[2025-06-03 17:46:11] [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/graph840588242994895572.txt' '-o' '/tmp/graph840588242994895572.bin' '-w' '/tmp/graph840588242994895572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph840588242994895572.bin' '-l' '-1' '-v' '-w' '/tmp/graph840588242994895572.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:46:11] [INFO ] Decomposing Gal with order
[2025-06-03 17:46:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:46:11] [INFO ] Removed a total of 147 redundant transitions.
[2025-06-03 17:46:11] [INFO ] Flatten gal took : 42 ms
[2025-06-03 17:46:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 17:46:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6129615643814707044.gal : 8 ms
[2025-06-03 17:46:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10364245398246424774.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/CTLFireability6129615643814707044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10364245398246424774.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.06104e+34,0.505221,19364,1300,26,32650,270,707,41646,38,497,0


Converting to forward existential form...Done !
original formula: AX(E(EF(EX((i24.i0.i0.u0.p0!=1))) U ((i21.u143.p399==1)||(i16.u113.p308==1))))
=> equivalent forward existential formula: [(EY(Init) * !(E(E(TRUE U EX((i24.i0.i0.u0.p0!=1))) U ((i21.u143.p399==1)||(i16.u113.p308==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t418, i0.t76, i0.t69, i2.t413, i2.t406, i3.t400, i3.t393, i4.t386, i4.u27.t379, i5.t372, i5.t...836
(forward)formula 0,1,1.68989,52900,1,0,84618,283,4817,195022,169,748,325600
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 425 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 772 edges and 499 vertex of which 467 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 251 transitions
Trivial Post-agglo rules discarded 251 transitions
Performed 251 trivial Post agglomeration. Transition count delta: 251
Iterating post reduction 0 with 251 rules applied. Total rules applied 253 place count 466 transition count 256
Reduce places removed 251 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 265 rules applied. Total rules applied 518 place count 215 transition count 242
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 524 place count 212 transition count 239
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 528 place count 209 transition count 238
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 528 place count 209 transition count 180
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 644 place count 151 transition count 180
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 673 place count 122 transition count 151
Iterating global reduction 4 with 29 rules applied. Total rules applied 702 place count 122 transition count 151
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 816 place count 65 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 818 place count 64 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 819 place count 63 transition count 92
Applied a total of 819 rules in 39 ms. Remains 63 /504 variables (removed 441) and now considering 92/517 (removed 425) transitions.
// Phase 1: matrix 92 rows 63 cols
[2025-06-03 17:46:13] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:46:13] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-03 17:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 17:46:13] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:46:13] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-03 17:46:13] [INFO ] Invariant cache hit.
[2025-06-03 17:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 91/126 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 28/154 variables, 28/63 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 1/155 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 64 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3591 ms.
Refiners :[State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 91/126 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 28/154 variables, 28/70 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 56/126 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/155 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 127 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3473 ms.
Refiners :[State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7070ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 7071ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/504 places, 92/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7298 ms. Remains : 63/504 places, 92/517 transitions.
[2025-06-03 17:46:20] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:46:20] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:46:20] [INFO ] Input system was already deterministic with 92 transitions.
[2025-06-03 17:46:20] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:46:20] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:46:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11730358791524045303.gal : 1 ms
[2025-06-03 17:46:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12134616254827579082.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/CTLFireability11730358791524045303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12134616254827579082.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,2.73166e+15,3.20756,77480,2,1400,5,581338,6,0,344,271994,0


Converting to forward existential form...Done !
original formula: AG(EF(!(E((p522==1) U (p327==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((p522==1) U (p327==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t7, t8, t10, t12, t15, t16, t18, t20, t22, t24, t26, t28, t31, t32, t34, t36, t38...315
(forward)formula 0,1,3.5343,77480,1,0,245,581338,208,108,2283,271994,219
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 482 transition count 495
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 482 transition count 495
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 482 transition count 492
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 472 transition count 482
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 472 transition count 482
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 75 place count 472 transition count 474
Applied a total of 75 rules in 40 ms. Remains 472 /504 variables (removed 32) and now considering 474/517 (removed 43) transitions.
// Phase 1: matrix 474 rows 472 cols
[2025-06-03 17:46:24] [INFO ] Computed 29 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:46:24] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-03 17:46:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:46:25] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2025-06-03 17:46:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 945/946 variables, and 500 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 471/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 945/946 variables, and 973 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 471/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 472/504 places, 474/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60916 ms. Remains : 472/504 places, 474/517 transitions.
[2025-06-03 17:47:25] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:47:25] [INFO ] Flatten gal took : 16 ms
[2025-06-03 17:47:25] [INFO ] Input system was already deterministic with 474 transitions.
[2025-06-03 17:47:25] [INFO ] Flatten gal took : 16 ms
[2025-06-03 17:47:25] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:47:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1029474318331270862.gal : 4 ms
[2025-06-03 17:47:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14299604424626288214.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/CTLFireability1029474318331270862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14299604424626288214.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.
Detected timeout of ITS tools.
[2025-06-03 17:47:55] [INFO ] Flatten gal took : 9 ms
[2025-06-03 17:47:55] [INFO ] Applying decomposition
[2025-06-03 17:47:55] [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/graph15922946611829155121.txt' '-o' '/tmp/graph15922946611829155121.bin' '-w' '/tmp/graph15922946611829155121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15922946611829155121.bin' '-l' '-1' '-v' '-w' '/tmp/graph15922946611829155121.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:47:55] [INFO ] Decomposing Gal with order
[2025-06-03 17:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:47:55] [INFO ] Removed a total of 70 redundant transitions.
[2025-06-03 17:47:55] [INFO ] Flatten gal took : 53 ms
[2025-06-03 17:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 17:47:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12531700379534570727.gal : 6 ms
[2025-06-03 17:47:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16835698798857587930.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/CTLFireability12531700379534570727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16835698798857587930.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 418 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 772 edges and 499 vertex of which 467 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 466 transition count 264
Reduce places removed 243 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 255 rules applied. Total rules applied 500 place count 223 transition count 252
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 507 place count 220 transition count 248
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 511 place count 216 transition count 248
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 511 place count 216 transition count 193
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 621 place count 161 transition count 193
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 650 place count 132 transition count 164
Iterating global reduction 4 with 29 rules applied. Total rules applied 679 place count 132 transition count 164
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 793 place count 75 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 795 place count 74 transition count 106
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 798 place count 74 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 799 place count 73 transition count 105
Applied a total of 799 rules in 44 ms. Remains 73 /504 variables (removed 431) and now considering 105/517 (removed 412) transitions.
// Phase 1: matrix 105 rows 73 cols
[2025-06-03 17:48:25] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:48:25] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-03 17:48:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:48:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 17:48:26] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:48:26] [INFO ] Redundant transitions in 3 ms returned []
Running 73 sub problems to find dead transitions.
[2025-06-03 17:48:26] [INFO ] Invariant cache hit.
[2025-06-03 17:48:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 104/149 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 28/177 variables, 28/73 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 74 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4605 ms.
Refiners :[State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 104/149 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 28/177 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 58/146 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 1/178 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 147 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4788 ms.
Refiners :[State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9403ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 9403ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/504 places, 105/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9615 ms. Remains : 73/504 places, 105/517 transitions.
[2025-06-03 17:48:35] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:48:35] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:48:35] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-03 17:48:35] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:48:35] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:48:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4181643741134830887.gal : 1 ms
[2025-06-03 17:48:35] [INFO ] Time to serialize properties into /tmp/CTLFireability1625539762104080564.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/CTLFireability4181643741134830887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1625539762104080564.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,3.14396e+16,4.07949,87348,2,11391,5,520366,6,0,396,363028,0


Converting to forward existential form...Done !
original formula: (EF((p391==1)) * EF((((AG((E((p521==1) U (p183==1)) + EF((p415==1)))) * AF((p345==1))) * (p78==0)) + (p373==1))))
=> equivalent forward existential formula: ([(((FwdU((Init * E(TRUE U (p391==1))),TRUE) * (p78==0)) * !(E(TRUE U !((E((p521==1) U (p183==1)) + E(TRUE U (p4...268
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t10, t15, t17, t23, t25, t27, t30, t32, t34, t36, t38, t40, t42, t44, t46, t4...317
Detected timeout of ITS tools.
[2025-06-03 17:49:05] [INFO ] Flatten gal took : 2 ms
[2025-06-03 17:49:05] [INFO ] Applying decomposition
[2025-06-03 17:49:05] [INFO ] Flatten gal took : 2 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/graph4319791436273810064.txt' '-o' '/tmp/graph4319791436273810064.bin' '-w' '/tmp/graph4319791436273810064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4319791436273810064.bin' '-l' '-1' '-v' '-w' '/tmp/graph4319791436273810064.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:49:05] [INFO ] Decomposing Gal with order
[2025-06-03 17:49:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:49:05] [INFO ] Removed a total of 54 redundant transitions.
[2025-06-03 17:49:05] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:49:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2025-06-03 17:49:05] [INFO ] Time to serialize gal into /tmp/CTLFireability568114926445273184.gal : 1 ms
[2025-06-03 17:49:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10670882326094190347.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/CTLFireability568114926445273184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10670882326094190347.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,3.14396e+16,7.9861,168596,594,241,156913,2952,216,1.57612e+06,43,26115,0


Converting to forward existential form...Done !
original formula: (EF((i15.u21.p391==1)) * EF((((AG((E((i21.u30.p521==1) U (u8.p183==1)) + EF((i16.u24.p415==1)))) * AF((u17.p345==1))) * (u2.p78==0)) + (i...173
=> equivalent forward existential formula: ([(((FwdU((Init * E(TRUE U (i15.u21.p391==1))),TRUE) * (u2.p78==0)) * !(E(TRUE U !((E((i21.u30.p521==1) U (u8.p1...318
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t15, t17, t23, t27, t30, t32, t34, t36, t38, t40, t44, t46, t48, t53, t58, t61, t64,...365
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 485 transition count 498
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 485 transition count 498
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 485 transition count 495
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 477 transition count 487
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 477 transition count 487
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 64 place count 477 transition count 480
Applied a total of 64 rules in 39 ms. Remains 477 /504 variables (removed 27) and now considering 480/517 (removed 37) transitions.
// Phase 1: matrix 480 rows 477 cols
[2025-06-03 17:49:35] [INFO ] Computed 29 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:49:35] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-03 17:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:49:36] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2025-06-03 17:49: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/476 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 480/956 variables, 476/505 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 956/957 variables, and 505 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/477 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 480/956 variables, 476/505 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/956 variables, 479/984 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 956/957 variables, and 984 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 476/477 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 477/504 places, 480/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60895 ms. Remains : 477/504 places, 480/517 transitions.
[2025-06-03 17:50:36] [INFO ] Flatten gal took : 10 ms
[2025-06-03 17:50:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 17:50:36] [INFO ] Input system was already deterministic with 480 transitions.
[2025-06-03 17:50:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 17:50:36] [INFO ] Flatten gal took : 9 ms
[2025-06-03 17:50:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13940693832190731521.gal : 2 ms
[2025-06-03 17:50:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8373483812760354759.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/CTLFireability13940693832190731521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8373483812760354759.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.
Detected timeout of ITS tools.
[2025-06-03 17:51:06] [INFO ] Flatten gal took : 9 ms
[2025-06-03 17:51:06] [INFO ] Applying decomposition
[2025-06-03 17:51:06] [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/graph6436528059847162845.txt' '-o' '/tmp/graph6436528059847162845.bin' '-w' '/tmp/graph6436528059847162845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6436528059847162845.bin' '-l' '-1' '-v' '-w' '/tmp/graph6436528059847162845.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:51:06] [INFO ] Decomposing Gal with order
[2025-06-03 17:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:51:06] [INFO ] Removed a total of 149 redundant transitions.
[2025-06-03 17:51:06] [INFO ] Flatten gal took : 27 ms
[2025-06-03 17:51:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 17:51:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7613319479350515356.gal : 7 ms
[2025-06-03 17:51:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15021251499778301694.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/CTLFireability7613319479350515356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15021251499778301694.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.21711e+34,0.54108,15912,1104,25,24707,291,716,28843,36,564,0


Converting to forward existential form...Done !
original formula: (AG((AF((AG((i30.u194.p551==1)) * (i19.i0.u125.p342==1))) + ((((((i2.i0.u15.p35==0)&&(i15.i0.u97.p270==1))&&(i22.i0.u142.p399==1)) + EX((...450
=> equivalent forward existential formula: [FwdG((FwdU((Init * !(EG(!(EX(!((i30.u198.p539==1))))))),TRUE) * !(((((((i2.i0.u15.p35==0)&&(i15.i0.u97.p270==1)...532
Reverse transition relation is NOT exact ! Due to transitions t3, t422, i2.t417, i2.i1.t410, i3.t404, i3.i2.t397, i4.t390, i4.i1.u32.t383, i5.t376, i5.i2.t...931
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 a local SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
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
(forward)formula 0,0,3.50795,106408,1,0,229925,305,6227,213179,210,853,580748
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 426 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 772 edges and 499 vertex of which 467 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 466 transition count 257
Reduce places removed 250 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 265 rules applied. Total rules applied 517 place count 216 transition count 242
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 521 place count 212 transition count 242
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 521 place count 212 transition count 184
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 637 place count 154 transition count 184
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 666 place count 125 transition count 155
Iterating global reduction 3 with 29 rules applied. Total rules applied 695 place count 125 transition count 155
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 809 place count 68 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 811 place count 67 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 812 place count 66 transition count 96
Applied a total of 812 rules in 29 ms. Remains 66 /504 variables (removed 438) and now considering 96/517 (removed 421) transitions.
// Phase 1: matrix 96 rows 66 cols
[2025-06-03 17:51:10] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:10] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 17:51:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 17:51:10] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:51:10] [INFO ] Redundant transitions in 2 ms returned []
Running 67 sub problems to find dead transitions.
[2025-06-03 17:51:10] [INFO ] Invariant cache hit.
[2025-06-03 17:51:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 95/133 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 28/161 variables, 28/66 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 1/162 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 67 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3923 ms.
Refiners :[State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 95/133 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 28/161 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 56/133 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 134 constraints, problems are : Problem set: 0 solved, 67 unsolved in 4242 ms.
Refiners :[State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8170ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 8172ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/504 places, 96/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8339 ms. Remains : 66/504 places, 96/517 transitions.
[2025-06-03 17:51:18] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:18] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:18] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-03 17:51:18] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:18] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:18] [INFO ] Time to serialize gal into /tmp/CTLFireability18191549423932580328.gal : 1 ms
[2025-06-03 17:51:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16475159524127729555.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/CTLFireability18191549423932580328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16475159524127729555.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,5.05069e+15,3.23422,83024,2,1539,5,619914,6,0,360,291749,0


Converting to forward existential form...Done !
original formula: EF((AF((p397==1)) + (p41==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!((p397==1)))))] != FALSE + [(FwdU(Init,TRUE) * (p41==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t10, t13, t15, t17, t19, t21, t23, t25, t27, t30, t31, t33, t35, t37, t39, t41, t...317
(forward)formula 0,1,7.71407,152840,1,0,684,1.05622e+06,214,316,2333,956040,748
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 419 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 772 edges and 499 vertex of which 467 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 246 transitions
Trivial Post-agglo rules discarded 246 transitions
Performed 246 trivial Post agglomeration. Transition count delta: 246
Iterating post reduction 0 with 246 rules applied. Total rules applied 248 place count 466 transition count 261
Reduce places removed 246 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 261 rules applied. Total rules applied 509 place count 220 transition count 246
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 515 place count 216 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 517 place count 214 transition count 244
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 517 place count 214 transition count 186
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 633 place count 156 transition count 186
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 663 place count 126 transition count 156
Iterating global reduction 4 with 30 rules applied. Total rules applied 693 place count 126 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 694 place count 126 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 694 place count 126 transition count 154
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 696 place count 125 transition count 154
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 5 with 112 rules applied. Total rules applied 808 place count 69 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 810 place count 68 transition count 97
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 812 place count 68 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 813 place count 67 transition count 96
Applied a total of 813 rules in 56 ms. Remains 67 /504 variables (removed 437) and now considering 96/517 (removed 421) transitions.
// Phase 1: matrix 96 rows 67 cols
[2025-06-03 17:51:26] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-03 17:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 17:51:26] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:51:26] [INFO ] Redundant transitions in 3 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-03 17:51:26] [INFO ] Invariant cache hit.
[2025-06-03 17:51:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 95/134 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 28/162 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 68 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3842 ms.
Refiners :[State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 95/134 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 28/162 variables, 28/80 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 52/132 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 133 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4230 ms.
Refiners :[State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8081ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 8081ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/504 places, 96/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8323 ms. Remains : 67/504 places, 96/517 transitions.
[2025-06-03 17:51:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:34] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-03 17:51:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:34] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8919565018405625649.gal : 1 ms
[2025-06-03 17:51:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7936838724443568930.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/CTLFireability8919565018405625649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7936838724443568930.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,7.84075e+15,1.07353,25608,2,2047,5,159365,6,0,363,90696,0


Converting to forward existential form...Done !
original formula: (AF((p248==1)) * AF((EF(((p108==1)&&(p68==1))) + AF(((p273==1)&&(p189==1))))))
=> equivalent forward existential formula: ([FwdG(Init,!((p248==1)))] = FALSE * [FwdG(Init,!((E(TRUE U ((p108==1)&&(p68==1))) + !(EG(!(((p273==1)&&(p189==1...173
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t9, t11, t13, t16, t18, t20, t22, t24, t27, t29, t31, t34, t36, t38, t40, t42...320
Hit Full ! (commute/partial/dont) 94/0/2
(forward)formula 0,0,16.9427,413172,1,0,705,2.67284e+06,232,324,2554,2.77904e+06,781
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (trivial) has 428 edges and 504 vertex of which 6 / 504 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 772 edges and 499 vertex of which 467 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 466 transition count 255
Reduce places removed 252 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 267 rules applied. Total rules applied 521 place count 214 transition count 240
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 525 place count 210 transition count 240
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 525 place count 210 transition count 182
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 641 place count 152 transition count 182
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 670 place count 123 transition count 153
Iterating global reduction 3 with 29 rules applied. Total rules applied 699 place count 123 transition count 153
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 813 place count 66 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 815 place count 65 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 816 place count 64 transition count 94
Applied a total of 816 rules in 19 ms. Remains 64 /504 variables (removed 440) and now considering 94/517 (removed 423) transitions.
// Phase 1: matrix 94 rows 64 cols
[2025-06-03 17:51:51] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 17:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 17:51:52] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:51:52] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-03 17:51:52] [INFO ] Invariant cache hit.
[2025-06-03 17:51:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 93/129 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 28/157 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/158 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 65 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3269 ms.
Refiners :[State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 93/129 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 28/157 variables, 28/73 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 56/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 1/158 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 130 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3901 ms.
Refiners :[State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7180ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 7181ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/504 places, 94/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7350 ms. Remains : 64/504 places, 94/517 transitions.
[2025-06-03 17:51:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:59] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-03 17:51:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:51:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5225531832794625234.gal : 1 ms
[2025-06-03 17:51:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12712435780192217609.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5225531832794625234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12712435780192217609.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 1172 steps (27 resets) in 60 ms. (19 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Graph (complete) has 778 edges and 504 vertex of which 472 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 251 place count 471 transition count 263
Reduce places removed 250 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 268 rules applied. Total rules applied 519 place count 221 transition count 245
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 525 place count 215 transition count 245
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 525 place count 215 transition count 188
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 639 place count 158 transition count 188
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 669 place count 128 transition count 158
Iterating global reduction 3 with 30 rules applied. Total rules applied 699 place count 128 transition count 158
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 811 place count 72 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 813 place count 71 transition count 101
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 814 place count 71 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 815 place count 70 transition count 100
Applied a total of 815 rules in 28 ms. Remains 70 /504 variables (removed 434) and now considering 100/517 (removed 417) transitions.
// Phase 1: matrix 100 rows 70 cols
[2025-06-03 17:51:59] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-03 17:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:51:59] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 17:51:59] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2025-06-03 17:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 100/167 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 3/170 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 0/170 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 70 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4606 ms.
Refiners :[State Equation: 70/70 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 100/167 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 3/170 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 90/167 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/170 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 167 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5527 ms.
Refiners :[State Equation: 70/70 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10148ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10148ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/504 places, 100/517 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10402 ms. Remains : 70/504 places, 100/517 transitions.
[2025-06-03 17:52:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:52:09] [INFO ] Flatten gal took : 7 ms
[2025-06-03 17:52:09] [INFO ] Input system was already deterministic with 100 transitions.
[2025-06-03 17:52:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:52:09] [INFO ] Flatten gal took : 4 ms
[2025-06-03 17:52:09] [INFO ] Time to serialize gal into /tmp/CTLFireability17952495351992243693.gal : 1 ms
[2025-06-03 17:52:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2596686396726319937.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/CTLFireability17952495351992243693.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2596686396726319937.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.
Detected timeout of ITS tools.
[2025-06-03 17:52:39] [INFO ] Flatten gal took : 3 ms
[2025-06-03 17:52:39] [INFO ] Applying decomposition
[2025-06-03 17:52:39] [INFO ] Flatten gal took : 2 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/graph18143292371035764156.txt' '-o' '/tmp/graph18143292371035764156.bin' '-w' '/tmp/graph18143292371035764156.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18143292371035764156.bin' '-l' '-1' '-v' '-w' '/tmp/graph18143292371035764156.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:52:39] [INFO ] Decomposing Gal with order
[2025-06-03 17:52:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:52:39] [INFO ] Removed a total of 82 redundant transitions.
[2025-06-03 17:52:39] [INFO ] Flatten gal took : 6 ms
[2025-06-03 17:52:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2025-06-03 17:52:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13571304464230330193.gal : 1 ms
[2025-06-03 17:52:39] [INFO ] Time to serialize properties into /tmp/CTLFireability9682965500544441636.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/CTLFireability13571304464230330193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9682965500544441636.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,1.33143e+16,3.27544,74000,637,229,75248,2710,220,623114,26,20971,0


Converting to forward existential form...Done !
original formula: AG(((i12.u17.p305==0) + (AF((i4.u5.p109==1)) * ((i23.u30.p541==1) + EF((((u16.p310==1)&&(i23.u31.p549==1))&&(i23.u32.p564==1)))))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !((i12.u17.p305==0))),!((i4.u5.p109==1)))] = FALSE * [(((FwdU(Init,TRUE) * !((i12.u17....271
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t16, t19, t20, t24, t26, t30, t34, t36, t40, t44, t47, t48, t50, t56, t58, t60, t62...381
(forward)formula 0,0,4.12523,74000,1,0,75248,9501,1043,623114,149,77184,51190
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 483 transition count 496
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 483 transition count 496
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 483 transition count 493
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 474 transition count 484
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 474 transition count 484
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 474 transition count 477
Applied a total of 70 rules in 137 ms. Remains 474 /504 variables (removed 30) and now considering 477/517 (removed 40) transitions.
// Phase 1: matrix 477 rows 474 cols
[2025-06-03 17:52:44] [INFO ] Computed 29 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:52:44] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-03 17:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:52:44] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2025-06-03 17:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 950/951 variables, and 502 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 43)
(t1 9)
(t2 8)
(t3 38)
(t4 1)
(t5 8)
(t6 36)
(t7 3)
(t8 1)
(t9 0)
(t10 1)
(t11 44)
(t12 42)
(t13 45)
(t14 36)
(t15 2)
(t16 1)
(t17 39)
(t18 38)
(t19 1)
(t20 1)
(t21 1)
(t22 44)
(t23 44)
(t24 0)
(t25 41)
(t26 40)
(t27 13)
(t28 12)
(t29 11)
(t30 10)
(t31 9)
(t32 3)
(t33 2)
(t34 1)
(t35 13)
(t36 7)
(t37 6)
(t38 5)
(t39 40)
(t40 39)
(t41 38)
(t42 36)
(t43 35)
(t44 34)
(t45 33)
(t46 0)
(t47 0)
(t48 0)
(t49 37)
(t50 1)
(t51 1)
(t52 0)
(t53 39)
(t54 7)
(t55 6)
(t56 5)
(t57 4)
(t58 3)
(t59 2)
(t60 0)
(t61 0)
(t62 1)
(t63 6)
(t64 1)
(t65 1)
(t66 1)
(t67 38)
(t68 37)
(t69 36)
(t70 34)
(t71 34)
(t72 3)
(t73 2)
(t74 0)
(t75 0)
(t76 0)
(t77 35)
(t78 0)
(t79 0)
(t80 0)
(t81 38)
(t82 37)
(t83 36)
(t84 35)
(t85 4)
(t86 3)
(t87 2)
(t88 0)
(t89 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/951 variables, and 978 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 474/504 places, 477/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61065 ms. Remains : 474/504 places, 477/517 transitions.
[2025-06-03 17:53:45] [INFO ] Flatten gal took : 17 ms
[2025-06-03 17:53:45] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:53:45] [INFO ] Input system was already deterministic with 477 transitions.
[2025-06-03 17:53:45] [INFO ] Flatten gal took : 15 ms
[2025-06-03 17:53:45] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:53:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4225386187341926472.gal : 4 ms
[2025-06-03 17:53:45] [INFO ] Time to serialize properties into /tmp/CTLFireability15455406403664335429.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/CTLFireability4225386187341926472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15455406403664335429.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.
Detected timeout of ITS tools.
[2025-06-03 17:54:15] [INFO ] Flatten gal took : 8 ms
[2025-06-03 17:54:15] [INFO ] Applying decomposition
[2025-06-03 17:54:15] [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/graph14563303606512123648.txt' '-o' '/tmp/graph14563303606512123648.bin' '-w' '/tmp/graph14563303606512123648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14563303606512123648.bin' '-l' '-1' '-v' '-w' '/tmp/graph14563303606512123648.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:54:15] [INFO ] Decomposing Gal with order
[2025-06-03 17:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:54:15] [INFO ] Removed a total of 66 redundant transitions.
[2025-06-03 17:54:15] [INFO ] Flatten gal took : 22 ms
[2025-06-03 17:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 17:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14617224553090387265.gal : 6 ms
[2025-06-03 17:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1908957523468215618.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/CTLFireability14617224553090387265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1908957523468215618.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 517/517 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 484 transition count 497
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 484 transition count 497
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 484 transition count 495
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 475 transition count 486
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 475 transition count 486
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 67 place count 475 transition count 479
Applied a total of 67 rules in 241 ms. Remains 475 /504 variables (removed 29) and now considering 479/517 (removed 38) transitions.
// Phase 1: matrix 479 rows 475 cols
[2025-06-03 17:54:45] [INFO ] Computed 29 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:45] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-03 17:54:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 17:54:46] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 478 sub problems to find dead transitions.
[2025-06-03 17:54:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 479/953 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 478 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 953/954 variables, and 503 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 479/953 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/953 variables, 478/981 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/954 variables, and 981 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 475/504 places, 479/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61228 ms. Remains : 475/504 places, 479/517 transitions.
[2025-06-03 17:55:46] [INFO ] Flatten gal took : 15 ms
[2025-06-03 17:55:46] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:55:46] [INFO ] Input system was already deterministic with 479 transitions.
[2025-06-03 17:55:46] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:55:46] [INFO ] Flatten gal took : 14 ms
[2025-06-03 17:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13842454229982690364.gal : 3 ms
[2025-06-03 17:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2296113699783815614.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/CTLFireability13842454229982690364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2296113699783815614.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.
Detected timeout of ITS tools.
[2025-06-03 17:56:16] [INFO ] Flatten gal took : 8 ms
[2025-06-03 17:56:16] [INFO ] Applying decomposition
[2025-06-03 17:56:16] [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/graph11853958251197344588.txt' '-o' '/tmp/graph11853958251197344588.bin' '-w' '/tmp/graph11853958251197344588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11853958251197344588.bin' '-l' '-1' '-v' '-w' '/tmp/graph11853958251197344588.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:56:16] [INFO ] Decomposing Gal with order
[2025-06-03 17:56:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:56:16] [INFO ] Removed a total of 66 redundant transitions.
[2025-06-03 17:56:16] [INFO ] Flatten gal took : 24 ms
[2025-06-03 17:56:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 17:56:16] [INFO ] Time to serialize gal into /tmp/CTLFireability732059443490222424.gal : 5 ms
[2025-06-03 17:56:16] [INFO ] Time to serialize properties into /tmp/CTLFireability18252635163577601604.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/CTLFireability732059443490222424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18252635163577601604.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.
Detected timeout of ITS tools.
[2025-06-03 17:56:47] [INFO ] Flatten gal took : 15 ms
[2025-06-03 17:56:47] [INFO ] Flatten gal took : 15 ms
[2025-06-03 17:56:47] [INFO ] Applying decomposition
[2025-06-03 17:56:47] [INFO ] Flatten gal took : 15 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/graph3083725624190132685.txt' '-o' '/tmp/graph3083725624190132685.bin' '-w' '/tmp/graph3083725624190132685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3083725624190132685.bin' '-l' '-1' '-v' '-w' '/tmp/graph3083725624190132685.weights' '-q' '0' '-e' '0.001'
[2025-06-03 17:56:47] [INFO ] Decomposing Gal with order
[2025-06-03 17:56:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 17:56:47] [INFO ] Removed a total of 139 redundant transitions.
[2025-06-03 17:56:47] [INFO ] Flatten gal took : 35 ms
[2025-06-03 17:56:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-06-03 17:56:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12459647235450084994.gal : 20 ms
[2025-06-03 17:56:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15760009127479642356.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/CTLFireability12459647235450084994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15760009127479642356.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 -...264
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,3.39666e+35,2.15921,47456,1878,32,79128,369,834,113987,35,875,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(((((i7.i1.u51.p131==0)&&(i6.i0.u43.p111==0))&&((i13.i0.u90.p232==1)&&(i0.i1.u210.p549==1)))&&(i0.i1.u214.p564==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(((((i7.i1.u51.p131==0)&&(i6.i0.u43.p111==0))&&((i13.i0.u90.p232==1)&&(i0.i...210
Reverse transition relation is NOT exact ! Due to transitions t26, t459, i0.t3, i0.i1.t11, i0.i1.t15, i0.i1.t29, i0.i1.u206.t28, i0.i1.u213.t6, i0.i1.u213....973
(forward)formula 0,1,4.51356,86240,1,0,137383,369,5453,216115,156,875,813847
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF((i22.i0.u150.p391==1)) * EF((((AG((E((i29.i2.u200.p521==1) U (i10.i0.u73.p183==1)) + EF((i23.i1.u160.p415==1)))) * AF((i19.i0.u130.p3...212
=> equivalent forward existential formula: ([(((FwdU((Init * E(TRUE U (i22.i0.u150.p391==1))),TRUE) * (i4.i1.u31.p78==0)) * !(E(TRUE U !((E((i29.i2.u200.p5...361
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
ITS-tools command line returned an error code 139
[2025-06-03 18:00:34] [INFO ] Applying decomposition
[2025-06-03 18:00:34] [INFO ] Flatten gal took : 9 ms
[2025-06-03 18:00:34] [INFO ] Decomposing Gal with order
[2025-06-03 18:00:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:00:34] [INFO ] Removed a total of 108 redundant transitions.
[2025-06-03 18:00:34] [INFO ] Flatten gal took : 16 ms
[2025-06-03 18:00:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 848 labels/synchronizations in 58 ms.
[2025-06-03 18:00:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6134026950197838252.gal : 5 ms
[2025-06-03 18:00:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9715547716860881182.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/CTLFireability6134026950197838252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9715547716860881182.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.39666e+35,1.52742,50968,567,383,85076,1678,587,310861,165,10145,0


Converting to forward existential form...Done !
original formula: (EF((i0.i0.i0.i0.i0.i0.i0.i0.i0.u49.p391==1)) * EF((((AG((E((i0.i0.u56.p521==1) U (i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....426
=> equivalent forward existential formula: ([(((FwdU((Init * E(TRUE U (i0.i0.i0.i0.i0.i0.i0.i0.i0.u49.p391==1))),TRUE) * (i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....594
Reverse transition relation is NOT exact ! Due to transitions t459, u58.t3, u58.t6, u58.t7, u58.t11, i0.u57.t15, i0.u57.t26, i0.u57.t28, i0.u57.t29, i0.i0....3398
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
(forward)formula 0,1,171.759,2200492,1,0,3.77107e+06,61932,2045,1.24866e+07,737,417614,544980
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AG(((AF((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u45.p323==1)) + !(E((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u46.p342==1) U (i0.i0.i0.i0.i...242
=> equivalent forward existential formula: [(FwdU(((FwdU(EY(Init),TRUE) * !((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u44.p316==0))) * !(!(EG(!((i0.i0.i0....303
(forward)formula 1,0,236.906,2200492,1,0,3.9843e+06,62138,2171,1.24866e+07,803,423763,1427759
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((E((EG(!((((i0.i0.u56.p526==1)&&(i0.u57.p549==1))&&(u58.p564==1)))) + EF((((i0.i0.u56.p517==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...532
=> equivalent forward existential formula: ([(FwdU(FwdU((FwdU(Init,TRUE) * (i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u37.p188==1)),(E...916
(forward)formula 2,1,341.761,2670836,1,0,4.85062e+06,65022,1808,1.50367e+07,675,457051,735866
FORMULA GPUForwardProgress-PT-28b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1644618 ms.

BK_STOP 1748973976874

--------------------
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="GPUForwardProgress-PT-28b"
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 GPUForwardProgress-PT-28b, 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 r100-smll-174867008000482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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