Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064600658.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 DiscoveryGPU-PT-09a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064600658
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 32K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748922375033

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 03:46:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 03:46:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 03:46:17] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-06-03 03:46:17] [INFO ] Transformed 93 places.
[2025-06-03 03:46:17] [INFO ] Transformed 127 transitions.
[2025-06-03 03:46:17] [INFO ] Found NUPN structural information;
[2025-06-03 03:46:17] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 62 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 13 place count 91 transition count 116
Applied a total of 13 rules in 34 ms. Remains 91 /93 variables (removed 2) and now considering 116/127 (removed 11) transitions.
// Phase 1: matrix 116 rows 91 cols
[2025-06-03 03:46:17] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:46:18] [INFO ] Implicit Places using invariants in 282 ms returned []
[2025-06-03 03:46:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:46:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-03 03:46:18] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-06-03 03:46:18] [INFO ] Invariant cache hit.
[2025-06-03 03:46:18] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 72/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/207 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 165 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 72/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 115/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 280 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14224ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 14247ms
Starting structural reductions in LTL mode, iteration 1 : 91/93 places, 116/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14908 ms. Remains : 91/93 places, 116/127 transitions.
Support contains 62 out of 91 places after structural reductions.
[2025-06-03 03:46:32] [INFO ] Flatten gal took : 45 ms
[2025-06-03 03:46:32] [INFO ] Flatten gal took : 19 ms
[2025-06-03 03:46:33] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 60 out of 91 places (down from 62) after GAL structural reductions.
RANDOM walk for 40000 steps (417 resets) in 2349 ms. (17 steps per ms) remains 2/77 properties
BEST_FIRST walk for 40004 steps (47 resets) in 252 ms. (158 steps per ms) remains 1/2 properties
BEST_FIRST walk for 15848 steps (4 resets) in 158 ms. (99 steps per ms) remains 0/1 properties
[2025-06-03 03:46:33] [INFO ] Flatten gal took : 12 ms
[2025-06-03 03:46:33] [INFO ] Flatten gal took : 12 ms
[2025-06-03 03:46:33] [INFO ] Input system was already deterministic with 116 transitions.
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 254 edges and 91 vertex of which 84 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 76 transition count 101
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 76 transition count 101
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 71 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 71 transition count 96
Applied a total of 40 rules in 13 ms. Remains 71 /91 variables (removed 20) and now considering 96/116 (removed 20) transitions.
// Phase 1: matrix 96 rows 71 cols
[2025-06-03 03:46:33] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:46:34] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 03:46:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:46:34] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-03 03:46:34] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-03 03:46:34] [INFO ] Invariant cache hit.
[2025-06-03 03:46:34] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/167 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 65/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/167 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 138 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/167 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 65/138 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 95/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 233 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4984 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9570ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9575ms
Starting structural reductions in LTL mode, iteration 1 : 71/91 places, 96/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9776 ms. Remains : 71/91 places, 96/116 transitions.
[2025-06-03 03:46:43] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:46:43] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:46:43] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-03 03:46:43] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:46:43] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:46:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13151588408497321915.gal : 4 ms
[2025-06-03 03:46:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9884529102208911794.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/CTLFireability13151588408497321915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9884529102208911794.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,9.67311e+08,0.561397,18948,2,2989,5,94894,6,0,368,58192,0


Converting to forward existential form...Done !
original formula: AG(EX((((p66==0)||(p91==0))||(((p38==1)&&(p92==1))||(((p18==0)&&(p42==1))&&((p91==1)&&((p43==1)||(p30==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((p66==0)||(p91==0))||(((p38==1)&&(p92==1))||(((p18==0)&&(p42==1))&&((p91==1)&&((p43==...184
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t28, t29, t31, t33, t35, t37, t78, t80, t86, t87, t88, t89, t90, t91, t92, t93, t94...260
(forward)formula 0,0,1.9351,44168,1,0,141,206013,208,91,2169,276296,199
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 75 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 75 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 70 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 70 transition count 95
Applied a total of 42 rules in 10 ms. Remains 70 /91 variables (removed 21) and now considering 95/116 (removed 21) transitions.
// Phase 1: matrix 95 rows 70 cols
[2025-06-03 03:46:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:46:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 03:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:46:46] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:46:46] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-03 03:46:46] [INFO ] Invariant cache hit.
[2025-06-03 03:46:46] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 136 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4743 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 230 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4663 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9428ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 9429ms
Starting structural reductions in LTL mode, iteration 1 : 70/91 places, 95/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9648 ms. Remains : 70/91 places, 95/116 transitions.
[2025-06-03 03:46:55] [INFO ] Flatten gal took : 9 ms
[2025-06-03 03:46:55] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:46:55] [INFO ] Input system was already deterministic with 95 transitions.
[2025-06-03 03:46:55] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:46:55] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:46:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4564617549717689654.gal : 6 ms
[2025-06-03 03:46:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12026977417211048088.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/CTLFireability4564617549717689654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12026977417211048088.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,9.09902e+08,0.408277,15008,2,1913,5,69878,6,0,363,43505,0


Converting to forward existential form...Done !
original formula: AX(EF(((((p69==1)&&(p91==1)) * (EG((p66==0)) * EX(AG((p3==0))))) * ((((p8==0)||(p92==0))||((p18==0)||(p16==0)))||(p91==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((p69==1)&&(p91==1)) * (EG((p66==0)) * EX(!(E(TRUE U !((p3==0))))))) * ((((p8==0)||(p9...208
Reverse transition relation is NOT exact ! Due to transitions t15, t18, t22, t24, t26, t28, t31, t33, t35, t37, t85, t86, t87, t88, t89, t90, t91, t92, t93...260
(forward)formula 0,1,8.30547,216540,1,0,560,1.26114e+06,221,295,2248,1.4578e+06,669
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 79 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 79 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 75 transition count 100
Applied a total of 32 rules in 11 ms. Remains 75 /91 variables (removed 16) and now considering 100/116 (removed 16) transitions.
// Phase 1: matrix 100 rows 75 cols
[2025-06-03 03:47:03] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:47:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-03 03:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:47:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-03 03:47:04] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2025-06-03 03:47:04] [INFO ] Invariant cache hit.
[2025-06-03 03:47:04] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/175 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/175 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 143 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3897 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/175 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 99/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 242 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3770 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7683ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 7684ms
Starting structural reductions in LTL mode, iteration 1 : 75/91 places, 100/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7877 ms. Remains : 75/91 places, 100/116 transitions.
[2025-06-03 03:47:11] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:47:11] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:47:11] [INFO ] Input system was already deterministic with 100 transitions.
[2025-06-03 03:47:11] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:47:11] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:47:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2966285918801745510.gal : 2 ms
[2025-06-03 03:47:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2973721488574945569.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/CTLFireability2966285918801745510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2973721488574945569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24138e+09,0.595047,20680,2,2980,5,111486,6,0,387,61239,0


Converting to forward existential form...Done !
original formula: EF((((p57==1)&&(p91==1)) * ((E(EG(((p12==1)&&(p91==1))) U (p41==1)) + ((E(((p63==1)&&(p92==1)) U ((p68==1)&&(p92==1))) * A(((p85==1)&&(p9...253
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * ((p57==1)&&(p91==1))) * ((p86==1)||(p27==1))),EG(((p12==1)&&(p91==1)))) * (p41==1))]...456
Reverse transition relation is NOT exact ! Due to transitions t5, t20, t24, t30, t31, t35, t37, t39, t82, t84, t89, t90, t91, t92, t93, t94, t95, t96, t97,...265
(forward)formula 0,1,4.75858,125980,1,0,309,602753,229,174,2305,864350,409
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 75 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 75 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 70 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 70 transition count 95
Applied a total of 42 rules in 9 ms. Remains 70 /91 variables (removed 21) and now considering 95/116 (removed 21) transitions.
// Phase 1: matrix 95 rows 70 cols
[2025-06-03 03:47:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:47:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-03 03:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:47:16] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:47:16] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-03 03:47:16] [INFO ] Invariant cache hit.
[2025-06-03 03:47:16] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/165 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 136 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3392 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 95/165 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 64/136 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 94/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 230 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4677 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8080ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 8082ms
Starting structural reductions in LTL mode, iteration 1 : 70/91 places, 95/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8279 ms. Remains : 70/91 places, 95/116 transitions.
[2025-06-03 03:47:24] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:47:24] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:47:24] [INFO ] Input system was already deterministic with 95 transitions.
[2025-06-03 03:47:24] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:47:24] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:47:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14672249556423280013.gal : 2 ms
[2025-06-03 03:47:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2801674592785353917.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/CTLFireability14672249556423280013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2801674592785353917.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,9.09902e+08,0.52802,18988,2,2975,5,93732,6,0,363,59621,0


Converting to forward existential form...Done !
original formula: E(!((((E(E(((p58==1)&&(p92==1)) U ((p28==1)&&(p92==1))) U ((p70==1)&&(p91==1))) + A(EX((p34==1)) U ((p43==1)&&(p64==1)))) + (p64==1)) * (...290
=> equivalent forward existential formula: [((FwdU((FwdU(Init,!((((E(E(((p58==1)&&(p92==1)) U ((p28==1)&&(p92==1))) U ((p70==1)&&(p91==1))) + !((E(!(((p43=...442
Reverse transition relation is NOT exact ! Due to transitions t9, t18, t22, t24, t28, t29, t31, t33, t35, t37, t85, t86, t87, t88, t89, t90, t91, t92, t93,...259
(forward)formula 0,0,24.2885,565056,1,0,693,3.26589e+06,242,381,2349,3.68372e+06,857
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 78 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 78 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 73 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 73 transition count 98
Applied a total of 36 rules in 9 ms. Remains 73 /91 variables (removed 18) and now considering 98/116 (removed 18) transitions.
// Phase 1: matrix 98 rows 73 cols
[2025-06-03 03:47:49] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:47:49] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 03:47:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:47:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-03 03:47:49] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/91 places, 98/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 226 ms. Remains : 72/91 places, 98/116 transitions.
[2025-06-03 03:47:49] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:47:49] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:47:49] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-03 03:47:49] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:47:49] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability433723154855775082.gal : 2 ms
[2025-06-03 03:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1708023219107759140.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/CTLFireability433723154855775082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1708023219107759140.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,1.1101e+09,1.11223,31684,2,9178,5,172678,6,0,376,112985,0


Converting to forward existential form...Done !
original formula: EF((((p82==1)&&(p91==1)) * (EG(EX((p36==1))) * EG(((((p57==1)&&(p91==1))||((p5==1)&&(p91==1)))||((p22==1)&&(p91==1)))))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * ((p82==1)&&(p91==1))) * EG(EX((p36==1)))),((((p57==1)&&(p91==1))||((p5==1)&&(p91==1)))...189
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t30, t32, t34, t36, t38, t77, t81, t82, t88, t89, t90, t91, t92, t93, t94, t95, t96...260
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 46/0/52
(forward)formula 0,1,9.82324,242852,1,0,268,1.24953e+06,229,174,2464,1.54389e+06,343
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 79 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 79 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 75 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 75 transition count 100
Applied a total of 32 rules in 6 ms. Remains 75 /91 variables (removed 16) and now considering 100/116 (removed 16) transitions.
// Phase 1: matrix 100 rows 75 cols
[2025-06-03 03:47:59] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:47:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-03 03:47:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:47:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-06-03 03:47:59] [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 99 sub problems to find dead transitions.
[2025-06-03 03:47:59] [INFO ] Invariant cache hit.
[2025-06-03 03:47:59] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/175 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/175 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 143 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4302 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 100/175 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 66/143 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 99/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 242 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4649 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8964ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 8965ms
Starting structural reductions in LTL mode, iteration 1 : 75/91 places, 100/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9160 ms. Remains : 75/91 places, 100/116 transitions.
[2025-06-03 03:48:08] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:48:08] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:48:08] [INFO ] Input system was already deterministic with 100 transitions.
[2025-06-03 03:48:08] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:48:08] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:48:08] [INFO ] Time to serialize gal into /tmp/CTLFireability520875301087077289.gal : 1 ms
[2025-06-03 03:48:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1659609106701423245.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/CTLFireability520875301087077289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1659609106701423245.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,1.187e+09,0.322637,13552,2,1397,5,63300,6,0,386,36502,0


Converting to forward existential form...Done !
original formula: AX((EG(AG(((p53==0)||(p92==0)))) * ((EF(((((p65==0)||(p91==0))&&(p51==0))&&((p24==0)||(p92==0)))) + AX((((p56==0)||(p91==0))&&(p1==0)))) ...175
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(E(TRUE U !(((p53==0)||(p92==0))))))))] = FALSE * [FwdG((EY(Init) * !((E(TRUE U ((((p65==0)|...273
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t27, t29, t32, t34, t38, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99...256
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.1083,268244,1,0,924,1.53091e+06,242,552,2443,1.95882e+06,1025
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-05 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 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 78 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 78 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 73 transition count 98
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 73 transition count 98
Applied a total of 36 rules in 5 ms. Remains 73 /91 variables (removed 18) and now considering 98/116 (removed 18) transitions.
// Phase 1: matrix 98 rows 73 cols
[2025-06-03 03:48:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-03 03:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:20] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-03 03:48:20] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 252 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 72/91 places, 98/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 72 /72 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 261 ms. Remains : 72/91 places, 98/116 transitions.
[2025-06-03 03:48:20] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:48:20] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:48:20] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-03 03:48:20] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:48:20] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:48:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11483744272668727209.gal : 2 ms
[2025-06-03 03:48:20] [INFO ] Time to serialize properties into /tmp/CTLFireability18342267899835376525.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/CTLFireability11483744272668727209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18342267899835376525.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08544e+09,0.655851,19276,2,3811,5,102986,6,0,375,56642,0


Converting to forward existential form...Done !
original formula: (AX((((p7==1)&&(p91==1))&&((p15==1)&&(p91==1)))) + EF(((EX((EF(((p56==0)||(p91==0))) * (p33==0))) * EX((p33==1))) * (EF((p68==0)) * (((p1...186
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U ((EX((E(TRUE U ((p56==0)||(p91==0))) * (p33==0))) * EX((p33==1))) * (E(TRUE U (p68==0)) ...254
Reverse transition relation is NOT exact ! Due to transitions t12, t19, t25, t27, t29, t30, t32, t36, t38, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...260
(forward)formula 0,1,3.97138,108748,1,0,158,629638,223,103,2238,553694,228
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 77 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 77 transition count 102
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 73 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 73 transition count 98
Applied a total of 36 rules in 7 ms. Remains 73 /91 variables (removed 18) and now considering 98/116 (removed 18) transitions.
// Phase 1: matrix 98 rows 73 cols
[2025-06-03 03:48:24] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-03 03:48:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:24] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-03 03:48:24] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-03 03:48:24] [INFO ] Invariant cache hit.
[2025-06-03 03:48:24] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/171 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 65/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/171 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 140 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4988 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/171 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 65/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 97/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 237 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10239ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10240ms
Starting structural reductions in LTL mode, iteration 1 : 73/91 places, 98/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10441 ms. Remains : 73/91 places, 98/116 transitions.
[2025-06-03 03:48:34] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:48:34] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:48:34] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-03 03:48:34] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:48:34] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:48:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14563581387025005945.gal : 2 ms
[2025-06-03 03:48:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4504114660298652371.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/CTLFireability14563581387025005945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4504114660298652371.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13019e+09,1.11464,28956,2,4637,5,171903,6,0,378,94435,0


Converting to forward existential form...Done !
original formula: E(!((EG(E((p56!=1) U EG((p63==1)))) + EF((((p73==1)&&(p92==1))||((p47==1)&&(p91==1)))))) U AG(E(EF(!(((p5==1)&&(p91==1)))) U (!((((p58==1...238
=> equivalent forward existential formula: [(FwdU(Init,!((EG(E((p56!=1) U EG((p63==1)))) + E(TRUE U (((p73==1)&&(p92==1))||((p47==1)&&(p91==1))))))) * !(E(...308
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t20, t24, t28, t31, t33, t35, t37, t81, t82, t88, t89, t90, t91, t92, t93, t94, t95, ...263
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.24605,147780,1,0,326,788875,245,181,2420,874509,444
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 77 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 77 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 72 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 72 transition count 97
Applied a total of 38 rules in 7 ms. Remains 72 /91 variables (removed 19) and now considering 97/116 (removed 19) transitions.
// Phase 1: matrix 97 rows 72 cols
[2025-06-03 03:48:41] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-03 03:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:41] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-03 03:48:41] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2025-06-03 03:48:41] [INFO ] Invariant cache hit.
[2025-06-03 03:48:41] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 65/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 139 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4799 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 97/169 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 65/139 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 96/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 235 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9762ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9763ms
Starting structural reductions in LTL mode, iteration 1 : 72/91 places, 97/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10008 ms. Remains : 72/91 places, 97/116 transitions.
[2025-06-03 03:48:51] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:48:51] [INFO ] Flatten gal took : 8 ms
[2025-06-03 03:48:51] [INFO ] Input system was already deterministic with 97 transitions.
[2025-06-03 03:48:51] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:48:51] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:48:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10238471376965166064.gal : 2 ms
[2025-06-03 03:48:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11541031565098869999.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/CTLFireability10238471376965166064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11541031565098869999.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0006e+09,0.598353,16100,2,2022,5,73892,6,0,372,47453,0


Converting to forward existential form...Done !
original formula: AG((((AG((p74==0)) + (p65==0)) + ((p91==0)||(p85==0))) + (AG((((AX(((p34==1)&&(p92==1))) * ((p28==0)||(p92==0))) * (p53==0)) + ((EX((p51=...276
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * !(((!(E(TRUE U !((p74==0)))) + (p65==0)) + ((p91==0)||(p85==0))))) * !(!(E(TRUE U !(...610
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t29, t31, t33, t37, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96...255
(forward)formula 0,0,1.94534,43116,1,0,167,211184,227,111,2271,222706,228
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-08 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 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 76 transition count 101
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 76 transition count 101
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 71 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 71 transition count 96
Applied a total of 40 rules in 3 ms. Remains 71 /91 variables (removed 20) and now considering 96/116 (removed 20) transitions.
// Phase 1: matrix 96 rows 71 cols
[2025-06-03 03:48:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-03 03:48:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:48:53] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:48:53] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-03 03:48:53] [INFO ] Invariant cache hit.
[2025-06-03 03:48:53] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/167 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 64/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/167 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 137 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/167 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 64/137 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 95/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 232 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4892 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 71/71 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9452ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9453ms
Starting structural reductions in LTL mode, iteration 1 : 71/91 places, 96/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9702 ms. Remains : 71/91 places, 96/116 transitions.
[2025-06-03 03:49:02] [INFO ] Flatten gal took : 4 ms
[2025-06-03 03:49:02] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:49:02] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-03 03:49:02] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:49:02] [INFO ] Flatten gal took : 4 ms
[2025-06-03 03:49:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3159441737861058089.gal : 1 ms
[2025-06-03 03:49:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9837856214805728737.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/CTLFireability3159441737861058089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9837856214805728737.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.8551e+08,0.795626,20452,2,3258,5,106237,6,0,368,64055,0


Converting to forward existential form...Done !
original formula: EX(((EG(AG(((p74==0)||(p92==0)))) * EF(AX(((p53==0)||(p92==0))))) * (EX(((p13==0)||(p92==0))) * EG(((p79==0)||(p91==0))))))
=> equivalent forward existential formula: [FwdG(((EY(Init) * (EG(!(E(TRUE U !(((p74==0)||(p92==0)))))) * E(TRUE U !(EX(!(((p53==0)||(p92==0)))))))) * EX((...208
Reverse transition relation is NOT exact ! Due to transitions t7, t16, t19, t23, t25, t27, t29, t30, t34, t38, t86, t87, t88, t89, t90, t91, t92, t93, t94,...259
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.4624,300084,1,0,549,1.69287e+06,232,362,2354,2.13736e+06,591
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 75 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 75 transition count 100
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 69 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 69 transition count 94
Applied a total of 44 rules in 3 ms. Remains 69 /91 variables (removed 22) and now considering 94/116 (removed 22) transitions.
// Phase 1: matrix 94 rows 69 cols
[2025-06-03 03:49:15] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 03:49:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:15] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:49:15] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 195 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/91 places, 94/116 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 199 ms. Remains : 68/91 places, 94/116 transitions.
[2025-06-03 03:49:15] [INFO ] Flatten gal took : 4 ms
[2025-06-03 03:49:15] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:49:15] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-03 03:49:15] [INFO ] Flatten gal took : 4 ms
[2025-06-03 03:49:15] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:49:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2354863274466636602.gal : 1 ms
[2025-06-03 03:49:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3290815603728742056.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/CTLFireability2354863274466636602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3290815603728742056.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,8.35715e+08,0.603008,22196,2,5324,5,123961,6,0,356,67148,0


Converting to forward existential form...Done !
original formula: EG(EF(AX(((p45==1)&&(p91==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!(((p45==1)&&(p91==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,1,11.7373,282012,1,0,209,1.59433e+06,214,131,2301,1.42506e+06,297
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 110
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 80 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 80 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 77 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 77 transition count 102
Applied a total of 28 rules in 4 ms. Remains 77 /91 variables (removed 14) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 77 cols
[2025-06-03 03:49:27] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-03 03:49:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:27] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-06-03 03:49:27] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2025-06-03 03:49:27] [INFO ] Invariant cache hit.
[2025-06-03 03:49:27] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/179 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 67/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/179 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 146 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5588 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/179 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 67/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 101/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 247 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11137ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 11139ms
Starting structural reductions in LTL mode, iteration 1 : 77/91 places, 102/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11345 ms. Remains : 77/91 places, 102/116 transitions.
[2025-06-03 03:49:38] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:49:38] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:49:38] [INFO ] Input system was already deterministic with 102 transitions.
[2025-06-03 03:49:38] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:49:38] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:49:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12362257222564190876.gal : 2 ms
[2025-06-03 03:49:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6812844777741599657.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/CTLFireability12362257222564190876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6812844777741599657.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4042e+09,0.859721,20176,2,3600,5,106040,6,0,397,61994,0


Converting to forward existential form...Done !
original formula: (A((AG(!((((!((p19==1)&&(p91==1)))||((p43==1)&&(p92==1)))||((p74==1)&&(p92==1))))) * A(EF((((p8==1)&&(p92==1))&&(p71==1))) U (((p72==1)&&...489
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!(!((E(!(!((E(!((((((p5==1)&&(p91==1))||(p48==1))&&(p38==1))&&(p92==1))) U (!(E(TRUE U ((p...3558
Reverse transition relation is NOT exact ! Due to transitions t11, t21, t25, t31, t32, t36, t38, t80, t83, t85, t91, t92, t93, t94, t95, t96, t97, t98, t99...268
(forward)formula 0,1,14.9022,355304,1,0,259,2.06506e+06,226,151,2381,1.94008e+06,356
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 254 edges and 91 vertex of which 84 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 84 transition count 100
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 27 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 35 place count 67 transition count 92
Applied a total of 35 rules in 32 ms. Remains 67 /91 variables (removed 24) and now considering 92/116 (removed 24) transitions.
// Phase 1: matrix 92 rows 67 cols
[2025-06-03 03:49:53] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:54] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-03 03:49:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:54] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:49:54] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 211 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 66/91 places, 92/116 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 92
Applied a total of 1 rules in 19 ms. Remains 66 /66 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 66 cols
[2025-06-03 03:49:54] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:54] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-03 03:49:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:54] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-03 03:49:54] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 66/91 places, 92/116 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 413 ms. Remains : 66/91 places, 92/116 transitions.
[2025-06-03 03:49:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:49:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:49:54] [INFO ] Input system was already deterministic with 92 transitions.
[2025-06-03 03:49:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:49:54] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:49:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14045794932855349546.gal : 1 ms
[2025-06-03 03:49:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11355228671180614119.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/CTLFireability14045794932855349546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11355228671180614119.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.85213e+08,0.234649,11292,2,3115,5,48307,6,0,347,26160,0


Converting to forward existential form...Done !
original formula: EF(EG(AG((AG((p4==1)) + EG(((p65==1)&&(p91==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((!(E(TRUE U !((p4==1)))) + EG(((p65==1)&&(p91==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t23, t25, t26, t28, t30, t32, t34, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91...255
(forward)formula 0,0,2.14079,58328,1,0,182,279485,217,109,2118,285970,262
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 109
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 77 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 77 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 74 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 74 transition count 99
Applied a total of 34 rules in 2 ms. Remains 74 /91 variables (removed 17) and now considering 99/116 (removed 17) transitions.
// Phase 1: matrix 99 rows 74 cols
[2025-06-03 03:49:56] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 03:49:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:49:56] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-03 03:49:56] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-03 03:49:56] [INFO ] Invariant cache hit.
[2025-06-03 03:49:56] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/173 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/173 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 141 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/173 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 65/141 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 98/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 239 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10065ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10066ms
Starting structural reductions in LTL mode, iteration 1 : 74/91 places, 99/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10245 ms. Remains : 74/91 places, 99/116 transitions.
[2025-06-03 03:50:06] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:50:06] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:50:06] [INFO ] Input system was already deterministic with 99 transitions.
[2025-06-03 03:50:06] [INFO ] Flatten gal took : 6 ms
[2025-06-03 03:50:06] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:50:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13007826925398789183.gal : 2 ms
[2025-06-03 03:50:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16551121393059118857.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/CTLFireability13007826925398789183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16551121393059118857.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17026e+09,0.853311,22224,2,3484,5,120817,6,0,382,70106,0


Converting to forward existential form...Done !
original formula: (!(E((((((!(((p73==1)&&(p45==1))&&(p91==1)))&&(p30==1))&&((p91==1)&&(!((p66==1)&&(p91==1)))))||((p67==1)&&(p91==1))) + AG((A(((p7==1)&&(p...366
=> equivalent forward existential formula: ([((FwdU((Init * !(E(TRUE U (((p68==1)&&(p92==1)) * ((p43==1) * !(EG(!(((p34==0)||(p92==0)))))))))),(((((!(((p73...833
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t20, t24, t30, t31, t33, t35, t37, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97,...259
(forward)formula 0,1,14.9962,393900,1,0,717,2.21161e+06,252,370,2382,2.87156e+06,872
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2023-13 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 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 75 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 75 transition count 100
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 69 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 69 transition count 94
Applied a total of 44 rules in 3 ms. Remains 69 /91 variables (removed 22) and now considering 94/116 (removed 22) transitions.
// Phase 1: matrix 94 rows 69 cols
[2025-06-03 03:50:21] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-03 03:50:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:21] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:50:22] [INFO ] Implicit Places using invariants and state equation in 166 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 220 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/91 places, 94/116 transitions.
Applied a total of 0 rules in 0 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 68/91 places, 94/116 transitions.
[2025-06-03 03:50:22] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:50:22] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:50:22] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-03 03:50:22] [INFO ] Flatten gal took : 7 ms
[2025-06-03 03:50:22] [INFO ] Flatten gal took : 3 ms
[2025-06-03 03:50:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12858190731913211537.gal : 1 ms
[2025-06-03 03:50:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7294232935456897198.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/CTLFireability12858190731913211537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7294232935456897198.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.35715e+08,0.801686,22204,2,5324,5,123961,6,0,356,67148,0


Converting to forward existential form...Done !
original formula: AG(EX(AF((p16==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((p16==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,0,3.79213,96452,1,0,250,501694,211,145,2102,602342,356
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 75 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 75 transition count 100
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 69 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 69 transition count 94
Applied a total of 44 rules in 2 ms. Remains 69 /91 variables (removed 22) and now considering 94/116 (removed 22) transitions.
[2025-06-03 03:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-03 03:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:26] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-03 03:50:26] [INFO ] Implicit Places using invariants and state equation in 160 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/91 places, 94/116 transitions.
Applied a total of 0 rules in 0 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 68/91 places, 94/116 transitions.
[2025-06-03 03:50:26] [INFO ] Flatten gal took : 4 ms
[2025-06-03 03:50:26] [INFO ] Flatten gal took : 4 ms
[2025-06-03 03:50:26] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-03 03:50:26] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:50:26] [INFO ] Flatten gal took : 5 ms
[2025-06-03 03:50:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11517308954937851603.gal : 1 ms
[2025-06-03 03:50:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6796194408176473551.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/CTLFireability11517308954937851603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6796194408176473551.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.35715e+08,0.755474,22208,2,5324,5,123961,6,0,356,67148,0


Converting to forward existential form...Done !
original formula: AX(EF((p58==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p58==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t25, t27, t28, t30, t32, t34, t36, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...255
(forward)formula 0,1,3.06962,81532,1,0,136,403235,209,90,2146,418372,199
FORMULA DiscoveryGPU-PT-09a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-03 03:50:29] [INFO ] Flatten gal took : 4 ms
[2025-06-03 03:50:29] [INFO ] Flatten gal took : 3 ms
Total runtime 252033 ms.

BK_STOP 1748922629346

--------------------
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="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r058-smll-174854064600658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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