Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640603600522.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is GPUForwardProgress-PT-16b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603600522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 22:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 11 22:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 84K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-00
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-01
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-02
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-03
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-04
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-05
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-06
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-07
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-08
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-09
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-10
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2024-11
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-16b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716508930178

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-16b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 00:02:11] [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]
[2024-05-24 00:02:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:02:11] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-24 00:02:11] [INFO ] Transformed 340 places.
[2024-05-24 00:02:11] [INFO ] Transformed 357 transitions.
[2024-05-24 00:02:11] [INFO ] Found NUPN structural information;
[2024-05-24 00:02:11] [INFO ] Parsed PT model containing 340 places and 357 transitions and 877 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 88 out of 340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 340/340 places, 357/357 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 339 transition count 357
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 314 transition count 332
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 314 transition count 332
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 310 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 310 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 310 transition count 325
Applied a total of 62 rules in 67 ms. Remains 310 /340 variables (removed 30) and now considering 325/357 (removed 32) transitions.
// Phase 1: matrix 325 rows 310 cols
[2024-05-24 00:02:11] [INFO ] Computed 17 invariants in 15 ms
[2024-05-24 00:02:11] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-24 00:02:11] [INFO ] Invariant cache hit.
[2024-05-24 00:02:12] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-24 00:02:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 325/634 variables, 309/326 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/634 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 1/635 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/635 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/635 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 327 constraints, problems are : Problem set: 0 solved, 324 unsolved in 17463 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 325/634 variables, 309/326 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/634 variables, 324/650 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 1/635 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/635 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 635/635 variables, and 651 constraints, problems are : Problem set: 0 solved, 324 unsolved in 18411 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 35980ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 36001ms
Starting structural reductions in LTL mode, iteration 1 : 310/340 places, 325/357 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36593 ms. Remains : 310/340 places, 325/357 transitions.
Support contains 88 out of 310 places after structural reductions.
[2024-05-24 00:02:48] [INFO ] Flatten gal took : 50 ms
[2024-05-24 00:02:48] [INFO ] Flatten gal took : 21 ms
[2024-05-24 00:02:48] [INFO ] Input system was already deterministic with 325 transitions.
RANDOM walk for 40000 steps (274 resets) in 1429 ms. (27 steps per ms) remains 8/72 properties
BEST_FIRST walk for 40004 steps (33 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (35 resets) in 90 ms. (439 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (39 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (34 resets) in 69 ms. (571 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (35 resets) in 66 ms. (597 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
[2024-05-24 00:02:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 299/309 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 325/634 variables, 309/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/635 variables, 1/327 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/635 variables, 0/327 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/635 variables, 0/327 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 327 constraints, problems are : Problem set: 1 solved, 4 unsolved in 302 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 301/309 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 325/634 variables, 309/326 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 4/330 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 0/330 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/635 variables, 1/331 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/635 variables, 0/331 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/635 variables, 0/331 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 635/635 variables, and 331 constraints, problems are : Problem set: 1 solved, 4 unsolved in 384 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 695ms problems are : Problem set: 1 solved, 4 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=97 )
Parikh walk visited 4 properties in 213 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 00:02:50] [INFO ] Flatten gal took : 18 ms
[2024-05-24 00:02:50] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:02:50] [INFO ] Input system was already deterministic with 325 transitions.
Computed a total of 59 stabilizing places and 59 stable transitions
Graph (complete) has 478 edges and 310 vertex of which 290 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 295 transition count 310
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 295 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 295 transition count 306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 287 transition count 298
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 287 transition count 298
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 57 place count 287 transition count 291
Applied a total of 57 rules in 19 ms. Remains 287 /310 variables (removed 23) and now considering 291/325 (removed 34) transitions.
// Phase 1: matrix 291 rows 287 cols
[2024-05-24 00:02:50] [INFO ] Computed 17 invariants in 9 ms
[2024-05-24 00:02:50] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-24 00:02:50] [INFO ] Invariant cache hit.
[2024-05-24 00:02:50] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-05-24 00:02:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 291/577 variables, 286/303 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 1/578 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/578 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 304 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13902 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 291/577 variables, 286/303 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 290/593 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 1/578 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/578 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 594 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15313 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 29274ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 29283ms
Starting structural reductions in LTL mode, iteration 1 : 287/310 places, 291/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29731 ms. Remains : 287/310 places, 291/325 transitions.
[2024-05-24 00:03:20] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:03:20] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:03:20] [INFO ] Input system was already deterministic with 291 transitions.
[2024-05-24 00:03:20] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:03:20] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:03:20] [INFO ] Time to serialize gal into /tmp/CTLFireability10853867089372553486.gal : 8 ms
[2024-05-24 00:03:20] [INFO ] Time to serialize properties into /tmp/CTLFireability122824075169953392.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10853867089372553486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability122824075169953392.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:03:50] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:03:50] [INFO ] Applying decomposition
[2024-05-24 00:03:50] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11087991479673182286.txt' '-o' '/tmp/graph11087991479673182286.bin' '-w' '/tmp/graph11087991479673182286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11087991479673182286.bin' '-l' '-1' '-v' '-w' '/tmp/graph11087991479673182286.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:03:50] [INFO ] Decomposing Gal with order
[2024-05-24 00:03:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:03:50] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-24 00:03:50] [INFO ] Flatten gal took : 47 ms
[2024-05-24 00:03:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-24 00:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6297117926105379815.gal : 13 ms
[2024-05-24 00:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18388122853131194022.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6297117926105379815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18388122853131194022.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.23891e+20,0.192957,11812,819,30,16224,303,550,22260,35,739,0


Converting to forward existential form...Done !
original formula: AF(((i15.i0.u97.p275==1) + ((i0.i1.u4.p9==1) * (((i16.i1.u107.p300==1) + (AX((i11.i0.u70.p199==1)) * A((i0.i1.u4.p10==1) U (i2.i1.u15.p45...374
=> equivalent forward existential formula: [FwdG(Init,!(((i15.i0.u97.p275==1) + ((i0.i1.u4.p9==1) * (((i16.i1.u107.p300==1) + (!(EX(!((i11.i0.u70.p199==1))...490
Reverse transition relation is NOT exact ! Due to transitions t15, t257, i1.t252, i1.i1.u12.t245, i2.i1.t232, i2.i1.t239, i3.t225, i3.i1.u19.t218, i4.t211,...649
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 17
(forward)formula 0,0,22.3455,562768,1,0,1.15456e+06,303,3563,1.08003e+06,173,791,958537
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 294 transition count 309
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 294 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 294 transition count 306
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 284 transition count 296
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 284 transition count 296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 284 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 283 transition count 287
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 283 transition count 287
Applied a total of 65 rules in 17 ms. Remains 283 /310 variables (removed 27) and now considering 287/325 (removed 38) transitions.
// Phase 1: matrix 287 rows 283 cols
[2024-05-24 00:04:13] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 00:04:13] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-24 00:04:13] [INFO ] Invariant cache hit.
[2024-05-24 00:04:13] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-24 00:04:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 1/570 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/570 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 570/570 variables, and 300 constraints, problems are : Problem set: 0 solved, 286 unsolved in 13567 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 287/569 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 286/585 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (OVERLAPS) 1/570 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/570 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 570/570 variables, and 586 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15389 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints]
After SMT, in 29000ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 29002ms
Starting structural reductions in LTL mode, iteration 1 : 283/310 places, 287/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29368 ms. Remains : 283/310 places, 287/325 transitions.
[2024-05-24 00:04:42] [INFO ] Flatten gal took : 27 ms
[2024-05-24 00:04:42] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:04:42] [INFO ] Input system was already deterministic with 287 transitions.
[2024-05-24 00:04:42] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:04:42] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:04:42] [INFO ] Time to serialize gal into /tmp/CTLFireability684863951918062686.gal : 2 ms
[2024-05-24 00:04:42] [INFO ] Time to serialize properties into /tmp/CTLFireability17887280263957878840.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability684863951918062686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17887280263957878840.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:05:12] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:05:12] [INFO ] Applying decomposition
[2024-05-24 00:05:12] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11157011180984615884.txt' '-o' '/tmp/graph11157011180984615884.bin' '-w' '/tmp/graph11157011180984615884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11157011180984615884.bin' '-l' '-1' '-v' '-w' '/tmp/graph11157011180984615884.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:05:12] [INFO ] Decomposing Gal with order
[2024-05-24 00:05:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:05:12] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-24 00:05:12] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:05:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-24 00:05:12] [INFO ] Time to serialize gal into /tmp/CTLFireability14296440340971530600.gal : 11 ms
[2024-05-24 00:05:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9966093277601716681.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14296440340971530600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9966093277601716681.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.91446e+20,0.157845,10012,700,27,12569,326,564,17095,35,879,0


Converting to forward existential form...Done !
original formula: ((EF(EX((A((i16.i0.u106.p294==1) U (i9.i1.u64.p161==1)) * (i17.i1.u111.p317==1)))) * EG(EF((AX(E((i17.i1.u117.p335==1) U (i7.i0.u47.p135=...424
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EX((!((E(!((i9.i1.u64.p161==1)) U (!((i16.i0.u106.p294==1)) * !((i9.i1.u64.p161==1)))) + E...778
Reverse transition relation is NOT exact ! Due to transitions t253, i1.i0.t241, i1.i0.u11.t248, i2.t235, i2.i0.t228, i3.t221, i3.i1.u21.t214, i4.t207, i4.i...661
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 17
(forward)formula 0,1,13.4667,370372,1,0,800036,326,3726,802788,173,879,756291
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Graph (trivial) has 268 edges and 310 vertex of which 6 / 310 are part of one of the 1 SCC in 12 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 472 edges and 305 vertex of which 285 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 152 place count 284 transition count 165
Reduce places removed 150 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 164 rules applied. Total rules applied 316 place count 134 transition count 151
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 325 place count 131 transition count 145
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 11 rules applied. Total rules applied 336 place count 125 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 338 place count 123 transition count 140
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 30 Pre rules applied. Total rules applied 338 place count 123 transition count 110
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 398 place count 93 transition count 110
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 415 place count 76 transition count 93
Iterating global reduction 5 with 17 rules applied. Total rules applied 432 place count 76 transition count 93
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 432 place count 76 transition count 91
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 436 place count 74 transition count 91
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 502 place count 41 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 503 place count 40 transition count 57
Applied a total of 503 rules in 56 ms. Remains 40 /310 variables (removed 270) and now considering 57/325 (removed 268) transitions.
// Phase 1: matrix 57 rows 40 cols
[2024-05-24 00:05:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:05:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 00:05:26] [INFO ] Invariant cache hit.
[2024-05-24 00:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:05:26] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-24 00:05:26] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-24 00:05:26] [INFO ] Invariant cache hit.
[2024-05-24 00:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 56/80 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 16/96 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 1/97 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 41 constraints, problems are : Problem set: 0 solved, 40 unsolved in 469 ms.
Refiners :[State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 56/80 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 16/96 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 32/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 1/97 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 81 constraints, problems are : Problem set: 0 solved, 40 unsolved in 423 ms.
Refiners :[State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 915ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 916ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/310 places, 57/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1092 ms. Remains : 40/310 places, 57/325 transitions.
[2024-05-24 00:05:27] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:05:27] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:05:27] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-24 00:05:27] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:05:27] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:05:27] [INFO ] Time to serialize gal into /tmp/CTLFireability837710456343384257.gal : 14 ms
[2024-05-24 00:05:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10183192170586721041.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability837710456343384257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10183192170586721041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.93691e+09,0.309992,15776,2,581,5,84137,6,0,217,59426,0


Converting to forward existential form...Done !
original formula: EG(E(E(EG((p171!=1)) U (p27==1)) U (p63==1)))
=> equivalent forward existential formula: [FwdG(Init,E(E(EG((p171!=1)) U (p27==1)) U (p63==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t11, t13, t15, t17, t19, t21, t23, t25, t27, t29, t31, t33, t35, t37, t38, t3...256
(forward)formula 0,1,4.80588,167736,1,0,637,960044,147,389,1407,1.28249e+06,664
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Graph (trivial) has 260 edges and 310 vertex of which 6 / 310 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 472 edges and 305 vertex of which 285 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 149 place count 284 transition count 168
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 161 rules applied. Total rules applied 310 place count 137 transition count 154
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 314 place count 134 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 133 transition count 153
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 315 place count 133 transition count 120
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 381 place count 100 transition count 120
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 398 place count 83 transition count 103
Iterating global reduction 4 with 17 rules applied. Total rules applied 415 place count 83 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 415 place count 83 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 419 place count 81 transition count 101
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 481 place count 50 transition count 70
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 486 place count 50 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 487 place count 49 transition count 69
Applied a total of 487 rules in 29 ms. Remains 49 /310 variables (removed 261) and now considering 69/325 (removed 256) transitions.
// Phase 1: matrix 69 rows 49 cols
[2024-05-24 00:05:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:05:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 00:05:32] [INFO ] Invariant cache hit.
[2024-05-24 00:05:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:05:32] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 00:05:32] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-24 00:05:32] [INFO ] Invariant cache hit.
[2024-05-24 00:05:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 68/101 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 16/117 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/118 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 50 constraints, problems are : Problem set: 0 solved, 47 unsolved in 583 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 68/101 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 16/117 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 30/96 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/118 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 97 constraints, problems are : Problem set: 0 solved, 47 unsolved in 627 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1224ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1224ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/310 places, 69/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1321 ms. Remains : 49/310 places, 69/325 transitions.
[2024-05-24 00:05:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:05:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:05:33] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-24 00:05:33] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:05:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:05:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4172979917180327666.gal : 1 ms
[2024-05-24 00:05:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7530177855447702824.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4172979917180327666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7530177855447702824.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.39532e+10,0.147506,9708,2,880,5,40619,6,0,262,29475,0


Converting to forward existential form...Done !
original formula: EF(((AF((p127==1)) * (E((p110==1) U (p87==1)) + A((p275==1) U (p163==1)))) * ((p196==0)||(p260==0))))
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * ((p196==0)||(p260==0))) * !(EG(!((p127==1))))),(p110==1)) * (p87==1))] != FALSE + [(...310
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t7, t13, t15, t18, t19, t21, t24, t27, t29, t31, t33, t36, t37, t39, t42, t44, t4...266
Hit Full ! (commute/partial/dont) 67/0/2
(forward)formula 0,1,2.73739,102240,1,0,503,631051,169,228,1776,730482,532
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 294 transition count 309
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 294 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 294 transition count 306
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 285 transition count 297
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 285 transition count 297
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 61 place count 285 transition count 289
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 284 transition count 288
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 284 transition count 288
Applied a total of 63 rules in 28 ms. Remains 284 /310 variables (removed 26) and now considering 288/325 (removed 37) transitions.
// Phase 1: matrix 288 rows 284 cols
[2024-05-24 00:05:36] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 00:05:36] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-24 00:05:36] [INFO ] Invariant cache hit.
[2024-05-24 00:05:36] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-05-24 00:05:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 288/571 variables, 283/300 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 1/572 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (OVERLAPS) 0/572 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 301 constraints, problems are : Problem set: 0 solved, 287 unsolved in 14002 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 288/571 variables, 283/300 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 287/587 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/572 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 572/572 variables, and 588 constraints, problems are : Problem set: 0 solved, 287 unsolved in 16633 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints]
After SMT, in 30674ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 30677ms
Starting structural reductions in LTL mode, iteration 1 : 284/310 places, 288/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30972 ms. Remains : 284/310 places, 288/325 transitions.
[2024-05-24 00:06:07] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:06:07] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:06:07] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-24 00:06:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:06:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:06:07] [INFO ] Time to serialize gal into /tmp/CTLFireability12258614089937121095.gal : 2 ms
[2024-05-24 00:06:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1830149750135222431.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12258614089937121095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1830149750135222431.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:06:37] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:06:37] [INFO ] Applying decomposition
[2024-05-24 00:06:37] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17887740479985265231.txt' '-o' '/tmp/graph17887740479985265231.bin' '-w' '/tmp/graph17887740479985265231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17887740479985265231.bin' '-l' '-1' '-v' '-w' '/tmp/graph17887740479985265231.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:06:37] [INFO ] Decomposing Gal with order
[2024-05-24 00:06:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:06:37] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-24 00:06:37] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:06:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 00:06:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9034733634538813080.gal : 18 ms
[2024-05-24 00:06:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11993905737763509403.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9034733634538813080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11993905737763509403.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Graph (trivial) has 270 edges and 310 vertex of which 6 / 310 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 472 edges and 305 vertex of which 285 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.3 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 284 transition count 162
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 171 rules applied. Total rules applied 326 place count 131 transition count 144
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 331 place count 126 transition count 144
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 331 place count 126 transition count 112
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 395 place count 94 transition count 112
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 412 place count 77 transition count 95
Iterating global reduction 3 with 17 rules applied. Total rules applied 429 place count 77 transition count 95
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 429 place count 77 transition count 93
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 433 place count 75 transition count 93
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 495 place count 44 transition count 62
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 496 place count 44 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 497 place count 43 transition count 61
Applied a total of 497 rules in 26 ms. Remains 43 /310 variables (removed 267) and now considering 61/325 (removed 264) transitions.
// Phase 1: matrix 61 rows 43 cols
[2024-05-24 00:07:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:07:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 00:07:07] [INFO ] Invariant cache hit.
[2024-05-24 00:07:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:07:07] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-24 00:07:07] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-24 00:07:07] [INFO ] Invariant cache hit.
[2024-05-24 00:07:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 60/90 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 13/103 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 44 constraints, problems are : Problem set: 0 solved, 46 unsolved in 509 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 60/90 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 13/103 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 29/89 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/104 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 90 constraints, problems are : Problem set: 0 solved, 46 unsolved in 569 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1087ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1088ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/310 places, 61/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1244 ms. Remains : 43/310 places, 61/325 transitions.
[2024-05-24 00:07:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:07:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:07:08] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-24 00:07:08] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:07:08] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:07:08] [INFO ] Time to serialize gal into /tmp/CTLFireability6352245966927228012.gal : 1 ms
[2024-05-24 00:07:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10234213347641915764.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6352245966927228012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10234213347641915764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.60476e+09,0.44904,19540,2,2396,5,96139,6,0,231,75087,0


Converting to forward existential form...Done !
original formula: EF(EG((EG((p167==0)) * ((p15==0)||(p198==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EG((p167==0)) * ((p15==0)||(p198==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t13, t15, t17, t19, t21, t23, t26, t28, t30, t32, t34, t36, t38, t39, t4...266
(forward)formula 0,1,4.44709,143880,1,0,432,885860,148,198,1497,1.0166e+06,463
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-05 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 : 310/310 places, 325/325 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 294 transition count 309
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 294 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 294 transition count 305
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 46 place count 284 transition count 295
Iterating global reduction 1 with 10 rules applied. Total rules applied 56 place count 284 transition count 295
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 64 place count 284 transition count 287
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 283 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 283 transition count 286
Applied a total of 66 rules in 22 ms. Remains 283 /310 variables (removed 27) and now considering 286/325 (removed 39) transitions.
// Phase 1: matrix 286 rows 283 cols
[2024-05-24 00:07:13] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 00:07:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-24 00:07:13] [INFO ] Invariant cache hit.
[2024-05-24 00:07:13] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-24 00:07:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 286/568 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/568 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 1/569 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (OVERLAPS) 0/569 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 300 constraints, problems are : Problem set: 0 solved, 285 unsolved in 13770 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (OVERLAPS) 286/568 variables, 282/299 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/568 variables, 285/584 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/568 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 1/569 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/569 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 585 constraints, problems are : Problem set: 0 solved, 285 unsolved in 17354 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
After SMT, in 31166ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 31169ms
Starting structural reductions in LTL mode, iteration 1 : 283/310 places, 286/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31398 ms. Remains : 283/310 places, 286/325 transitions.
[2024-05-24 00:07:44] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:07:44] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:07:44] [INFO ] Input system was already deterministic with 286 transitions.
[2024-05-24 00:07:44] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:07:44] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:07:44] [INFO ] Time to serialize gal into /tmp/CTLFireability18349980079659298005.gal : 1 ms
[2024-05-24 00:07:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5371448263524685134.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18349980079659298005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5371448263524685134.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:08:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:08:14] [INFO ] Applying decomposition
[2024-05-24 00:08:14] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14903157441072648661.txt' '-o' '/tmp/graph14903157441072648661.bin' '-w' '/tmp/graph14903157441072648661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14903157441072648661.bin' '-l' '-1' '-v' '-w' '/tmp/graph14903157441072648661.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:08:14] [INFO ] Decomposing Gal with order
[2024-05-24 00:08:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:08:14] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-24 00:08:14] [INFO ] Flatten gal took : 12 ms
[2024-05-24 00:08:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:08:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12687540673458856424.gal : 3 ms
[2024-05-24 00:08:14] [INFO ] Time to serialize properties into /tmp/CTLFireability1384708685285327636.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12687540673458856424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1384708685285327636.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.91446e+20,0.217499,12944,905,28,18753,311,490,30200,36,705,0


Converting to forward existential form...Done !
original formula: EG(EX(((EG((i5.u34.p90==0)) + (((i4.u32.p82==1)&&(i17.u115.p321==1))&&(i17.u117.p336==1))) * ((i6.u47.p122==1) + EG((i6.u41.p123==0))))))
=> equivalent forward existential formula: [FwdG(Init,EX(((EG((i5.u34.p90==0)) + (((i4.u32.p82==1)&&(i17.u115.p321==1))&&(i17.u117.p336==1))) * ((i6.u47.p1...198
Reverse transition relation is NOT exact ! Due to transitions t252, i1.t247, i1.u8.t240, i2.t227, i2.u16.t234, i3.t220, i3.t213, i4.t206, i4.t199, i5.t192,...570
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 307
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 307
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 292 transition count 303
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 281 transition count 292
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 281 transition count 292
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 71 place count 281 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 280 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 280 transition count 282
Applied a total of 73 rules in 11 ms. Remains 280 /310 variables (removed 30) and now considering 282/325 (removed 43) transitions.
// Phase 1: matrix 282 rows 280 cols
[2024-05-24 00:08:44] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 00:08:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-24 00:08:45] [INFO ] Invariant cache hit.
[2024-05-24 00:08:45] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-24 00:08:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 281 unsolved in 13409 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 578 constraints, problems are : Problem set: 0 solved, 281 unsolved in 18734 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
After SMT, in 32178ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 32182ms
Starting structural reductions in LTL mode, iteration 1 : 280/310 places, 282/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32426 ms. Remains : 280/310 places, 282/325 transitions.
[2024-05-24 00:09:17] [INFO ] Flatten gal took : 7 ms
[2024-05-24 00:09:17] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:09:17] [INFO ] Input system was already deterministic with 282 transitions.
[2024-05-24 00:09:17] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:09:17] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:09:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5005265672238542906.gal : 1 ms
[2024-05-24 00:09:17] [INFO ] Time to serialize properties into /tmp/CTLFireability17849011166013671555.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5005265672238542906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17849011166013671555.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:09:47] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:09:47] [INFO ] Applying decomposition
[2024-05-24 00:09:47] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14121149852352444858.txt' '-o' '/tmp/graph14121149852352444858.bin' '-w' '/tmp/graph14121149852352444858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14121149852352444858.bin' '-l' '-1' '-v' '-w' '/tmp/graph14121149852352444858.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:09:47] [INFO ] Decomposing Gal with order
[2024-05-24 00:09:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:09:47] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-24 00:09:47] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:09:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:09:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11920593604781929287.gal : 3 ms
[2024-05-24 00:09:47] [INFO ] Time to serialize properties into /tmp/CTLFireability12284460430885228603.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11920593604781929287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12284460430885228603.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.07235e+20,0.173789,11548,670,26,15715,316,537,22846,35,859,0


Converting to forward existential form...Done !
original formula: AF(EX(AG(((E((i8.i0.u55.p150==1) U (i7.i0.u46.p132==1)) + (i5.i1.u37.p102==1)) + (((i17.i0.u109.p318==1)&&(i11.i1.u74.p208==1))&&((i17.i0...198
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !(((E((i8.i0.u55.p150==1) U (i7.i0.u46.p132==1)) + (i5.i1.u37.p102==1)) + (((i17.i0.u...255
Reverse transition relation is NOT exact ! Due to transitions t248, i1.t243, i1.i1.u8.t236, i2.t230, i2.i1.t223, i3.t216, i3.i1.u21.t209, i4.t202, i4.i1.u2...651
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 17
(forward)formula 0,0,4.39803,143812,1,0,370608,364,3895,237134,179,1094,401739
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Graph (trivial) has 268 edges and 310 vertex of which 6 / 310 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 472 edges and 305 vertex of which 285 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.5 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 284 transition count 163
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 168 rules applied. Total rules applied 322 place count 132 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 326 place count 128 transition count 147
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 326 place count 128 transition count 115
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 390 place count 96 transition count 115
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 407 place count 79 transition count 98
Iterating global reduction 3 with 17 rules applied. Total rules applied 424 place count 79 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 424 place count 79 transition count 96
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 428 place count 77 transition count 96
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 492 place count 45 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 45 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 494 place count 44 transition count 63
Applied a total of 494 rules in 25 ms. Remains 44 /310 variables (removed 266) and now considering 63/325 (removed 262) transitions.
// Phase 1: matrix 63 rows 44 cols
[2024-05-24 00:09:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:09:52] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 00:09:52] [INFO ] Invariant cache hit.
[2024-05-24 00:09:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:09:52] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 00:09:52] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-24 00:09:52] [INFO ] Invariant cache hit.
[2024-05-24 00:09:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 62/90 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 16/106 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 1/107 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 45 constraints, problems are : Problem set: 0 solved, 45 unsolved in 477 ms.
Refiners :[State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 62/90 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 16/106 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 30/89 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/107 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/107 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 90 constraints, problems are : Problem set: 0 solved, 45 unsolved in 572 ms.
Refiners :[State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1055ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1056ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/310 places, 63/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1173 ms. Remains : 44/310 places, 63/325 transitions.
[2024-05-24 00:09:53] [INFO ] Flatten gal took : 3 ms
[2024-05-24 00:09:53] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:09:53] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-24 00:09:53] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:09:53] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:09:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1551670413902105040.gal : 1 ms
[2024-05-24 00:09:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15733196800478778980.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1551670413902105040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15733196800478778980.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,7.25895e+09,0.436224,19384,2,671,5,110418,6,0,238,70703,0


Converting to forward existential form...Done !
original formula: !(A(!(E((p62==1) U EF((p180==1)))) U EG((p196==1))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG((p196==1)))) * !(!(E((p62==1) U E(TRUE U (p180==1)))))) * !(EG((p196==1))))] != FALSE + [FwdG...189
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t13, t14, t16, t18, t20, t22, t24, t26, t28, t30, t32, t34, t36, t38, t40, t42, t...262
(forward)formula 0,1,2.65365,90008,1,0,489,553435,161,310,1580,578369,607
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-08 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 : 310/310 places, 325/325 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 307
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 307
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 292 transition count 303
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 281 transition count 292
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 281 transition count 292
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 71 place count 281 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 280 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 280 transition count 282
Applied a total of 73 rules in 15 ms. Remains 280 /310 variables (removed 30) and now considering 282/325 (removed 43) transitions.
// Phase 1: matrix 282 rows 280 cols
[2024-05-24 00:09:55] [INFO ] Computed 17 invariants in 3 ms
[2024-05-24 00:09:55] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 00:09:55] [INFO ] Invariant cache hit.
[2024-05-24 00:09:56] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-24 00:09:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 1/562 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/562 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 297 constraints, problems are : Problem set: 0 solved, 281 unsolved in 13335 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 282/561 variables, 279/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 1/562 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 578 constraints, problems are : Problem set: 0 solved, 281 unsolved in 18921 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
After SMT, in 32290ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 32294ms
Starting structural reductions in LTL mode, iteration 1 : 280/310 places, 282/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32524 ms. Remains : 280/310 places, 282/325 transitions.
[2024-05-24 00:10:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:10:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:10:28] [INFO ] Input system was already deterministic with 282 transitions.
[2024-05-24 00:10:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:10:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:10:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14302349917234802949.gal : 2 ms
[2024-05-24 00:10:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17995835887407344327.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14302349917234802949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17995835887407344327.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:10:58] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:10:58] [INFO ] Applying decomposition
[2024-05-24 00:10:58] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15543630862767173726.txt' '-o' '/tmp/graph15543630862767173726.bin' '-w' '/tmp/graph15543630862767173726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15543630862767173726.bin' '-l' '-1' '-v' '-w' '/tmp/graph15543630862767173726.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:10:58] [INFO ] Decomposing Gal with order
[2024-05-24 00:10:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:10:58] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-24 00:10:58] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:10:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:10:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11498694917572527122.gal : 3 ms
[2024-05-24 00:10:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18054942782002007013.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11498694917572527122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18054942782002007013.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Graph (trivial) has 270 edges and 310 vertex of which 6 / 310 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 472 edges and 305 vertex of which 285 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 284 transition count 162
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 172 rules applied. Total rules applied 327 place count 131 transition count 143
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 332 place count 126 transition count 143
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 332 place count 126 transition count 109
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 400 place count 92 transition count 109
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 417 place count 75 transition count 92
Iterating global reduction 3 with 17 rules applied. Total rules applied 434 place count 75 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 434 place count 75 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 438 place count 73 transition count 90
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 500 place count 42 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 501 place count 41 transition count 58
Applied a total of 501 rules in 14 ms. Remains 41 /310 variables (removed 269) and now considering 58/325 (removed 267) transitions.
// Phase 1: matrix 58 rows 41 cols
[2024-05-24 00:11:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:11:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 00:11:28] [INFO ] Invariant cache hit.
[2024-05-24 00:11:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:11:28] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-24 00:11:28] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-24 00:11:28] [INFO ] Invariant cache hit.
[2024-05-24 00:11:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 57/82 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 16/98 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 1/99 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 42 constraints, problems are : Problem set: 0 solved, 41 unsolved in 425 ms.
Refiners :[State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 57/82 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 16/98 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 83 constraints, problems are : Problem set: 0 solved, 41 unsolved in 509 ms.
Refiners :[State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 940ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/310 places, 58/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1026 ms. Remains : 41/310 places, 58/325 transitions.
[2024-05-24 00:11:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:11:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:11:29] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-24 00:11:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:11:29] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:11:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6436958748185512047.gal : 0 ms
[2024-05-24 00:11:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7119663705564810643.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6436958748185512047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7119663705564810643.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.59962e+09,0.145513,9348,2,760,5,36949,6,0,220,26857,0


Converting to forward existential form...Done !
original formula: A(EF((p123==1)) U (p70==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p70==1))))) * !(E(!((p70==1)) U (!(E(TRUE U (p123==1))) * !((p70==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t7, t9, t11, t13, t15, t18, t21, t22, t24, t26, t28, t30, t32, t34, t36, t38,...264
(forward)formula 0,0,2.09533,78956,1,0,431,503743,144,205,1455,536312,472
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Graph (trivial) has 260 edges and 310 vertex of which 6 / 310 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 472 edges and 305 vertex of which 285 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 284 transition count 170
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 161 rules applied. Total rules applied 308 place count 139 transition count 154
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 316 place count 135 transition count 150
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 320 place count 131 transition count 150
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 320 place count 131 transition count 118
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 384 place count 99 transition count 118
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 402 place count 81 transition count 100
Iterating global reduction 4 with 18 rules applied. Total rules applied 420 place count 81 transition count 100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 420 place count 81 transition count 98
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 424 place count 79 transition count 98
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 486 place count 48 transition count 67
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 488 place count 48 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 489 place count 47 transition count 66
Applied a total of 489 rules in 18 ms. Remains 47 /310 variables (removed 263) and now considering 66/325 (removed 259) transitions.
// Phase 1: matrix 66 rows 47 cols
[2024-05-24 00:11:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:11:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 00:11:31] [INFO ] Invariant cache hit.
[2024-05-24 00:11:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:11:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 00:11:31] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-24 00:11:31] [INFO ] Invariant cache hit.
[2024-05-24 00:11:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 65/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 12/112 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 48 constraints, problems are : Problem set: 0 solved, 52 unsolved in 617 ms.
Refiners :[State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 65/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 12/112 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 22/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 100 constraints, problems are : Problem set: 0 solved, 52 unsolved in 778 ms.
Refiners :[State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1403ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1404ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/310 places, 66/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1487 ms. Remains : 47/310 places, 66/325 transitions.
[2024-05-24 00:11:33] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:11:33] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-24 00:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:11:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 00:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15204568706157519952.gal : 1 ms
[2024-05-24 00:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability17012589172772307693.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15204568706157519952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17012589172772307693.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.39706e+10,0.256416,13108,2,1072,5,58261,6,0,253,47217,0


Converting to forward existential form...Done !
original formula: (AG((p19==1)) + EF(!(E(!((((p127==1)||(p24==1)) * EF((p150==1)))) U !(((EF((p19==1)) + (p89==1)) + (p103==1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U !(E(!((((p127==1)||(p24==1)) * E(TRUE U (p150==1)))) U !(((E(TRUE U (p19==1)) + (p89==...207
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t11, t12, t13, t15, t17, t19, t23, t24, t27, t29, t31, t33, t35, t37, t39, t41, t43, ...268
(forward)formula 0,1,2.78449,97336,1,0,221,604319,160,114,1636,656052,209
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Graph (trivial) has 265 edges and 310 vertex of which 6 / 310 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 472 edges and 305 vertex of which 285 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 153 place count 284 transition count 164
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 169 rules applied. Total rules applied 322 place count 133 transition count 146
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 328 place count 128 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 329 place count 127 transition count 145
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 329 place count 127 transition count 113
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 393 place count 95 transition count 113
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 410 place count 78 transition count 96
Iterating global reduction 4 with 17 rules applied. Total rules applied 427 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 428 place count 78 transition count 95
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 428 place count 78 transition count 93
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 432 place count 76 transition count 93
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 500 place count 42 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 501 place count 41 transition count 58
Applied a total of 501 rules in 14 ms. Remains 41 /310 variables (removed 269) and now considering 58/325 (removed 267) transitions.
// Phase 1: matrix 58 rows 41 cols
[2024-05-24 00:11:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:11:36] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 00:11:36] [INFO ] Invariant cache hit.
[2024-05-24 00:11:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-24 00:11:36] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-24 00:11:36] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 00:11:36] [INFO ] Invariant cache hit.
[2024-05-24 00:11:36] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 57/97 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 1/99 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 58 constraints, problems are : Problem set: 0 solved, 56 unsolved in 803 ms.
Refiners :[State Equation: 41/41 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 57/97 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 56/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 114 constraints, problems are : Problem set: 0 solved, 56 unsolved in 894 ms.
Refiners :[State Equation: 41/41 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 1707ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1707ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/310 places, 58/325 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1795 ms. Remains : 41/310 places, 58/325 transitions.
[2024-05-24 00:11:37] [INFO ] Flatten gal took : 3 ms
[2024-05-24 00:11:37] [INFO ] Flatten gal took : 3 ms
[2024-05-24 00:11:37] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-24 00:11:37] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:11:37] [INFO ] Flatten gal took : 1 ms
[2024-05-24 00:11:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16811608836417207373.gal : 1 ms
[2024-05-24 00:11:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15403866872767716032.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16811608836417207373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15403866872767716032.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.88413e+09,0.956046,36324,2,1641,5,200368,6,0,221,153510,0


Converting to forward existential form...Done !
original formula: AF(((p337==0) * AG(E((p329==1) U (p258==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((p337==0) * !(E(TRUE U !(E((p329==1) U (p258==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...337
(forward)formula 0,0,1.95519,50552,1,0,176,281464,145,74,1502,247253,149
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 292 transition count 307
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 292 transition count 307
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 292 transition count 303
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 282 transition count 293
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 282 transition count 293
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 282 transition count 285
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 281 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 281 transition count 284
Applied a total of 70 rules in 11 ms. Remains 281 /310 variables (removed 29) and now considering 284/325 (removed 41) transitions.
// Phase 1: matrix 284 rows 281 cols
[2024-05-24 00:11:39] [INFO ] Computed 17 invariants in 3 ms
[2024-05-24 00:11:39] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 00:11:39] [INFO ] Invariant cache hit.
[2024-05-24 00:11:40] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-24 00:11:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 284/564 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/564 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 1/565 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/565 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 298 constraints, problems are : Problem set: 0 solved, 283 unsolved in 13559 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 284/564 variables, 280/297 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/564 variables, 283/580 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/564 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 1/565 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/565 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 581 constraints, problems are : Problem set: 0 solved, 283 unsolved in 14780 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
After SMT, in 28373ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 28376ms
Starting structural reductions in LTL mode, iteration 1 : 281/310 places, 284/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28706 ms. Remains : 281/310 places, 284/325 transitions.
[2024-05-24 00:12:08] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:12:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:12:08] [INFO ] Input system was already deterministic with 284 transitions.
[2024-05-24 00:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:12:08] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:12:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12186453843803690373.gal : 2 ms
[2024-05-24 00:12:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1201225915275968860.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12186453843803690373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1201225915275968860.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:12:38] [INFO ] Flatten gal took : 8 ms
[2024-05-24 00:12:38] [INFO ] Applying decomposition
[2024-05-24 00:12:38] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11553770586667651555.txt' '-o' '/tmp/graph11553770586667651555.bin' '-w' '/tmp/graph11553770586667651555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11553770586667651555.bin' '-l' '-1' '-v' '-w' '/tmp/graph11553770586667651555.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:12:38] [INFO ] Decomposing Gal with order
[2024-05-24 00:12:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:12:38] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-24 00:12:38] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:12:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:12:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3551268647142298690.gal : 3 ms
[2024-05-24 00:12:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3831521608844851018.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3551268647142298690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3831521608844851018.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.34123e+20,0.135932,9692,806,27,12202,305,537,15544,35,802,0


Converting to forward existential form...Done !
original formula: AG((EG(EX((i5.i0.u35.p98==1))) + EF(((i15.i1.u101.p283==0)&&(i5.i0.u34.p96==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U ((i15.i1.u101.p283==0)&&(i5.i0.u34.p96==1))))) * !(EG(EX((i5.i0.u35.p98==1)))))]...163
Reverse transition relation is NOT exact ! Due to transitions t2, t250, i1.t245, i1.i0.t238, i2.t232, i2.i2.t225, i3.t218, i3.i1.u26.t211, i4.i1.t197, i4.i...625
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 17
(forward)formula 0,0,5.62017,185516,1,0,463277,305,3620,349858,180,802,489131
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 325/325 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 295 transition count 310
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 295 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 295 transition count 306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 287 transition count 298
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 287 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 287 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 286 transition count 291
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 286 transition count 291
Applied a total of 58 rules in 41 ms. Remains 286 /310 variables (removed 24) and now considering 291/325 (removed 34) transitions.
// Phase 1: matrix 291 rows 286 cols
[2024-05-24 00:12:44] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 00:12:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-24 00:12:44] [INFO ] Invariant cache hit.
[2024-05-24 00:12:44] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-05-24 00:12:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 291/576 variables, 285/302 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 1/577 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/577 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/577 variables, and 303 constraints, problems are : Problem set: 0 solved, 290 unsolved in 13924 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (OVERLAPS) 291/576 variables, 285/302 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 290/592 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/576 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 1/577 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 0/577 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/577 variables, and 593 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15556 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 29515ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 29518ms
Starting structural reductions in LTL mode, iteration 1 : 286/310 places, 291/325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29777 ms. Remains : 286/310 places, 291/325 transitions.
[2024-05-24 00:13:14] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:13:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 00:13:14] [INFO ] Input system was already deterministic with 291 transitions.
[2024-05-24 00:13:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:13:14] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:13:14] [INFO ] Time to serialize gal into /tmp/CTLFireability576457554476557120.gal : 1 ms
[2024-05-24 00:13:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7575224532469001831.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability576457554476557120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7575224532469001831.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-24 00:13:44] [INFO ] Flatten gal took : 10 ms
[2024-05-24 00:13:44] [INFO ] Applying decomposition
[2024-05-24 00:13:44] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4315974447013851469.txt' '-o' '/tmp/graph4315974447013851469.bin' '-w' '/tmp/graph4315974447013851469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4315974447013851469.bin' '-l' '-1' '-v' '-w' '/tmp/graph4315974447013851469.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:13:44] [INFO ] Decomposing Gal with order
[2024-05-24 00:13:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:13:44] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-24 00:13:44] [INFO ] Flatten gal took : 13 ms
[2024-05-24 00:13:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:13:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6830833950413742721.gal : 2 ms
[2024-05-24 00:13:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16580113916792790337.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6830833950413742721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16580113916792790337.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.90184e+20,0.151188,10528,591,28,14332,245,527,18003,36,527,0


Converting to forward existential form...Done !
original formula: (E((AF(AG((((i16.i0.u105.p292==1)&&(i17.u113.p321==1))&&(i17.u116.p336==1)))) + EF((i0.i1.u13.p32!=1))) U (((AX((i11.i1.u73.p210==1)) + E...799
=> equivalent forward existential formula: ([(((Init * !(E((!(EG(!(!(E(TRUE U !((((i16.i0.u105.p292==1)&&(i17.u113.p321==1))&&(i17.u116.p336==1)))))))) + E...2310
Reverse transition relation is NOT exact ! Due to transitions t257, i0.t252, i0.i1.u8.t242, i1.t236, i1.i1.u14.t226, i2.t219, i2.i1.u25.t212, i3.t205, i3.i...634
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 17
(forward)formula 0,1,20.0787,558328,1,0,1.16483e+06,257,3987,1.29942e+06,191,646,1093433
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-24 00:14:04] [INFO ] Flatten gal took : 6 ms
[2024-05-24 00:14:04] [INFO ] Flatten gal took : 5 ms
[2024-05-24 00:14:04] [INFO ] Applying decomposition
[2024-05-24 00:14:04] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph308010412516335265.txt' '-o' '/tmp/graph308010412516335265.bin' '-w' '/tmp/graph308010412516335265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph308010412516335265.bin' '-l' '-1' '-v' '-w' '/tmp/graph308010412516335265.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:14:04] [INFO ] Decomposing Gal with order
[2024-05-24 00:14:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:14:04] [INFO ] Removed a total of 84 redundant transitions.
[2024-05-24 00:14:04] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:14:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 00:14:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15949246347383532967.gal : 2 ms
[2024-05-24 00:14:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16225992629813995065.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15949246347383532967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16225992629813995065.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93437e+21,0.116774,8680,726,26,9791,242,598,13792,36,489,0


Converting to forward existential form...Done !
original formula: !(A((AX(EF((i13.i0.u93.p241==1))) + EG(E((i9.i1.u63.p163==1) U (i13.i2.u94.p245==1)))) U EF(AG((i17.i1.u127.p338==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(E(TRUE U !((i17.i1.u127.p338==1))))))) * !((!(EX(!(E(TRUE U (i13.i0.u93.p241==1))))) ...349
Reverse transition relation is NOT exact ! Due to transitions t4, t17, t291, i1.t286, i1.i2.t276, i2.t270, i2.i2.t260, i3.i0.t244, i3.i0.t253, i4.t238, i4....624
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,3.17428,108208,1,0,202473,300,4929,317255,202,849,243481
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX(((EG((i5.i0.u36.p90==0)) + (((i4.u32.p82==1)&&(i18.u121.p321==1))&&(i18.u126.p336==1))) * ((i6.i0.u44.p122==1) + EG((i6.i0.u42.p123...164
=> equivalent forward existential formula: [FwdG(Init,EX(((EG((i5.i0.u36.p90==0)) + (((i4.u32.p82==1)&&(i18.u121.p321==1))&&(i18.u126.p336==1))) * ((i6.i0....207
(forward)formula 1,1,31.0624,726760,1,0,1.37346e+06,315,5077,1.54267e+06,205,884,1093654
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(!(A(!((((i5.i1.u38.p100==1)&&(i18.u121.p321==1))&&(i18.u126.p336==1))) U AX(!(((i16.i1.u115.p300==1)||(i10.i0.u69.p189==1)))))))
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,TRUE),!(!(EX(!(!(((i16.i1.u115.p300==1)||(i10.i0.u69.p189==1)))))))) * !(!((((i5.i1.u38.p1...364
(forward)formula 2,1,31.0746,727288,1,0,1.3745e+06,317,5094,1.54464e+06,205,887,1095646
FORMULA GPUForwardProgress-PT-16b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 744418 ms.

BK_STOP 1716509675778

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-16b"
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-5568"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-16b, 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 r180-tall-171640603600522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-16b.tgz
mv GPUForwardProgress-PT-16b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;