Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 8.4K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 205K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749262620374

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 02:17:01] [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-07 02:17:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 02:17:01] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-06-07 02:17:01] [INFO ] Transformed 216 places.
[2025-06-07 02:17:02] [INFO ] Transformed 977 transitions.
[2025-06-07 02:17:02] [INFO ] Found NUPN structural information;
[2025-06-07 02:17:02] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Support contains 123 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 829/829 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 200 transition count 785
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 200 transition count 785
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 44 place count 200 transition count 773
Applied a total of 44 rules in 38 ms. Remains 200 /216 variables (removed 16) and now considering 773/829 (removed 56) transitions.
[2025-06-07 02:17:02] [INFO ] Flow matrix only has 399 transitions (discarded 374 similar events)
// Phase 1: matrix 399 rows 200 cols
[2025-06-07 02:17:02] [INFO ] Computed 8 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:17:02] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-06-07 02:17:02] [INFO ] Flow matrix only has 399 transitions (discarded 374 similar events)
[2025-06-07 02:17:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:17:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-07 02:17:02] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 772 sub problems to find dead transitions.
[2025-06-07 02:17:02] [INFO ] Flow matrix only has 399 transitions (discarded 374 similar events)
[2025-06-07 02:17:02] [INFO ] Invariant cache hit.
[2025-06-07 02:17:02] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 3 (OVERLAPS) 398/598 variables, 200/208 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 40/248 constraints. Problems are: Problem set: 0 solved, 772 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/599 variables, and 248 constraints, problems are : Problem set: 0 solved, 772 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 200/200 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 772/772 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 772 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 3 (OVERLAPS) 398/598 variables, 200/208 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 40/248 constraints. Problems are: Problem set: 0 solved, 772 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 772/1020 constraints. Problems are: Problem set: 0 solved, 772 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 1020 constraints, problems are : Problem set: 0 solved, 772 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 200/200 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 772/772 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 772 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Starting structural reductions in LTL mode, iteration 1 : 200/216 places, 773/829 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60974 ms. Remains : 200/216 places, 773/829 transitions.
Support contains 123 out of 200 places after structural reductions.
[2025-06-07 02:18:03] [INFO ] Flatten gal took : 63 ms
[2025-06-07 02:18:03] [INFO ] Flatten gal took : 36 ms
[2025-06-07 02:18:03] [INFO ] Input system was already deterministic with 773 transitions.
RANDOM walk for 40000 steps (8 resets) in 2580 ms. (15 steps per ms) remains 16/113 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
[2025-06-07 02:18:04] [INFO ] Flow matrix only has 399 transitions (discarded 374 similar events)
[2025-06-07 02:18:04] [INFO ] Invariant cache hit.
[2025-06-07 02:18:04] [INFO ] State equation strengthened by 41 read => feed constraints.
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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 1 (OVERLAPS) 160/199 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 398/598 variables, 200/208 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 40/248 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 0/248 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/599 variables, 1/249 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 0/249 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/599 variables, 0/249 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 249 constraints, problems are : Problem set: 4 solved, 12 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 200/200 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 174/199 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 398/598 variables, 200/208 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 40/248 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 11/259 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 0/259 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/599 variables, 1/260 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/599 variables, 0/260 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/599 variables, 0/260 constraints. Problems are: Problem set: 5 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/599 variables, and 260 constraints, problems are : Problem set: 5 solved, 11 unsolved in 1857 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 200/200 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 11/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2710ms problems are : Problem set: 5 solved, 11 unsolved
Parikh walk visited 5 properties in 2407 ms.
Support contains 14 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 773/773 transitions.
Graph (trivial) has 282 edges and 200 vertex of which 66 / 200 are part of one of the 14 SCC in 2 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 197 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 269 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 0 with 4 rules applied. Total rules applied 5 place count 148 transition count 500
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 144 transition count 498
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 142 transition count 498
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 142 transition count 496
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 140 transition count 496
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 45 place count 112 transition count 388
Iterating global reduction 3 with 28 rules applied. Total rules applied 73 place count 112 transition count 388
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 100 place count 112 transition count 361
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 107 place count 105 transition count 341
Iterating global reduction 4 with 7 rules applied. Total rules applied 114 place count 105 transition count 341
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 123 place count 105 transition count 332
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 102 transition count 327
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 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 5 with 16 rules applied. Total rules applied 145 place count 102 transition count 311
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 148 place count 100 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 149 place count 99 transition count 310
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 150 place count 98 transition count 308
Iterating global reduction 8 with 1 rules applied. Total rules applied 151 place count 98 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 152 place count 98 transition count 307
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 164 place count 92 transition count 330
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 165 place count 92 transition count 329
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 173 place count 92 transition count 321
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 176 place count 89 transition count 318
Iterating global reduction 10 with 3 rules applied. Total rules applied 179 place count 89 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 181 place count 89 transition count 316
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 187 place count 89 transition count 310
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 199 place count 83 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 201 place count 83 transition count 302
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 205 place count 83 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 206 place count 82 transition count 301
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 54 edges and 80 vertex of which 15 / 80 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 12 with 3 rules applied. Total rules applied 209 place count 68 transition count 301
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 13 with 49 rules applied. Total rules applied 258 place count 68 transition count 252
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 260 place count 66 transition count 244
Iterating global reduction 14 with 2 rules applied. Total rules applied 262 place count 66 transition count 244
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 268 place count 63 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 269 place count 63 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 274 place count 63 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 276 place count 62 transition count 254
Applied a total of 276 rules in 165 ms. Remains 62 /200 variables (removed 138) and now considering 254/773 (removed 519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 62/200 places, 254/773 transitions.
RANDOM walk for 40000 steps (8 resets) in 300 ms. (132 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2025-06-07 02:18:09] [INFO ] Flow matrix only has 156 transitions (discarded 98 similar events)
// Phase 1: matrix 156 rows 62 cols
[2025-06-07 02:18:09] [INFO ] Computed 6 invariants in 1 ms
[2025-06-07 02:18:09] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 148/202 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 25/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 15/217 variables, 7/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/218 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 148/202 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 25/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 15/217 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/218 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/218 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 95 constraints, problems are : Problem set: 0 solved, 2 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 62 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 2 properties in 22 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-06-07 02:18:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-07 02:18:10] [INFO ] Flatten gal took : 43 ms
FORMULA UtahNoC-PT-none-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-07 02:18:10] [INFO ] Flatten gal took : 26 ms
[2025-06-07 02:18:10] [INFO ] Input system was already deterministic with 773 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 162 transition count 592
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 162 transition count 592
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 106 place count 162 transition count 562
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 115 place count 153 transition count 535
Iterating global reduction 1 with 9 rules applied. Total rules applied 124 place count 153 transition count 535
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 136 place count 153 transition count 523
Applied a total of 136 rules in 10 ms. Remains 153 /200 variables (removed 47) and now considering 523/773 (removed 250) transitions.
[2025-06-07 02:18:10] [INFO ] Flow matrix only has 277 transitions (discarded 246 similar events)
// Phase 1: matrix 277 rows 153 cols
[2025-06-07 02:18:10] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:10] [INFO ] Implicit Places using invariants in 56 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/200 places, 523/773 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 498
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 498
Applied a total of 10 rules in 5 ms. Remains 147 /152 variables (removed 5) and now considering 498/523 (removed 25) transitions.
[2025-06-07 02:18:10] [INFO ] Flow matrix only has 272 transitions (discarded 226 similar events)
// Phase 1: matrix 272 rows 147 cols
[2025-06-07 02:18:10] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 02:18:10] [INFO ] Flow matrix only has 272 transitions (discarded 226 similar events)
[2025-06-07 02:18:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-07 02:18:10] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/200 places, 498/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 147/200 places, 498/773 transitions.
[2025-06-07 02:18:10] [INFO ] Flatten gal took : 16 ms
[2025-06-07 02:18:10] [INFO ] Flatten gal took : 14 ms
[2025-06-07 02:18:10] [INFO ] Input system was already deterministic with 498 transitions.
[2025-06-07 02:18:10] [INFO ] Flatten gal took : 13 ms
[2025-06-07 02:18:10] [INFO ] Flatten gal took : 13 ms
[2025-06-07 02:18:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4969784451733250256.gal : 8 ms
[2025-06-07 02:18:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10326032912689760103.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4969784451733250256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10326032912689760103.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.89003e+08,1.61319,53616,2,5726,5,217228,6,0,1021,188648,0


Converting to forward existential form...Done !
original formula: EG(E(AG((E(((p131==1)&&(p147==1)) U (p148==1)) + (p72!=1))) U EX(EX(AG((p46==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(!(E(TRUE U !((E(((p131==1)&&(p147==1)) U (p148==1)) + (p72!=1))))) U EX(EX(!(E(TRUE U !((p46==1))))...169
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t23, t30, t34, t36, t43, t47, t49, t58, t60, t62, t70, t72, t74, t82, t84, t86, In...252
(forward)formula 0,0,8.0132,203396,1,0,638,951025,959,387,6961,866598,967
FORMULA UtahNoC-PT-none-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Graph (trivial) has 289 edges and 200 vertex of which 67 / 200 are part of one of the 13 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 194 edges and 144 vertex of which 22 / 144 are part of one of the 3 SCC in 0 ms
Free SCC test removed 19 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 599
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 77 place count 125 transition count 525
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 105 place count 97 transition count 395
Iterating global reduction 2 with 28 rules applied. Total rules applied 133 place count 97 transition count 395
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 167 place count 97 transition count 361
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 176 place count 88 transition count 338
Iterating global reduction 3 with 9 rules applied. Total rules applied 185 place count 88 transition count 338
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 197 place count 88 transition count 326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 86 transition count 324
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 86 transition count 320
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 207 place count 84 transition count 314
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 84 transition count 314
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 83 transition count 312
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 83 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 83 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 229 place count 83 transition count 294
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 83 transition count 294
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 233 place count 81 transition count 292
Iterating global reduction 6 with 2 rules applied. Total rules applied 235 place count 81 transition count 292
Applied a total of 235 rules in 44 ms. Remains 81 /200 variables (removed 119) and now considering 292/773 (removed 481) transitions.
[2025-06-07 02:18:18] [INFO ] Flow matrix only has 144 transitions (discarded 148 similar events)
// Phase 1: matrix 144 rows 81 cols
[2025-06-07 02:18:18] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 02:18:18] [INFO ] Flow matrix only has 144 transitions (discarded 148 similar events)
[2025-06-07 02:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:18] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 02:18:18] [INFO ] Redundant transitions in 17 ms returned []
Running 278 sub problems to find dead transitions.
[2025-06-07 02:18:18] [INFO ] Flow matrix only has 144 transitions (discarded 148 similar events)
[2025-06-07 02:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 2/81 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 143/224 variables, 81/88 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 0/224 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/225 variables, and 88 constraints, problems are : Problem set: 0 solved, 278 unsolved in 7505 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 2/81 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 143/224 variables, 81/88 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 278/366 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/225 variables, and 366 constraints, problems are : Problem set: 0 solved, 278 unsolved in 9847 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17382ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 17383ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/200 places, 292/773 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17534 ms. Remains : 81/200 places, 292/773 transitions.
[2025-06-07 02:18:36] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:18:36] [INFO ] Flatten gal took : 7 ms
[2025-06-07 02:18:36] [INFO ] Input system was already deterministic with 292 transitions.
[2025-06-07 02:18:36] [INFO ] Flatten gal took : 7 ms
[2025-06-07 02:18:36] [INFO ] Flatten gal took : 7 ms
[2025-06-07 02:18:36] [INFO ] Time to serialize gal into /tmp/CTLFireability6897395473333894471.gal : 3 ms
[2025-06-07 02:18:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8834399795804483679.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/CTLFireability6897395473333894471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8834399795804483679.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,9.73119e+06,0.309968,16324,2,2800,5,56010,6,0,573,51346,0


Converting to forward existential form...Done !
original formula: EF((AF(((p55==1)&&(p213==1))) * AF(((E(((p13==1)&&(p160==1)) U ((p120==1)&&(p176==1))) * AF((((p26==1)&&(p142==1))||(p99==1)))) * ((p68==...173
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((p55==1)&&(p213==1)))))) * !(EG(!(((E(((p13==1)&&(p160==1)) U ((p120==1)&&(p176==1)...243
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t13, t17, t19, t21, t23, t25, t27, t31, t32, t34, t35, t36, t37, t39, t40, t41, Int...251
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.76951,64264,1,0,506,266081,579,302,4101,296311,651
FORMULA UtahNoC-PT-none-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 161 transition count 588
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 161 transition count 588
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 108 place count 161 transition count 558
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 117 place count 152 transition count 531
Iterating global reduction 1 with 9 rules applied. Total rules applied 126 place count 152 transition count 531
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 138 place count 152 transition count 519
Applied a total of 138 rules in 14 ms. Remains 152 /200 variables (removed 48) and now considering 519/773 (removed 254) transitions.
[2025-06-07 02:18:38] [INFO ] Flow matrix only has 273 transitions (discarded 246 similar events)
// Phase 1: matrix 273 rows 152 cols
[2025-06-07 02:18:38] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:38] [INFO ] Implicit Places using invariants in 54 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 151/200 places, 519/773 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 494
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 494
Applied a total of 10 rules in 4 ms. Remains 146 /151 variables (removed 5) and now considering 494/519 (removed 25) transitions.
[2025-06-07 02:18:38] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
// Phase 1: matrix 268 rows 146 cols
[2025-06-07 02:18:38] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 02:18:38] [INFO ] Flow matrix only has 268 transitions (discarded 226 similar events)
[2025-06-07 02:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:38] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-07 02:18:38] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/200 places, 494/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 146/200 places, 494/773 transitions.
[2025-06-07 02:18:38] [INFO ] Flatten gal took : 46 ms
[2025-06-07 02:18:38] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:18:38] [INFO ] Input system was already deterministic with 494 transitions.
[2025-06-07 02:18:38] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:18:38] [INFO ] Flatten gal took : 12 ms
[2025-06-07 02:18:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13487400519779992688.gal : 3 ms
[2025-06-07 02:18:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10180494963674047862.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/CTLFireability13487400519779992688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10180494963674047862.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,4.64896e+08,2.01757,65120,2,6521,5,255337,6,0,1013,260394,0


Converting to forward existential form...Done !
original formula: EF(AX(((p15==1)&&(p213==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p15==1)&&(p213==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t23, t30, t34, t36, t43, t47, t49, t58, t60, t62, t70, t72, t74, t82, t84, t86, In...252
(forward)formula 0,0,6.61654,171616,1,0,614,723579,931,370,6497,738373,921
FORMULA UtahNoC-PT-none-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 162 transition count 593
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 162 transition count 593
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 102 place count 162 transition count 567
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 156 transition count 549
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 156 transition count 549
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 122 place count 156 transition count 541
Applied a total of 122 rules in 13 ms. Remains 156 /200 variables (removed 44) and now considering 541/773 (removed 232) transitions.
[2025-06-07 02:18:45] [INFO ] Flow matrix only has 291 transitions (discarded 250 similar events)
// Phase 1: matrix 291 rows 156 cols
[2025-06-07 02:18:45] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:45] [INFO ] Implicit Places using invariants in 44 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/200 places, 541/773 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 150 transition count 516
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 150 transition count 516
Applied a total of 10 rules in 3 ms. Remains 150 /155 variables (removed 5) and now considering 516/541 (removed 25) transitions.
[2025-06-07 02:18:45] [INFO ] Flow matrix only has 286 transitions (discarded 230 similar events)
// Phase 1: matrix 286 rows 150 cols
[2025-06-07 02:18:45] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 02:18:45] [INFO ] Flow matrix only has 286 transitions (discarded 230 similar events)
[2025-06-07 02:18:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-07 02:18:45] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/200 places, 516/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 150/200 places, 516/773 transitions.
[2025-06-07 02:18:45] [INFO ] Flatten gal took : 13 ms
[2025-06-07 02:18:45] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:18:45] [INFO ] Input system was already deterministic with 516 transitions.
[2025-06-07 02:18:45] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:18:45] [INFO ] Flatten gal took : 25 ms
[2025-06-07 02:18:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10362158584240061471.gal : 3 ms
[2025-06-07 02:18:45] [INFO ] Time to serialize properties into /tmp/CTLFireability10782931445147317020.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10362158584240061471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10782931445147317020.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.5988e+08,1.35747,48968,2,5580,5,192385,6,0,1050,172058,0


Converting to forward existential form...Done !
original formula: EG((EF(((AG((p40==0)) + (p25==0)) + (p213==0))) * ((EG(EF(((p88==1)&&(p212==1)))) + EG(AG(((p1==1)&&(p192==1))))) + ((AF((p143==1)) * (p4...250
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((!(E(TRUE U !((p40==0)))) + (p25==0)) + (p213==0))) * ((EG(E(TRUE U ((p88==1)&&(p212==1)))...347
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t22, t29, t33, t35, t42, t46, t48, t57, t59, t61, t69, t71, t73, t81, t83, t85, In...252
(forward)formula 0,1,13.2096,362088,1,0,669,1.76619e+06,1010,409,7543,1.40957e+06,1035
FORMULA UtahNoC-PT-none-CTLFireability-2025-03 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 : 200/200 places, 773/773 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 161 transition count 588
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 161 transition count 588
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 106 place count 161 transition count 560
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 114 place count 153 transition count 536
Iterating global reduction 1 with 8 rules applied. Total rules applied 122 place count 153 transition count 536
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 133 place count 153 transition count 525
Applied a total of 133 rules in 12 ms. Remains 153 /200 variables (removed 47) and now considering 525/773 (removed 248) transitions.
[2025-06-07 02:18:58] [INFO ] Flow matrix only has 279 transitions (discarded 246 similar events)
// Phase 1: matrix 279 rows 153 cols
[2025-06-07 02:18:58] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:58] [INFO ] Implicit Places using invariants in 59 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 152/200 places, 525/773 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 147 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 147 transition count 500
Applied a total of 10 rules in 3 ms. Remains 147 /152 variables (removed 5) and now considering 500/525 (removed 25) transitions.
[2025-06-07 02:18:58] [INFO ] Flow matrix only has 274 transitions (discarded 226 similar events)
// Phase 1: matrix 274 rows 147 cols
[2025-06-07 02:18:58] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 02:18:58] [INFO ] Flow matrix only has 274 transitions (discarded 226 similar events)
[2025-06-07 02:18:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:18:59] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-07 02:18:59] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 147/200 places, 500/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 226 ms. Remains : 147/200 places, 500/773 transitions.
[2025-06-07 02:18:59] [INFO ] Flatten gal took : 15 ms
[2025-06-07 02:18:59] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:18:59] [INFO ] Input system was already deterministic with 500 transitions.
[2025-06-07 02:18:59] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:18:59] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:18:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1499224308128311552.gal : 2 ms
[2025-06-07 02:18:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7644104912097732189.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/CTLFireability1499224308128311552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7644104912097732189.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.89012e+08,2.05602,67900,2,6681,5,264344,6,0,1023,257797,0


Converting to forward existential form...Done !
original formula: EF(((AF(AX((p162==1))) * (p68==1)) * (p46==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p46==1)) * (p68==1)) * !(EG(!(!(EX(!((p162==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t22, t29, t33, t35, t42, t46, t48, t57, t59, t61, t69, t71, t73, t81, t83, t85, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.81209,176484,1,0,624,696976,953,381,6983,807415,944
FORMULA UtahNoC-PT-none-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 173 transition count 648
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 173 transition count 648
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 75 place count 173 transition count 627
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 168 transition count 612
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 168 transition count 612
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 92 place count 168 transition count 605
Applied a total of 92 rules in 11 ms. Remains 168 /200 variables (removed 32) and now considering 605/773 (removed 168) transitions.
[2025-06-07 02:19:06] [INFO ] Flow matrix only has 311 transitions (discarded 294 similar events)
// Phase 1: matrix 311 rows 168 cols
[2025-06-07 02:19:06] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:19:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 02:19:06] [INFO ] Flow matrix only has 311 transitions (discarded 294 similar events)
[2025-06-07 02:19:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:19:06] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-07 02:19:06] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2025-06-07 02:19:06] [INFO ] Flow matrix only has 311 transitions (discarded 294 similar events)
[2025-06-07 02:19:06] [INFO ] Invariant cache hit.
[2025-06-07 02:19:06] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 310/478 variables, 168/176 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 34/210 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 6 (OVERLAPS) 1/479 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/479 variables, and 211 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 168/168 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (OVERLAPS) 310/478 variables, 168/176 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 34/210 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 604/814 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/479 variables, and 814 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 168/168 constraints, ReadFeed: 34/35 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in LTL mode, iteration 1 : 168/200 places, 605/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60323 ms. Remains : 168/200 places, 605/773 transitions.
[2025-06-07 02:20:06] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:20:06] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:20:06] [INFO ] Input system was already deterministic with 605 transitions.
[2025-06-07 02:20:06] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:20:06] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability7096566638988649086.gal : 3 ms
[2025-06-07 02:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6462063321233785106.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/CTLFireability7096566638988649086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6462063321233785106.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,9.81667e+08,2.71152,85396,2,7927,5,344399,6,0,1193,306921,0


Converting to forward existential form...Done !
original formula: (AX(EG((((((p102==0)||(p160==0))&&(p62==0)) + AF(((p120==1)&&(p178==1)))) * (AF((p191==1)) + E(((p43==1)&&(p160==1)) U (p56==1)))))) * (E...589
=> equivalent forward existential formula: ([(EY(Init) * !(EG((((((p102==0)||(p160==0))&&(p62==0)) + !(EG(!(((p120==1)&&(p178==1)))))) * (!(EG(!((p191==1))...900
Reverse transition relation is NOT exact ! Due to transitions t28, t32, t34, t41, t45, t47, t54, t58, t60, t69, t71, t73, t81, t83, t85, t93, t95, t97, In...252
Detected timeout of ITS tools.
[2025-06-07 02:20:36] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:20:36] [INFO ] Applying decomposition
[2025-06-07 02:20:36] [INFO ] Flatten gal took : 11 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/graph14743002606841976022.txt' '-o' '/tmp/graph14743002606841976022.bin' '-w' '/tmp/graph14743002606841976022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14743002606841976022.bin' '-l' '-1' '-v' '-w' '/tmp/graph14743002606841976022.weights' '-q' '0' '-e' '0.001'
[2025-06-07 02:20:36] [INFO ] Decomposing Gal with order
[2025-06-07 02:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 02:20:36] [INFO ] Removed a total of 560 redundant transitions.
[2025-06-07 02:20:36] [INFO ] Flatten gal took : 72 ms
[2025-06-07 02:20:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 15 ms.
[2025-06-07 02:20:36] [INFO ] Time to serialize gal into /tmp/CTLFireability783845711700591110.gal : 4 ms
[2025-06-07 02:20:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17950738295546827042.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/CTLFireability783845711700591110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17950738295546827042.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,9.81667e+08,0.190959,12388,468,27,16831,1259,698,23808,114,4383,0


Converting to forward existential form...Done !
original formula: (AX(EG((((((i9.i1.u27.p102==0)||(i7.i1.u40.p160==0))&&(i4.i1.u19.p62==0)) + AF(((i9.i1.u30.p120==1)&&(i8.u48.p178==1)))) * (AF((i8.u42.p1...926
=> equivalent forward existential formula: ([(EY(Init) * !(EG((((((i9.i1.u27.p102==0)||(i7.i1.u40.p160==0))&&(i4.i1.u19.p62==0)) + !(EG(!(((i9.i1.u30.p120=...1295
Reverse transition relation is NOT exact ! Due to transitions t41, t45, t47, t54, t60, t73, t81, t83, t85, t93, t95, i0.t97, i7.t58, i9.t69, i9.i1.t71, i10...279
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,2.04024,90980,1,0,174747,1259,4661,318949,564,4383,342755
FORMULA UtahNoC-PT-none-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 163 transition count 597
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 163 transition count 597
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 102 place count 163 transition count 569
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 155 transition count 545
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 155 transition count 545
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 129 place count 155 transition count 534
Applied a total of 129 rules in 5 ms. Remains 155 /200 variables (removed 45) and now considering 534/773 (removed 239) transitions.
[2025-06-07 02:20:38] [INFO ] Flow matrix only has 284 transitions (discarded 250 similar events)
// Phase 1: matrix 284 rows 155 cols
[2025-06-07 02:20:38] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:20:38] [INFO ] Implicit Places using invariants in 54 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/200 places, 534/773 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 149 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 149 transition count 509
Applied a total of 10 rules in 7 ms. Remains 149 /154 variables (removed 5) and now considering 509/534 (removed 25) transitions.
[2025-06-07 02:20:38] [INFO ] Flow matrix only has 279 transitions (discarded 230 similar events)
// Phase 1: matrix 279 rows 149 cols
[2025-06-07 02:20:38] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:20:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 02:20:38] [INFO ] Flow matrix only has 279 transitions (discarded 230 similar events)
[2025-06-07 02:20:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:20:39] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-07 02:20:39] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/200 places, 509/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 244 ms. Remains : 149/200 places, 509/773 transitions.
[2025-06-07 02:20:39] [INFO ] Flatten gal took : 12 ms
[2025-06-07 02:20:39] [INFO ] Flatten gal took : 10 ms
[2025-06-07 02:20:39] [INFO ] Input system was already deterministic with 509 transitions.
[2025-06-07 02:20:39] [INFO ] Flatten gal took : 10 ms
[2025-06-07 02:20:39] [INFO ] Flatten gal took : 10 ms
[2025-06-07 02:20:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9954570655242007023.gal : 1 ms
[2025-06-07 02:20:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3414225296188069373.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/CTLFireability9954570655242007023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3414225296188069373.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,5.32188e+08,1.2754,45484,2,5425,5,181185,6,0,1039,158886,0


Converting to forward existential form...Done !
original formula: AG(EX((!(E(E(((p88==1)&&(p212==1)) U ((p131==1)&&(p175==1))) U (((p114==1)&&(p160==1))||(p23==1)))) * (((p87==0)||(p160==0))||((p24==0)||...169
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(E(E(((p88==1)&&(p212==1)) U ((p131==1)&&(p175==1))) U (((p114==1)&&(p160==1))||(p23=...223
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t23, t30, t34, t36, t43, t47, t49, t58, t60, t62, t70, t72, t74, t82, t84, t86, In...252
(forward)formula 0,0,14.9942,424604,1,0,917,2.32532e+06,968,573,6739,2.11919e+06,1240
FORMULA UtahNoC-PT-none-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 164 transition count 602
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 164 transition count 602
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 101 place count 164 transition count 573
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 110 place count 155 transition count 546
Iterating global reduction 1 with 9 rules applied. Total rules applied 119 place count 155 transition count 546
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 131 place count 155 transition count 534
Applied a total of 131 rules in 5 ms. Remains 155 /200 variables (removed 45) and now considering 534/773 (removed 239) transitions.
[2025-06-07 02:20:54] [INFO ] Flow matrix only has 280 transitions (discarded 254 similar events)
// Phase 1: matrix 280 rows 155 cols
[2025-06-07 02:20:54] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:20:54] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 02:20:54] [INFO ] Flow matrix only has 280 transitions (discarded 254 similar events)
[2025-06-07 02:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:20:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-07 02:20:54] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-06-07 02:20:54] [INFO ] Flow matrix only has 280 transitions (discarded 254 similar events)
[2025-06-07 02:20:54] [INFO ] Invariant cache hit.
[2025-06-07 02:20:54] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (OVERLAPS) 279/434 variables, 155/163 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 32/195 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/435 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 196 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (OVERLAPS) 279/434 variables, 155/163 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 32/195 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 533/728 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 02:21:36] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 2)
(t4 1)
(t5 2)
(t6 1)
(t7 1)
(t8 1)
(t9 2)
(t10 1)
(t11 3)
(t12 1)
(t13 2)
(t14 2)
(t15 1)
(t16 1)
(t17 1)
(t18 1)
(t19 1)
(t20 2)
(t21 1)
(t22 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/435 variables, and 729 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, ReadFeed: 32/33 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 155/200 places, 534/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60288 ms. Remains : 155/200 places, 534/773 transitions.
[2025-06-07 02:21:54] [INFO ] Flatten gal took : 10 ms
[2025-06-07 02:21:54] [INFO ] Flatten gal took : 10 ms
[2025-06-07 02:21:54] [INFO ] Input system was already deterministic with 534 transitions.
[2025-06-07 02:21:54] [INFO ] Flatten gal took : 10 ms
[2025-06-07 02:21:54] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:21:54] [INFO ] Time to serialize gal into /tmp/CTLFireability612190000073330747.gal : 2 ms
[2025-06-07 02:21:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4740555467537017919.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/CTLFireability612190000073330747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4740555467537017919.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.
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.17628e+08,2.20706,72088,2,6840,5,285744,6,0,1080,261941,0


Converting to forward existential form...Done !
original formula: (E(((p13==1)&&(p213==1)) U ((A(((EF(((p4==1)&&(p120==1))) * (p98==1)) * (p160==1)) U EG(EX((p133==1)))) * !(((p79==1)&&(p189==1)))) * (AX...217
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,((p13==1)&&(p213==1))) * (!((E(!(EG(EX((p133==1)))) U (!(((E(TRUE U ((p4==1)&&(p120==1))) * ...378
Reverse transition relation is NOT exact ! Due to transitions t23, t27, t29, t36, t40, t42, t49, t53, t55, t64, t66, t68, t76, t78, t80, t88, t90, t92, In...252
(forward)formula 0,1,7.42051,187156,1,0,671,793027,1006,404,6967,810938,1000
FORMULA UtahNoC-PT-none-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 162 transition count 592
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 162 transition count 592
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 104 place count 162 transition count 564
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 111 place count 155 transition count 543
Iterating global reduction 1 with 7 rules applied. Total rules applied 118 place count 155 transition count 543
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 127 place count 155 transition count 534
Applied a total of 127 rules in 5 ms. Remains 155 /200 variables (removed 45) and now considering 534/773 (removed 239) transitions.
[2025-06-07 02:22:02] [INFO ] Flow matrix only has 288 transitions (discarded 246 similar events)
// Phase 1: matrix 288 rows 155 cols
[2025-06-07 02:22:02] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:02] [INFO ] Implicit Places using invariants in 40 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/200 places, 534/773 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 149 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 149 transition count 509
Applied a total of 10 rules in 4 ms. Remains 149 /154 variables (removed 5) and now considering 509/534 (removed 25) transitions.
[2025-06-07 02:22:02] [INFO ] Flow matrix only has 283 transitions (discarded 226 similar events)
// Phase 1: matrix 283 rows 149 cols
[2025-06-07 02:22:02] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:02] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 02:22:02] [INFO ] Flow matrix only has 283 transitions (discarded 226 similar events)
[2025-06-07 02:22:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:02] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-07 02:22:02] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/200 places, 509/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 149/200 places, 509/773 transitions.
[2025-06-07 02:22:02] [INFO ] Flatten gal took : 12 ms
[2025-06-07 02:22:02] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:22:02] [INFO ] Input system was already deterministic with 509 transitions.
[2025-06-07 02:22:02] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:02] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5583468618999612023.gal : 1 ms
[2025-06-07 02:22:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10739954300853936244.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/CTLFireability5583468618999612023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10739954300853936244.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,5.39963e+08,2.19068,70376,2,6690,5,267167,6,0,1040,268357,0


Converting to forward existential form...Done !
original formula: EF(((AX(AG(((p131==1)&&(p175==1)))) + E(EG(((p83==1)&&(p160==1))) U (((p45==1)&&(p169==1))||((p1==1)&&(p211==1))))) + EX(EF(((p85==1)&&(p...167
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(((p131==1)&&(p175==1)))))))))] != FALSE + [(FwdU(FwdU(Init,TRUE),EG(((...307
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t22, t29, t33, t35, t42, t46, t48, t57, t59, t61, t69, t71, t73, t81, t83, t85, In...252
(forward)formula 0,1,7.58542,190572,1,0,635,776826,978,385,7191,830235,972
FORMULA UtahNoC-PT-none-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 165 transition count 604
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 165 transition count 604
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 97 place count 165 transition count 577
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 105 place count 157 transition count 553
Iterating global reduction 1 with 8 rules applied. Total rules applied 113 place count 157 transition count 553
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 123 place count 157 transition count 543
Applied a total of 123 rules in 5 ms. Remains 157 /200 variables (removed 43) and now considering 543/773 (removed 230) transitions.
[2025-06-07 02:22:10] [INFO ] Flow matrix only has 285 transitions (discarded 258 similar events)
// Phase 1: matrix 285 rows 157 cols
[2025-06-07 02:22:10] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:10] [INFO ] Implicit Places using invariants in 50 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/200 places, 543/773 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 152 transition count 523
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 152 transition count 523
Applied a total of 8 rules in 2 ms. Remains 152 /156 variables (removed 4) and now considering 523/543 (removed 20) transitions.
[2025-06-07 02:22:10] [INFO ] Flow matrix only has 281 transitions (discarded 242 similar events)
// Phase 1: matrix 281 rows 152 cols
[2025-06-07 02:22:10] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 02:22:10] [INFO ] Flow matrix only has 281 transitions (discarded 242 similar events)
[2025-06-07 02:22:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:10] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-07 02:22:10] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/200 places, 523/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 152/200 places, 523/773 transitions.
[2025-06-07 02:22:10] [INFO ] Flatten gal took : 13 ms
[2025-06-07 02:22:10] [INFO ] Flatten gal took : 11 ms
[2025-06-07 02:22:10] [INFO ] Input system was already deterministic with 523 transitions.
[2025-06-07 02:22:10] [INFO ] Flatten gal took : 10 ms
[2025-06-07 02:22:10] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11214423619297695512.gal : 2 ms
[2025-06-07 02:22:10] [INFO ] Time to serialize properties into /tmp/CTLFireability2114299664617502780.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/CTLFireability11214423619297695512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2114299664617502780.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,5.91069e+08,2.30529,59216,2,6152,5,215957,6,0,1062,227328,0


Converting to forward existential form...Done !
original formula: E((((AG(((p5==1)&&(p189==1))) + EG(!(AX((p148==1))))) + (!(A((p137==1) U (p158==1))) + !(EF((p40==1))))) + ((!((p187==1)||(p46==1)))||(p1...236
=> equivalent forward existential formula: (([(EY(FwdU(Init,(((!(E(TRUE U !(((p5==1)&&(p189==1))))) + EG(!(!(EX(!((p148==1))))))) + (!(!((E(!((p158==1)) U ...867
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t26, t33, t37, t39, t46, t50, t52, t61, t63, t65, t73, t75, t77, t85, t87, t89, In...252
(forward)formula 0,1,13.7111,337960,1,0,677,1.62386e+06,1016,412,7509,1.34644e+06,1043
FORMULA UtahNoC-PT-none-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 167 transition count 617
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 167 transition count 617
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 94 place count 167 transition count 589
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 159 transition count 565
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 159 transition count 565
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 159 transition count 555
Applied a total of 120 rules in 12 ms. Remains 159 /200 variables (removed 41) and now considering 555/773 (removed 218) transitions.
[2025-06-07 02:22:24] [INFO ] Flow matrix only has 289 transitions (discarded 266 similar events)
// Phase 1: matrix 289 rows 159 cols
[2025-06-07 02:22:24] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:24] [INFO ] Implicit Places using invariants in 58 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/200 places, 555/773 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 156 transition count 545
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 156 transition count 545
Applied a total of 4 rules in 2 ms. Remains 156 /158 variables (removed 2) and now considering 545/555 (removed 10) transitions.
[2025-06-07 02:22:24] [INFO ] Flow matrix only has 287 transitions (discarded 258 similar events)
// Phase 1: matrix 287 rows 156 cols
[2025-06-07 02:22:24] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 02:22:24] [INFO ] Flow matrix only has 287 transitions (discarded 258 similar events)
[2025-06-07 02:22:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-07 02:22:24] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/200 places, 545/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 305 ms. Remains : 156/200 places, 545/773 transitions.
[2025-06-07 02:22:24] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:24] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:24] [INFO ] Input system was already deterministic with 545 transitions.
[2025-06-07 02:22:24] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:24] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:22:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4628807338134516549.gal : 1 ms
[2025-06-07 02:22:24] [INFO ] Time to serialize properties into /tmp/CTLFireability4224394637533641520.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/CTLFireability4628807338134516549.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4224394637533641520.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73506e+08,2.26259,73156,2,7116,5,274623,6,0,1096,285784,0


Converting to forward existential form...Done !
original formula: (A((p97==1) U ((p57==1) + A((AG((p13==1)) + ((AG(((p7==1)&&(p213==1))) * (p28==1)) * (p189==1))) U ((p48==1)&&(p160==1))))) + E(!((AG((((...375
=> equivalent forward existential formula: ([((Init * !(EG(!(((p57==1) + !((E(!(((p48==1)&&(p160==1))) U (!((!(E(TRUE U !((p13==1)))) + ((!(E(TRUE U !(((p7...1010
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t30, t37, t41, t43, t50, t54, t56, t65, t67, t69, t77, t79, t81, t89, t91, t93, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.9959,323960,1,0,715,1.56801e+06,1062,440,7818,1.32292e+06,1086
FORMULA UtahNoC-PT-none-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 166 transition count 613
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 166 transition count 613
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 91 place count 166 transition count 590
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 97 place count 160 transition count 572
Iterating global reduction 1 with 6 rules applied. Total rules applied 103 place count 160 transition count 572
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 160 transition count 563
Applied a total of 112 rules in 9 ms. Remains 160 /200 variables (removed 40) and now considering 563/773 (removed 210) transitions.
[2025-06-07 02:22:36] [INFO ] Flow matrix only has 297 transitions (discarded 266 similar events)
// Phase 1: matrix 297 rows 160 cols
[2025-06-07 02:22:36] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:36] [INFO ] Implicit Places using invariants in 60 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/200 places, 563/773 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 154 transition count 538
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 154 transition count 538
Applied a total of 10 rules in 3 ms. Remains 154 /159 variables (removed 5) and now considering 538/563 (removed 25) transitions.
[2025-06-07 02:22:36] [INFO ] Flow matrix only has 292 transitions (discarded 246 similar events)
// Phase 1: matrix 292 rows 154 cols
[2025-06-07 02:22:36] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:36] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 02:22:36] [INFO ] Flow matrix only has 292 transitions (discarded 246 similar events)
[2025-06-07 02:22:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-07 02:22:36] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 154/200 places, 538/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 261 ms. Remains : 154/200 places, 538/773 transitions.
[2025-06-07 02:22:36] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:22:36] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:36] [INFO ] Input system was already deterministic with 538 transitions.
[2025-06-07 02:22:36] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:36] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:22:36] [INFO ] Time to serialize gal into /tmp/CTLFireability1045084707269205519.gal : 1 ms
[2025-06-07 02:22:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2408582175313067453.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/CTLFireability1045084707269205519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2408582175313067453.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.40258e+08,2.36526,79236,2,7477,5,294272,6,0,1084,326896,0


Converting to forward existential form...Done !
original formula: AG((((p67==0) + EX(((p107!=1)||(p213!=1)))) + (((p119==1)&&(p160==1)) + (EF((p9==1)) * ((p117==1)||((p76==1)&&(p160==1)))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((((p119==1)&&(p160==1)) + (E(TRUE U (p9==1)) * ((p117==1)||((p76==1)&&(p160==1))))))) * ...209
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t24, t31, t35, t37, t44, t48, t50, t59, t61, t63, t71, t73, t75, t83, t85, t87, In...252
(forward)formula 0,1,7.48686,188744,1,0,664,778896,1013,399,7047,813853,1004
FORMULA UtahNoC-PT-none-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 166 transition count 613
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 166 transition count 613
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 94 place count 166 transition count 587
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 159 transition count 566
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 159 transition count 566
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 159 transition count 557
Applied a total of 117 rules in 9 ms. Remains 159 /200 variables (removed 41) and now considering 557/773 (removed 216) transitions.
[2025-06-07 02:22:44] [INFO ] Flow matrix only has 291 transitions (discarded 266 similar events)
// Phase 1: matrix 291 rows 159 cols
[2025-06-07 02:22:44] [INFO ] Computed 8 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:44] [INFO ] Implicit Places using invariants in 48 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/200 places, 557/773 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 153 transition count 532
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 153 transition count 532
Applied a total of 10 rules in 2 ms. Remains 153 /158 variables (removed 5) and now considering 532/557 (removed 25) transitions.
[2025-06-07 02:22:44] [INFO ] Flow matrix only has 286 transitions (discarded 246 similar events)
// Phase 1: matrix 286 rows 153 cols
[2025-06-07 02:22:44] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 02:22:44] [INFO ] Flow matrix only has 286 transitions (discarded 246 similar events)
[2025-06-07 02:22:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:44] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-07 02:22:44] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/200 places, 532/773 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 214 ms. Remains : 153/200 places, 532/773 transitions.
[2025-06-07 02:22:44] [INFO ] Flatten gal took : 12 ms
[2025-06-07 02:22:44] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:44] [INFO ] Input system was already deterministic with 532 transitions.
[2025-06-07 02:22:44] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:44] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:22:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1430459291611303205.gal : 2 ms
[2025-06-07 02:22:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14971537495807269391.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/CTLFireability1430459291611303205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14971537495807269391.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.08914e+08,2.06011,67716,2,6673,5,265842,6,0,1074,247449,0


Converting to forward existential form...Done !
original formula: AG(!(A((((EX(((p32==1)&&(p189==1))) + ((p143==1)&&(p54==1))) * (p35==1)) * (p189==1)) U ((AX(((p83==1)&&(p160==1))) * EX(((p48==1)&&(p189...207
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((!(EX(!(((p83==1)&&(p160==1))))) * EX(((p48==1)&&(p189==1)))) + (!(EG(!(((p50==1)&&...519
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t26, t33, t37, t39, t46, t50, t52, t61, t63, t65, t73, t75, t77, t85, t87, t89, In...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.41844,215108,1,0,681,909191,1022,417,7390,945951,1029
FORMULA UtahNoC-PT-none-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 171 transition count 637
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 171 transition count 637
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 82 place count 171 transition count 613
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 164 transition count 592
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 164 transition count 592
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 106 place count 164 transition count 582
Applied a total of 106 rules in 6 ms. Remains 164 /200 variables (removed 36) and now considering 582/773 (removed 191) transitions.
[2025-06-07 02:22:53] [INFO ] Flow matrix only has 300 transitions (discarded 282 similar events)
// Phase 1: matrix 300 rows 164 cols
[2025-06-07 02:22:53] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 02:22:53] [INFO ] Flow matrix only has 300 transitions (discarded 282 similar events)
[2025-06-07 02:22:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:22:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-07 02:22:53] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2025-06-07 02:22:53] [INFO ] Flow matrix only has 300 transitions (discarded 282 similar events)
[2025-06-07 02:22:53] [INFO ] Invariant cache hit.
[2025-06-07 02:22:53] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 299/463 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 34/206 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (OVERLAPS) 1/464 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 207 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 299/463 variables, 164/172 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 34/206 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 581/787 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 581 unsolved
SMT process timed out in 60096ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 164/200 places, 582/773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60306 ms. Remains : 164/200 places, 582/773 transitions.
[2025-06-07 02:23:53] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:23:53] [INFO ] Flatten gal took : 8 ms
[2025-06-07 02:23:53] [INFO ] Input system was already deterministic with 582 transitions.
[2025-06-07 02:23:53] [INFO ] Flatten gal took : 12 ms
[2025-06-07 02:23:53] [INFO ] Flatten gal took : 9 ms
[2025-06-07 02:23:53] [INFO ] Time to serialize gal into /tmp/CTLFireability5592626937771169783.gal : 1 ms
[2025-06-07 02:23:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15070043016878675535.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/CTLFireability5592626937771169783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15070043016878675535.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,8.42844e+08,2.60575,80312,2,7474,5,323913,6,0,1157,293459,0


Converting to forward existential form...Done !
original formula: (AG((((p167==1) * (AF((((p1==1)&&(p207==1))||(p119==1))) + (p168==1))) * ((E((A(((p1==1)&&(p203==1)) U (p153==1)) * ((p138==1)||(p99==1))...514
=> equivalent forward existential formula: (([(FwdU((Init * !(EG((EX(E(TRUE U (((p5==1)&&(p189==1))||((p27==1)&&(p213==1))))) + ((((((p33==1)&&(p213==1))&&...1078
Reverse transition relation is NOT exact ! Due to transitions t27, t31, t33, t40, t44, t46, t53, t57, t59, t68, t70, t72, t80, t82, t84, t92, t94, t96, In...252
(forward)formula 0,1,19.5831,511588,1,0,785,2.68499e+06,1141,481,8078,1.94417e+06,1172
FORMULA UtahNoC-PT-none-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 200/200 places, 773/773 transitions.
Graph (trivial) has 317 edges and 200 vertex of which 81 / 200 are part of one of the 13 SCC in 3 ms
Free SCC test removed 68 places
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 30 place count 103 transition count 419
Iterating global reduction 0 with 29 rules applied. Total rules applied 59 place count 103 transition count 419
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 94 place count 103 transition count 384
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 103 place count 94 transition count 360
Iterating global reduction 1 with 9 rules applied. Total rules applied 112 place count 94 transition count 360
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 124 place count 94 transition count 348
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 91 transition count 345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 134 place count 91 transition count 341
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 89 transition count 335
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 89 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 89 transition count 333
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 144 place count 89 transition count 329
Applied a total of 144 rules in 30 ms. Remains 89 /200 variables (removed 111) and now considering 329/773 (removed 444) transitions.
[2025-06-07 02:24:13] [INFO ] Flow matrix only has 152 transitions (discarded 177 similar events)
// Phase 1: matrix 152 rows 89 cols
[2025-06-07 02:24:13] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:24:13] [INFO ] Implicit Places using invariants in 66 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/200 places, 329/773 transitions.
Graph (trivial) has 130 edges and 88 vertex of which 21 / 88 are part of one of the 4 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 68 transition count 255
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 68 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 68 transition count 249
Applied a total of 13 rules in 8 ms. Remains 68 /88 variables (removed 20) and now considering 249/329 (removed 80) transitions.
[2025-06-07 02:24:13] [INFO ] Flow matrix only has 116 transitions (discarded 133 similar events)
// Phase 1: matrix 116 rows 68 cols
[2025-06-07 02:24:13] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:24:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-07 02:24:13] [INFO ] Flow matrix only has 116 transitions (discarded 133 similar events)
[2025-06-07 02:24:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 02:24:13] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-07 02:24:13] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 68/200 places, 249/773 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 208 ms. Remains : 68/200 places, 249/773 transitions.
[2025-06-07 02:24:13] [INFO ] Flatten gal took : 4 ms
[2025-06-07 02:24:13] [INFO ] Flatten gal took : 4 ms
[2025-06-07 02:24:13] [INFO ] Input system was already deterministic with 249 transitions.
[2025-06-07 02:24:13] [INFO ] Flatten gal took : 3 ms
[2025-06-07 02:24:13] [INFO ] Flatten gal took : 3 ms
[2025-06-07 02:24:13] [INFO ] Time to serialize gal into /tmp/CTLFireability2672466659467281848.gal : 1 ms
[2025-06-07 02:24:13] [INFO ] Time to serialize properties into /tmp/CTLFireability15900141979363493418.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/CTLFireability2672466659467281848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15900141979363493418.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.92934e+06,0.197429,11592,2,1981,5,34706,6,0,482,31403,0


Converting to forward existential form...Done !
original formula: (EF(AG((p31==1))) + AG(E((p44==1) U !(((p1==1)&&(p215==1))))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U !(E(TRUE U !((p31==1))))))),TRUE) * !(E((p44==1) U !(((p1==1)&&(p215==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t13, t15, t17, t19, t21, t23, t25, t26, t27, t28, t29, t30, t31, t32, t34, Inte...250
(forward)formula 0,0,1.25906,48636,1,0,377,199837,481,219,3526,229232,477
FORMULA UtahNoC-PT-none-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 02:24:14] [INFO ] Flatten gal took : 15 ms
[2025-06-07 02:24:14] [INFO ] Flatten gal took : 12 ms
Total runtime 433186 ms.

BK_STOP 1749263055007

--------------------
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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r240-tall-174915590100626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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