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.r136-tall-171631132700458.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 DiscoveryGPU-PT-12a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132700458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 02:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 43K 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 DiscoveryGPU-PT-12a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-12a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716378928215

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 11:55:29] [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-22 11:55:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:55:29] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-22 11:55:29] [INFO ] Transformed 123 places.
[2024-05-22 11:55:29] [INFO ] Transformed 169 transitions.
[2024-05-22 11:55:29] [INFO ] Found NUPN structural information;
[2024-05-22 11:55:29] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 63 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 164
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 164
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 114 transition count 160
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 114 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 113 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 113 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 31 place count 113 transition count 147
Applied a total of 31 rules in 32 ms. Remains 113 /123 variables (removed 10) and now considering 147/169 (removed 22) transitions.
// Phase 1: matrix 147 rows 113 cols
[2024-05-22 11:55:29] [INFO ] Computed 2 invariants in 10 ms
[2024-05-22 11:55:29] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 11:55:29] [INFO ] Invariant cache hit.
[2024-05-22 11:55:29] [INFO ] State equation strengthened by 92 read => feed constraints.
[2024-05-22 11:55:29] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 11:55:29] [INFO ] Invariant cache hit.
[2024-05-22 11:55:29] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/260 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 92/207 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 207 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3864 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/260 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 92/207 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 146/353 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 353 constraints, problems are : Problem set: 0 solved, 146 unsolved in 2755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 6681ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 6698ms
Starting structural reductions in LTL mode, iteration 1 : 113/123 places, 147/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7124 ms. Remains : 113/123 places, 147/169 transitions.
Support contains 63 out of 113 places after structural reductions.
[2024-05-22 11:55:36] [INFO ] Flatten gal took : 28 ms
[2024-05-22 11:55:36] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:55:36] [INFO ] Input system was already deterministic with 147 transitions.
Reduction of identical properties reduced properties to check from 66 to 65
RANDOM walk for 40000 steps (309 resets) in 1101 ms. (36 steps per ms) remains 1/65 properties
BEST_FIRST walk for 15315 steps (3 resets) in 65 ms. (232 steps per ms) remains 0/1 properties
[2024-05-22 11:55:37] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:55:37] [INFO ] Flatten gal took : 19 ms
[2024-05-22 11:55:37] [INFO ] Input system was already deterministic with 147 transitions.
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 113 vertex of which 106 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 104 transition count 138
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 104 transition count 138
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 98 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 98 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 94 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 94 transition count 128
Applied a total of 38 rules in 10 ms. Remains 94 /113 variables (removed 19) and now considering 128/147 (removed 19) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-22 11:55:37] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 11:55:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:55:37] [INFO ] Invariant cache hit.
[2024-05-22 11:55:37] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-22 11:55:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/113 places, 128/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 93/113 places, 128/147 transitions.
[2024-05-22 11:55:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:55:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:55:37] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-22 11:55:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:55:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:55:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16320215523227424214.gal : 3 ms
[2024-05-22 11:55:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14486324075717482216.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/CTLFireability16320215523227424214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14486324075717482216.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,8.69808e+11,4.94722,136644,2,36317,5,873665,6,0,487,507359,0


Converting to forward existential form...Done !
original formula: E(!(((p23==1) * !(AF((EX((p6==1)) + AX((p53==1))))))) U A((p63==1) U AG(A((((p52==1)&&(p121==1))||((p16==1)&&(p121==1))) U (p24!=1)))))
=> equivalent forward existential formula: [((FwdU(Init,!(((p23==1) * !(!(EG(!((EX((p6==1)) + !(EX(!((p53==1)))))))))))) * !(EG(!(!(E(TRUE U !(!((E(!((p24!...542
Reverse transition relation is NOT exact ! Due to transitions t11, t21, t26, t30, t32, t34, t38, t40, t42, t45, t49, t51, t105, t109, t115, t116, t117, t11...312
Detected timeout of ITS tools.
[2024-05-22 11:56:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:56:07] [INFO ] Applying decomposition
[2024-05-22 11:56:07] [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/graph6783556597669005873.txt' '-o' '/tmp/graph6783556597669005873.bin' '-w' '/tmp/graph6783556597669005873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6783556597669005873.bin' '-l' '-1' '-v' '-w' '/tmp/graph6783556597669005873.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:56:07] [INFO ] Decomposing Gal with order
[2024-05-22 11:56:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:56:07] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-22 11:56:07] [INFO ] Flatten gal took : 79 ms
[2024-05-22 11:56:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 18 ms.
[2024-05-22 11:56:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11470325955624493750.gal : 9 ms
[2024-05-22 11:56:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10571215711372096953.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/CTLFireability11470325955624493750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10571215711372096953.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,8.69808e+11,0.273176,15892,917,145,28494,1376,232,45576,48,10829,0


Converting to forward existential form...Done !
original formula: E(!(((i7.u4.p23==1) * !(AF((EX((u1.p6==1)) + AX((i6.u10.p53==1))))))) U A((i7.u13.p63==1) U AG(A((((i6.u10.p52==1)&&(i14.u25.p121==1))||(...211
=> equivalent forward existential formula: [((FwdU(Init,!(((i7.u4.p23==1) * !(!(EG(!((EX((u1.p6==1)) + !(EX(!((i6.u10.p53==1)))))))))))) * !(EG(!(!(E(TRUE ...706
Reverse transition relation is NOT exact ! Due to transitions t26, t32, t34, t38, t49, t51, t105, t109, u1.t121, u5.t123, i0.t40, i0.t30, i0.u0.t42, i0.u2....412
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 104 transition count 138
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 104 transition count 138
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 97 transition count 131
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 97 transition count 131
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 92 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 92 transition count 126
Applied a total of 42 rules in 10 ms. Remains 92 /113 variables (removed 21) and now considering 126/147 (removed 21) transitions.
// Phase 1: matrix 126 rows 92 cols
[2024-05-22 11:56:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:56:38] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 11:56:38] [INFO ] Invariant cache hit.
[2024-05-22 11:56:38] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 11:56:38] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-22 11:56:38] [INFO ] Invariant cache hit.
[2024-05-22 11:56:38] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/218 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 85/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/218 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 179 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2653 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 126/218 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 85/179 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 125/304 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 304 constraints, problems are : Problem set: 0 solved, 125 unsolved in 1987 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 4656ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 4658ms
Starting structural reductions in LTL mode, iteration 1 : 92/113 places, 126/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4803 ms. Remains : 92/113 places, 126/147 transitions.
[2024-05-22 11:56:42] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:56:42] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:56:42] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-22 11:56:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:56:42] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:56:42] [INFO ] Time to serialize gal into /tmp/CTLFireability15534166567874713887.gal : 1 ms
[2024-05-22 11:56:42] [INFO ] Time to serialize properties into /tmp/CTLFireability1758631287554249136.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/CTLFireability15534166567874713887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1758631287554249136.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.44103e+11,1.42668,54312,2,7235,5,310286,6,0,479,191103,0


Converting to forward existential form...Done !
original formula: EF((AG(AF(((((p106==1)&&(p121==1))&&((p3==1)&&(p122==1)))&&(((p66==1)&&(p25==1))&&(p121==1))))) + AG((((p43==0)||(p122==0)) + AX(((p34==0...173
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((((p106==1)&&(p121==1))&&((p3==1)&&(p122==1)))&&(((p66==1)&&(p25==1))&...292
Reverse transition relation is NOT exact ! Due to transitions t15, t22, t25, t29, t31, t33, t35, t37, t39, t42, t46, t48, t50, t113, t114, t115, t116, t117...305
Detected timeout of ITS tools.
[2024-05-22 11:57:12] [INFO ] Flatten gal took : 14 ms
[2024-05-22 11:57:12] [INFO ] Applying decomposition
[2024-05-22 11:57:12] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8669898986578151050.txt' '-o' '/tmp/graph8669898986578151050.bin' '-w' '/tmp/graph8669898986578151050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8669898986578151050.bin' '-l' '-1' '-v' '-w' '/tmp/graph8669898986578151050.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:57:13] [INFO ] Decomposing Gal with order
[2024-05-22 11:57:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:57:13] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-22 11:57:13] [INFO ] Flatten gal took : 16 ms
[2024-05-22 11:57:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 3 ms.
[2024-05-22 11:57:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7322184100789879904.gal : 2 ms
[2024-05-22 11:57:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10409031849144318356.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/CTLFireability7322184100789879904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10409031849144318356.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,7.44103e+11,0.453545,20036,395,194,24993,8762,229,84498,37,55684,0


Converting to forward existential form...Done !
original formula: EF((AG(AF(((((i11.u32.p106==1)&&(i2.u5.p121==1))&&((i0.u0.p3==1)&&(i0.u4.p122==1)))&&(((i7.u20.p66==1)&&(i3.u7.p25==1))&&(i2.u5.p121==1))...243
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((((i11.u32.p106==1)&&(i2.u5.p121==1))&&((i0.u0.p3==1)&&(i0.u4.p122==1)...362
Reverse transition relation is NOT exact ! Due to transitions t29, t31, t33, t35, t37, t39, t42, t46, t48, t50, i0.t22, i0.u0.t15, i0.u0.t25, i0.u0.t120, i...408
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,10.9372,341708,1,0,375651,118361,1303,2.20572e+06,208,1.12303e+06,159363
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 96 transition count 130
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 90 transition count 124
Applied a total of 46 rules in 14 ms. Remains 90 /113 variables (removed 23) and now considering 124/147 (removed 23) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 11:57:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:57:24] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:57:24] [INFO ] Invariant cache hit.
[2024-05-22 11:57:24] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 11:57:24] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 11:57:24] [INFO ] Invariant cache hit.
[2024-05-22 11:57:24] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 177 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2565 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 123/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 300 constraints, problems are : Problem set: 0 solved, 123 unsolved in 1896 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 4486ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 4488ms
Starting structural reductions in LTL mode, iteration 1 : 90/113 places, 124/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4650 ms. Remains : 90/113 places, 124/147 transitions.
[2024-05-22 11:57:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:57:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:57:28] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 11:57:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:57:28] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:57:28] [INFO ] Time to serialize gal into /tmp/CTLFireability259170427547052648.gal : 2 ms
[2024-05-22 11:57:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3427668838314154390.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/CTLFireability259170427547052648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3427668838314154390.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.20086e+11,1.34865,50380,2,4867,5,308166,6,0,469,170727,0


Converting to forward existential form...Done !
original formula: AG((EX(!(A(EX(((p20==1)&&(p121==1))) U ((p58==1)&&(p122==1))))) + EX(((E(((p37==1)&&(p121==1)) U ((p47==1)&&(p121==1))) + (p44==1)) * EF(...181
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(((E(((p37==1)&&(p121==1)) U ((p47==1)&&(p121==1))) + (p44==1)) * E(TRUE U ((p56==0)||(...315
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t48, t111, t112, t113, t114, t115, t11...299
(forward)formula 0,0,25.4126,741324,1,0,737,4.52104e+06,284,407,2910,5.07635e+06,907
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 96 transition count 130
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 90 transition count 124
Applied a total of 46 rules in 10 ms. Remains 90 /113 variables (removed 23) and now considering 124/147 (removed 23) transitions.
[2024-05-22 11:57:54] [INFO ] Invariant cache hit.
[2024-05-22 11:57:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 11:57:54] [INFO ] Invariant cache hit.
[2024-05-22 11:57:54] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 11:57:54] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 11:57:54] [INFO ] Invariant cache hit.
[2024-05-22 11:57:54] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 177 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 123/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 300 constraints, problems are : Problem set: 0 solved, 123 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 4499ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 4500ms
Starting structural reductions in LTL mode, iteration 1 : 90/113 places, 124/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4637 ms. Remains : 90/113 places, 124/147 transitions.
[2024-05-22 11:57:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:57:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:57:58] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 11:57:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:57:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:57:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17320327817698889337.gal : 2 ms
[2024-05-22 11:57:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2633895499058404553.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/CTLFireability17320327817698889337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2633895499058404553.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,6.20086e+11,1.36806,50264,2,4867,5,308166,6,0,469,170727,0


Converting to forward existential form...Done !
original formula: AX(((AG(EF((((p117==1)&&(p121==1))&&((p60==1)&&(p121==1))))) + ((EG(AF((p98==0))) * (p84==1)) * (p122==1))) * (((p76==1)&&(p121==1)) + (A...186
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !(((EG(!(EG(!((p98==0))))) * (p84==1)) * (p122==1)))),TRUE) * !(E(TRUE U (((p117==1)&&(p121=...343
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t48, t111, t112, t113, t114, t115, t11...299
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,27.0224,769812,1,0,852,4.58634e+06,297,559,3108,5.17067e+06,987
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 96 transition count 130
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 90 transition count 124
Applied a total of 46 rules in 5 ms. Remains 90 /113 variables (removed 23) and now considering 124/147 (removed 23) transitions.
[2024-05-22 11:58:26] [INFO ] Invariant cache hit.
[2024-05-22 11:58:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 11:58:26] [INFO ] Invariant cache hit.
[2024-05-22 11:58:26] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 11:58:26] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 11:58:26] [INFO ] Invariant cache hit.
[2024-05-22 11:58:26] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 177 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2607 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 85/177 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 123/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 300 constraints, problems are : Problem set: 0 solved, 123 unsolved in 1909 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 4530ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 4532ms
Starting structural reductions in LTL mode, iteration 1 : 90/113 places, 124/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4681 ms. Remains : 90/113 places, 124/147 transitions.
[2024-05-22 11:58:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:58:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:58:30] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 11:58:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:58:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:58:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4898857632544562024.gal : 1 ms
[2024-05-22 11:58:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17046494730745853075.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/CTLFireability4898857632544562024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17046494730745853075.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,6.20086e+11,1.36698,51756,2,4867,5,308166,6,0,469,170727,0


Converting to forward existential form...Done !
original formula: AG(AX(((AF(((p75==0)||(p121==0))) * (p34==0)) + (((p16==1)&&(p121==1))&&((p48==1)&&(p122==1))))))
=> equivalent forward existential formula: ([FwdG((EY(FwdU(Init,TRUE)) * !((((p16==1)&&(p121==1))&&((p48==1)&&(p122==1))))),!(((p75==0)||(p121==0))))] = FA...261
(forward)formula 0,0,1.60392,51756,1,0,13,308166,11,4,842,170727,3
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Graph (complete) has 325 edges and 113 vertex of which 106 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 106 transition count 133
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 99 transition count 133
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 25 place count 89 transition count 123
Iterating global reduction 0 with 10 rules applied. Total rules applied 35 place count 89 transition count 123
Applied a total of 35 rules in 19 ms. Remains 89 /113 variables (removed 24) and now considering 123/147 (removed 24) transitions.
// Phase 1: matrix 123 rows 89 cols
[2024-05-22 11:58:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:58:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 11:58:32] [INFO ] Invariant cache hit.
[2024-05-22 11:58:32] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 11:58:32] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-22 11:58:32] [INFO ] Redundant transitions in 5 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-22 11:58:32] [INFO ] Invariant cache hit.
[2024-05-22 11:58:32] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 176 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2590 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 85/176 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 122/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 298 constraints, problems are : Problem set: 0 solved, 122 unsolved in 1974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 4600ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 4603ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/113 places, 123/147 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4763 ms. Remains : 89/113 places, 123/147 transitions.
[2024-05-22 11:58:37] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:58:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:58:37] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-22 11:58:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:58:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:58:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1019469778448383731.gal : 1 ms
[2024-05-22 11:58:37] [INFO ] Time to serialize properties into /tmp/CTLFireability9653140160243801423.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/CTLFireability1019469778448383731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9653140160243801423.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,1.922e+11,1.02891,37548,2,4966,5,217207,6,0,465,111415,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(AF(((p93==0)||(p122==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(!(EG(!(((p93==0)||(p122==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t27, t31, t33, t35, t37, t39, t40, t42, t44, t46, t48, t110, t111, t112, t113, t114, t115...298
(forward)formula 0,1,5.2026,147900,1,0,242,776161,276,149,2961,761671,353
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 139
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 99 transition count 133
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 99 transition count 133
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 95 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 95 transition count 129
Applied a total of 36 rules in 3 ms. Remains 95 /113 variables (removed 18) and now considering 129/147 (removed 18) transitions.
// Phase 1: matrix 129 rows 95 cols
[2024-05-22 11:58:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 11:58:42] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 11:58:42] [INFO ] Invariant cache hit.
[2024-05-22 11:58:42] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-22 11:58:42] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-22 11:58:42] [INFO ] Invariant cache hit.
[2024-05-22 11:58:42] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/224 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 86/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/224 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 183 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2835 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/224 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 86/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 311 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 4887ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 4888ms
Starting structural reductions in LTL mode, iteration 1 : 95/113 places, 129/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5016 ms. Remains : 95/113 places, 129/147 transitions.
[2024-05-22 11:58:47] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:58:47] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:58:47] [INFO ] Input system was already deterministic with 129 transitions.
[2024-05-22 11:58:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:58:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:58:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12584355002538689244.gal : 1 ms
[2024-05-22 11:58:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2680476103806022185.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/CTLFireability12584355002538689244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2680476103806022185.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,9.05549e+11,2.8795,91540,2,11618,5,575844,6,0,493,309151,0


Converting to forward existential form...Done !
original formula: E(((EG(!(((((p86==1)&&(p29==1))&&(p121==1)) + EG(((p14==1)&&(p122==1)))))) + AX((p103==1))) + ((p90==1)&&(p121==1))) U (((p36!=1)&&(!((p7...357
=> equivalent forward existential formula: (([(((FwdU(Init,((EG(!(((((p86==1)&&(p29==1))&&(p121==1)) + EG(((p14==1)&&(p122==1)))))) + !(EX(!((p103==1))))) ...829
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t26, t32, t34, t36, t38, t40, t42, t43, t45, t49, t115, t116, t117, t118, t119, t120,...304
Detected timeout of ITS tools.
[2024-05-22 11:59:17] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:59:17] [INFO ] Applying decomposition
[2024-05-22 11:59:17] [INFO ] Flatten gal took : 3 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/graph11559322726171577613.txt' '-o' '/tmp/graph11559322726171577613.bin' '-w' '/tmp/graph11559322726171577613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11559322726171577613.bin' '-l' '-1' '-v' '-w' '/tmp/graph11559322726171577613.weights' '-q' '0' '-e' '0.001'
[2024-05-22 11:59:17] [INFO ] Decomposing Gal with order
[2024-05-22 11:59:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:59:17] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-22 11:59:17] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:59:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 3 ms.
[2024-05-22 11:59:17] [INFO ] Time to serialize gal into /tmp/CTLFireability17508188216193469031.gal : 2 ms
[2024-05-22 11:59:17] [INFO ] Time to serialize properties into /tmp/CTLFireability657136595598841402.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/CTLFireability17508188216193469031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability657136595598841402.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,9.05549e+11,1.93885,76928,404,128,113427,78503,243,397898,39,347500,0


Converting to forward existential form...Done !
original formula: E(((EG(!(((((i8.u25.p86==1)&&(i2.u7.p29==1))&&(i0.u0.p121==1)) + EG(((i1.u2.p14==1)&&(i12.u37.p122==1)))))) + AX((i12.u30.p103==1))) + ((...522
=> equivalent forward existential formula: (([(((FwdU(Init,((EG(!(((((i8.u25.p86==1)&&(i2.u7.p29==1))&&(i0.u0.p121==1)) + EG(((i1.u2.p14==1)&&(i12.u37.p122...1154
Reverse transition relation is NOT exact ! Due to transitions t32, t34, t36, t38, t40, t42, t43, t45, t49, i0.u0.t121, i1.u3.t120, i2.u6.t123, i3.u9.t119, ...419
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 96 transition count 130
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 90 transition count 124
Applied a total of 46 rules in 10 ms. Remains 90 /113 variables (removed 23) and now considering 124/147 (removed 23) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 11:59:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 11:59:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 11:59:47] [INFO ] Invariant cache hit.
[2024-05-22 11:59:47] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 11:59:47] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/113 places, 124/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 89/113 places, 124/147 transitions.
[2024-05-22 11:59:47] [INFO ] Flatten gal took : 4 ms
[2024-05-22 11:59:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:59:47] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 11:59:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:59:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 11:59:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5643426124407123468.gal : 1 ms
[2024-05-22 11:59:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3892330070157996757.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/CTLFireability5643426124407123468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3892330070157996757.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,6.20086e+11,2.5446,88184,2,18824,5,626894,6,0,467,253456,0


Converting to forward existential form...Done !
original formula: EG((EF(EX((p84==1))) * E((p108==1) U !(((p17==1)&&(p121==1))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U EX((p84==1))) * E((p108==1) U !(((p17==1)&&(p121==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t48, t111, t112, t113, t114, t115, t11...299
Detected timeout of ITS tools.
[2024-05-22 12:00:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:00:17] [INFO ] Applying decomposition
[2024-05-22 12:00:17] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6427402843498740186.txt' '-o' '/tmp/graph6427402843498740186.bin' '-w' '/tmp/graph6427402843498740186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6427402843498740186.bin' '-l' '-1' '-v' '-w' '/tmp/graph6427402843498740186.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:00:18] [INFO ] Decomposing Gal with order
[2024-05-22 12:00:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:00:18] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-22 12:00:18] [INFO ] Flatten gal took : 5 ms
[2024-05-22 12:00:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 2 ms.
[2024-05-22 12:00:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17715321931982419957.gal : 1 ms
[2024-05-22 12:00:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14777036831856484273.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/CTLFireability17715321931982419957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14777036831856484273.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,6.20086e+11,0.179983,12732,391,85,17995,2431,186,48943,45,14064,0


Converting to forward existential form...Done !
original formula: EG((EF(EX((i10.u17.p84==1))) * E((i12.u22.p108==1) U !(((u4.p17==1)&&(i2.u1.p121==1))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U EX((i10.u17.p84==1))) * E((i12.u22.p108==1) U !(((u4.p17==1)&&(i2.u1.p121==1))))))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t27, t31, t33, t35, t39, t42, t44, t46, t48, i0.t40, i0.t29, i0.u0.t118, i0.u5.t119, i0.u19.t...387
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,7.80846,273640,1,0,387733,31241,1091,1.87511e+06,254,341446,204564
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 96 transition count 130
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 96 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 91 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 91 transition count 125
Applied a total of 44 rules in 2 ms. Remains 91 /113 variables (removed 22) and now considering 125/147 (removed 22) transitions.
// Phase 1: matrix 125 rows 91 cols
[2024-05-22 12:00:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:00:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 12:00:25] [INFO ] Invariant cache hit.
[2024-05-22 12:00:25] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:00:26] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 152 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/113 places, 125/147 transitions.
Applied a total of 0 rules in 0 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 90/113 places, 125/147 transitions.
[2024-05-22 12:00:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:00:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:00:26] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-22 12:00:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:00:26] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:00:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1818667011769506107.gal : 0 ms
[2024-05-22 12:00:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6863927290158023212.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/CTLFireability1818667011769506107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6863927290158023212.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,6.80434e+11,2.49563,84832,2,18546,5,604642,6,0,472,248796,0


Converting to forward existential form...Done !
original formula: EG(AG(((p23==0) * AX(((p15==0)||(p121==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((p23==0) * !(EX(!(((p15==0)||(p121==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t24, t28, t30, t32, t34, t36, t38, t40, t43, t45, t47, t49, t112, t113, t114, t115, t116...304
(forward)formula 0,0,22.3786,596628,1,0,189,3.72517e+06,279,123,2896,2.91132e+06,269
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 107 transition count 141
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 107 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 104 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 104 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 102 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 102 transition count 136
Applied a total of 22 rules in 5 ms. Remains 102 /113 variables (removed 11) and now considering 136/147 (removed 11) transitions.
// Phase 1: matrix 136 rows 102 cols
[2024-05-22 12:00:48] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:00:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 12:00:48] [INFO ] Invariant cache hit.
[2024-05-22 12:00:48] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-22 12:00:48] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-22 12:00:48] [INFO ] Invariant cache hit.
[2024-05-22 12:00:48] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/238 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 89/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 193 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/238 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 89/193 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 135/328 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 328 constraints, problems are : Problem set: 0 solved, 135 unsolved in 2241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 5367ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 5369ms
Starting structural reductions in LTL mode, iteration 1 : 102/113 places, 136/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5504 ms. Remains : 102/113 places, 136/147 transitions.
[2024-05-22 12:00:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:00:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:00:54] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 12:00:54] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:00:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:00:54] [INFO ] Time to serialize gal into /tmp/CTLFireability18369092087874229493.gal : 4 ms
[2024-05-22 12:00:54] [INFO ] Time to serialize properties into /tmp/CTLFireability9044127939267263390.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/CTLFireability18369092087874229493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9044127939267263390.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,1.3318e+12,1.95885,64612,2,5121,5,379475,6,0,525,216548,0


Converting to forward existential form...Done !
original formula: EF((((p47==1)&&(p121==1)) * (EX((p1==1)) * (AF(EX((p21==1))) + (AG(((p57==1)&&(p121==1))) * (((p44==0)||(p122==0)) + ((p61==1) * EF((p111...167
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((p47==1)&&(p121==1))) * EX((p1==1))) * !(EG(!(EX((p21==1))))))] != FALSE + ([((((FwdU(In...432
Reverse transition relation is NOT exact ! Due to transitions t33, t35, t37, t39, t41, t46, t50, t52, t119, t120, t121, t122, t123, t124, t125, t126, t127,...304
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,26.5427,752500,1,0,705,4.37596e+06,298,483,3215,5.54517e+06,776
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 139
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 99 transition count 133
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 99 transition count 133
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 94 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 94 transition count 128
Applied a total of 38 rules in 10 ms. Remains 94 /113 variables (removed 19) and now considering 128/147 (removed 19) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-22 12:01:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:01:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 12:01:20] [INFO ] Invariant cache hit.
[2024-05-22 12:01:20] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-22 12:01:20] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-05-22 12:01:20] [INFO ] Invariant cache hit.
[2024-05-22 12:01:20] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 86/182 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 0/222 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 182 constraints, problems are : Problem set: 0 solved, 127 unsolved in 2787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 86/182 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 127/309 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 309 constraints, problems are : Problem set: 0 solved, 127 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 94/94 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 4844ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 4846ms
Starting structural reductions in LTL mode, iteration 1 : 94/113 places, 128/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4995 ms. Remains : 94/113 places, 128/147 transitions.
[2024-05-22 12:01:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:01:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 12:01:25] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-22 12:01:25] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:01:25] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:01:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6772094308101451419.gal : 1 ms
[2024-05-22 12:01:25] [INFO ] Time to serialize properties into /tmp/CTLFireability16126982156407635204.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/CTLFireability6772094308101451419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16126982156407635204.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,8.69808e+11,3.47613,105832,2,16766,5,610202,6,0,489,407747,0


Converting to forward existential form...Done !
original formula: EF(!(A(((E((((p112==1)&&(p121==1))&&((p57==1)&&(p121==1))) U ((p43==1)&&(p122==1))) * (p26==1)) * (p121==1)) U AX(((((p120==1)&&(p121==1)...211
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,TRUE),!(!(EX(!(((((p120==1)&&(p121==1))||((p73==1)&&(p122==1)))||(!((p75==1)&&(p121==1))))...486
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t26, t32, t36, t38, t40, t42, t43, t47, t49, t51, t102, t109, t115, t116, t117, t11...312
(forward)formula 0,1,17.026,426772,1,0,235,2.02275e+06,284,148,2962,3.05851e+06,322
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-10 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 : 113/113 places, 147/147 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 104 transition count 138
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 104 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 99 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 99 transition count 133
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 95 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 95 transition count 129
Applied a total of 36 rules in 5 ms. Remains 95 /113 variables (removed 18) and now considering 129/147 (removed 18) transitions.
// Phase 1: matrix 129 rows 95 cols
[2024-05-22 12:01:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 12:01:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 12:01:43] [INFO ] Invariant cache hit.
[2024-05-22 12:01:43] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-22 12:01:43] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-22 12:01:43] [INFO ] Invariant cache hit.
[2024-05-22 12:01:43] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/224 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 87/184 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/224 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 184 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2678 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/224 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 87/184 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 128/312 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 312 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 4775ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 4776ms
Starting structural reductions in LTL mode, iteration 1 : 95/113 places, 129/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4925 ms. Remains : 95/113 places, 129/147 transitions.
[2024-05-22 12:01:47] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:01:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:01:47] [INFO ] Input system was already deterministic with 129 transitions.
[2024-05-22 12:01:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:01:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:01:47] [INFO ] Time to serialize gal into /tmp/CTLFireability6452097082006027649.gal : 1 ms
[2024-05-22 12:01:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9558438217673373084.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/CTLFireability6452097082006027649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9558438217673373084.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,8.87498e+11,1.40265,50128,2,3940,5,305462,6,0,493,170884,0


Converting to forward existential form...Done !
original formula: EF(((EG((EX((p8==0)) * EF((p68==1)))) * !(E((((((p8==1)&&(p122==1))&&((p37==1)&&(p121==1)))||((p2==1)&&(p121==1)))||(p78==1)) U !(((p7==1...226
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (EG((EX((p8==0)) * E(TRUE U (p68==1)))) * !(E((((((p8==1)&&(p122==1))&&((p37==1)&&(p12...356
Reverse transition relation is NOT exact ! Due to transitions t29, t33, t35, t37, t39, t42, t44, t46, t48, t50, t107, t109, t115, t116, t117, t118, t119, t...308
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,27.2779,781696,1,0,781,4.41241e+06,309,430,3140,5.52642e+06,951
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 139
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 99 transition count 133
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 99 transition count 133
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 95 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 95 transition count 129
Applied a total of 36 rules in 6 ms. Remains 95 /113 variables (removed 18) and now considering 129/147 (removed 18) transitions.
// Phase 1: matrix 129 rows 95 cols
[2024-05-22 12:02:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:02:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 12:02:15] [INFO ] Invariant cache hit.
[2024-05-22 12:02:15] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-22 12:02:15] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-22 12:02:15] [INFO ] Invariant cache hit.
[2024-05-22 12:02:15] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/224 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 86/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/224 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 183 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2782 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/224 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 86/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 311 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 4879ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 4881ms
Starting structural reductions in LTL mode, iteration 1 : 95/113 places, 129/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5011 ms. Remains : 95/113 places, 129/147 transitions.
[2024-05-22 12:02:20] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:02:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:02:20] [INFO ] Input system was already deterministic with 129 transitions.
[2024-05-22 12:02:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:02:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:02:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12711668426161716661.gal : 1 ms
[2024-05-22 12:02:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6005443311198312383.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/CTLFireability12711668426161716661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6005443311198312383.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,9.05549e+11,1.4453,54856,2,7096,5,350977,6,0,493,182256,0


Converting to forward existential form...Done !
original formula: EG(AF(((A(AG((p76==1)) U ((p58==1)&&(p3==1))) * (((p11==1) + EX(((p66==1)&&(p121==1)))) + EX(((p15==1)&&(p121==1))))) * ((p73==1) + AG(((...204
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!((E(!(((p58==1)&&(p3==1))) U (!(!(E(TRUE U !((p76==1))))) * !(((p58==1)&&(p3==1))))) + EG(!...344
Reverse transition relation is NOT exact ! Due to transitions t9, t20, t26, t30, t32, t36, t38, t43, t45, t47, t49, t51, t115, t116, t117, t118, t119, t120...305
Detected timeout of ITS tools.
[2024-05-22 12:02:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 12:02:50] [INFO ] Applying decomposition
[2024-05-22 12:02:50] [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/graph8688079166099995310.txt' '-o' '/tmp/graph8688079166099995310.bin' '-w' '/tmp/graph8688079166099995310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8688079166099995310.bin' '-l' '-1' '-v' '-w' '/tmp/graph8688079166099995310.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:02:50] [INFO ] Decomposing Gal with order
[2024-05-22 12:02:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:02:50] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-22 12:02:50] [INFO ] Flatten gal took : 11 ms
[2024-05-22 12:02:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 3 ms.
[2024-05-22 12:02:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17275107650578452328.gal : 10 ms
[2024-05-22 12:02:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4139016203482479095.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/CTLFireability17275107650578452328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4139016203482479095.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,9.05549e+11,0.413577,21116,385,186,26020,16717,234,85338,39,89054,0


Converting to forward existential form...Done !
original formula: EG(AF(((A(AG((i8.u24.p76==1)) U ((i6.u19.p58==1)&&(i2.u0.p3==1))) * (((i1.u3.p11==1) + EX(((i7.u21.p66==1)&&(i0.u1.p121==1)))) + EX(((i1....287
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!((E(!(((i6.u19.p58==1)&&(i2.u0.p3==1))) U (!(!(E(TRUE U !((i8.u24.p76==1))))) * !(((i6.u19....453
Reverse transition relation is NOT exact ! Due to transitions t30, t32, t36, t38, t43, t45, t47, t49, t51, i0.u1.t122, i1.u3.t121, i1.u5.t120, i2.t20, i2.u...414
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 96 transition count 130
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 90 transition count 124
Applied a total of 46 rules in 8 ms. Remains 90 /113 variables (removed 23) and now considering 124/147 (removed 23) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 12:03:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 12:03:20] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 12:03:20] [INFO ] Invariant cache hit.
[2024-05-22 12:03:20] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:03:20] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/113 places, 124/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 89/113 places, 124/147 transitions.
[2024-05-22 12:03:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:03:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:03:20] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 12:03:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:03:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:03:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6050386347723987070.gal : 1 ms
[2024-05-22 12:03:20] [INFO ] Time to serialize properties into /tmp/CTLFireability723616573868208912.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/CTLFireability6050386347723987070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability723616573868208912.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.20086e+11,2.52069,88564,2,18824,5,626894,6,0,467,253456,0


Converting to forward existential form...Done !
original formula: AX(EF((p38==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p38==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t29, t31, t33, t35, t37, t39, t40, t42, t44, t46, t48, t111, t112, t113, t114, t115, t11...299
(forward)formula 0,1,16.2827,434720,1,0,175,2.39869e+06,269,117,2810,2.08934e+06,259
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 96 transition count 130
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 90 transition count 124
Applied a total of 46 rules in 5 ms. Remains 90 /113 variables (removed 23) and now considering 124/147 (removed 23) transitions.
[2024-05-22 12:03:37] [INFO ] Invariant cache hit.
[2024-05-22 12:03:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 12:03:37] [INFO ] Invariant cache hit.
[2024-05-22 12:03:37] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:03:37] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/113 places, 124/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 89/113 places, 124/147 transitions.
[2024-05-22 12:03:37] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:03:37] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:03:37] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 12:03:37] [INFO ] Flatten gal took : 4 ms
[2024-05-22 12:03:37] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:03:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16960184639781833729.gal : 1 ms
[2024-05-22 12:03:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16145245893900614005.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/CTLFireability16960184639781833729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16145245893900614005.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,6.20086e+11,2.49434,88496,2,18824,5,626894,6,0,467,253456,0


Converting to forward existential form...Done !
original formula: (EX(((p75==1)&&(p121==1))) * AX(AG((p4==1))))
=> equivalent forward existential formula: ([(Init * !(EX(((p75==1)&&(p121==1)))))] = FALSE * [(FwdU(EY(Init),TRUE) * !((p4==1)))] = FALSE)
(forward)formula 0,0,4.0138,91928,1,0,11,639804,10,2,954,287808,4
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 103 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 103 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 96 transition count 130
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 96 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 90 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 90 transition count 124
Applied a total of 46 rules in 5 ms. Remains 90 /113 variables (removed 23) and now considering 124/147 (removed 23) transitions.
[2024-05-22 12:03:41] [INFO ] Invariant cache hit.
[2024-05-22 12:03:41] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 12:03:41] [INFO ] Invariant cache hit.
[2024-05-22 12:03:41] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 12:03:41] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/113 places, 124/147 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 89/113 places, 124/147 transitions.
[2024-05-22 12:03:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:03:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:03:41] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 12:03:41] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:03:41] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:03:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2387450654921656812.gal : 1 ms
[2024-05-22 12:03:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4707480510350872091.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/CTLFireability2387450654921656812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4707480510350872091.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,6.20086e+11,2.50151,87920,2,18824,5,626894,6,0,467,253456,0


Converting to forward existential form...Done !
original formula: EX(((p19==1)&&(p121==1)))
=> equivalent forward existential formula: [(EY(Init) * ((p19==1)&&(p121==1)))] != FALSE
(forward)formula 0,0,2.51342,87920,1,0,8,626894,8,1,626,253456,2
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 12:03:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 12:03:44] [INFO ] Flatten gal took : 2 ms
[2024-05-22 12:03:44] [INFO ] Applying decomposition
[2024-05-22 12:03:44] [INFO ] Flatten gal took : 3 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/graph5769686838349606324.txt' '-o' '/tmp/graph5769686838349606324.bin' '-w' '/tmp/graph5769686838349606324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5769686838349606324.bin' '-l' '-1' '-v' '-w' '/tmp/graph5769686838349606324.weights' '-q' '0' '-e' '0.001'
[2024-05-22 12:03:44] [INFO ] Decomposing Gal with order
[2024-05-22 12:03:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 12:03:44] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-22 12:03:44] [INFO ] Flatten gal took : 7 ms
[2024-05-22 12:03:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 4 ms.
[2024-05-22 12:03:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8601572403674137897.gal : 7 ms
[2024-05-22 12:03:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10673236663373963175.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/CTLFireability8601572403674137897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10673236663373963175.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 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,2.44513e+12,0.390984,21568,622,396,33105,7321,295,79128,47,43140,0


Converting to forward existential form...Done !
original formula: E(!(((i2.i0.u8.p23==1) * !(AF((EX((i0.u2.p6==1)) + AX((i5.i0.u19.p53==1))))))) U A((i6.u23.p63==1) U AG(A((((i5.i0.u19.p52==1)&&(i8.u44.p...224
=> equivalent forward existential formula: [((FwdU(Init,!(((i2.i0.u8.p23==1) * !(!(EG(!((EX((i0.u2.p6==1)) + !(EX(!((i5.i0.u19.p53==1)))))))))))) * !(EG(!(...745
Reverse transition relation is NOT exact ! Due to transitions t45, t56, t114, t116, i0.u0.t139, i0.u2.t138, i1.u4.t137, i1.u6.t136, i2.i0.u8.t140, i2.i1.u1...490
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,12.3122,283456,1,0,439046,34644,1691,1.40796e+06,229,412755,228885
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((EG(!(((((i8.u31.p86==1)&&(i2.i1.u11.p29==1))&&(i8.u44.p121==1)) + EG(((i1.u5.p14==1)&&(i7.u12.p122==1)))))) + AX((i7.u12.p103==1))) +...536
=> equivalent forward existential formula: (([(((FwdU(Init,((EG(!(((((i8.u31.p86==1)&&(i2.i1.u11.p29==1))&&(i8.u44.p121==1)) + EG(((i1.u5.p14==1)&&(i7.u12....1180
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 1,1,40.3252,742072,1,0,1.18712e+06,49917,1752,3.28786e+06,232,626037,550537
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(AF(((A(AG((i7.u28.p76==1)) U ((i5.i1.u22.p58==1)&&(i0.u0.p3==1))) * (((i1.u4.p11==1) + EX(((i6.u25.p66==1)&&(i8.u44.p121==1)))) + EX((...295
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((!((E(!(((i5.i1.u22.p58==1)&&(i0.u0.p3==1))) U (!(!(E(TRUE U !((i7.u28.p76==1))))) * !(((i5.i...467
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 2,0,57.3047,998052,1,0,1.48565e+06,71344,1842,4.61897e+06,233,897816,698294
FORMULA DiscoveryGPU-PT-12a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 552266 ms.

BK_STOP 1716379481622

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DiscoveryGPU-PT-12a"
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 DiscoveryGPU-PT-12a, 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 r136-tall-171631132700458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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