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.r400-tall-171690532200394.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 StigmergyElection-PT-11a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 21:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 21:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 11 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 153M May 18 16:43 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 StigmergyElection-PT-11a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-11a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717018633903

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 21:37:15] [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-29 21:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:37:20] [INFO ] Load time of PNML (sax parser for PT used): 5237 ms
[2024-05-29 21:37:20] [INFO ] Transformed 156 places.
[2024-05-29 21:37:21] [INFO ] Transformed 136650 transitions.
[2024-05-29 21:37:21] [INFO ] Found NUPN structural information;
[2024-05-29 21:37:21] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 6124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 55 ms.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
Support contains 11 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 135 transition count 4273
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 135 transition count 4273
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 124 transition count 4251
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 124 transition count 4251
Applied a total of 64 rules in 177 ms. Remains 124 /156 variables (removed 32) and now considering 4251/4305 (removed 54) transitions.
[2024-05-29 21:37:22] [INFO ] Flow matrix only has 4239 transitions (discarded 12 similar events)
// Phase 1: matrix 4239 rows 124 cols
[2024-05-29 21:37:22] [INFO ] Computed 2 invariants in 73 ms
[2024-05-29 21:37:22] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-29 21:37:22] [INFO ] Flow matrix only has 4239 transitions (discarded 12 similar events)
[2024-05-29 21:37:22] [INFO ] Invariant cache hit.
[2024-05-29 21:37:24] [INFO ] State equation strengthened by 4148 read => feed constraints.
[2024-05-29 21:37:25] [INFO ] Implicit Places using invariants and state equation in 2651 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3046 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/156 places, 4251/4305 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 101 transition count 4229
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 101 transition count 4229
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 90 transition count 4218
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 90 transition count 4218
Applied a total of 66 rules in 66 ms. Remains 90 /123 variables (removed 33) and now considering 4218/4251 (removed 33) transitions.
[2024-05-29 21:37:25] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 21:37:25] [INFO ] Computed 1 invariants in 23 ms
[2024-05-29 21:37:25] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 21:37:25] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:37:25] [INFO ] Invariant cache hit.
[2024-05-29 21:37:26] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:37:27] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 90/156 places, 4218/4305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4858 ms. Remains : 90/156 places, 4218/4305 transitions.
Support contains 11 out of 90 places after structural reductions.
[2024-05-29 21:37:28] [INFO ] Flatten gal took : 565 ms
[2024-05-29 21:37:28] [INFO ] Flatten gal took : 334 ms
[2024-05-29 21:37:29] [INFO ] Input system was already deterministic with 4218 transitions.
Reduction of identical properties reduced properties to check from 17 to 5
RANDOM walk for 40000 steps (10 resets) in 14975 ms. (2 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
[2024-05-29 21:37:34] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:37:34] [INFO ] Invariant cache hit.
[2024-05-29 21:37:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/90 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4205/4295 variables, 90/91 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4295 variables, 4103/4194 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4295 variables, 0/4194 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/4296 variables, 1/4195 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4296 variables, 0/4195 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4296 variables, 0/4195 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4296/4296 variables, and 4195 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 90/4296 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/90 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2728ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-29 21:37:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 21:37:37] [INFO ] Flatten gal took : 262 ms
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 21:37:37] [INFO ] Flatten gal took : 325 ms
[2024-05-29 21:37:38] [INFO ] Input system was already deterministic with 4218 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 15 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 21:37:38] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:37:38] [INFO ] Invariant cache hit.
[2024-05-29 21:37:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 21:37:38] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:37:38] [INFO ] Invariant cache hit.
[2024-05-29 21:37:39] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:37:39] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 21:37:39] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:37:39] [INFO ] Invariant cache hit.
[2024-05-29 21:37:40] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 21:39:14] [INFO ] Deduced a trap composed of 9 places in 1338 ms of which 9 ms to minimize.
[2024-05-29 21:39:15] [INFO ] Deduced a trap composed of 9 places in 1434 ms of which 2 ms to minimize.
[2024-05-29 21:39:17] [INFO ] Deduced a trap composed of 9 places in 1343 ms of which 1 ms to minimize.
SMT process timed out in 97287ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 97355ms
Finished structural reductions in LTL mode , in 1 iterations and 99003 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 21:39:17] [INFO ] Flatten gal took : 251 ms
[2024-05-29 21:39:17] [INFO ] Flatten gal took : 269 ms
[2024-05-29 21:39:18] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 21:39:18] [INFO ] Flatten gal took : 266 ms
[2024-05-29 21:39:18] [INFO ] Flatten gal took : 265 ms
[2024-05-29 21:39:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16329808782499907545.gal : 118 ms
[2024-05-29 21:39:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15246898760484966283.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16329808782499907545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15246898760484966283.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 21:39:49] [INFO ] Flatten gal took : 264 ms
[2024-05-29 21:39:49] [INFO ] Applying decomposition
[2024-05-29 21:39:49] [INFO ] Flatten gal took : 267 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/graph16885298126259457777.txt' '-o' '/tmp/graph16885298126259457777.bin' '-w' '/tmp/graph16885298126259457777.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16885298126259457777.bin' '-l' '-1' '-v' '-w' '/tmp/graph16885298126259457777.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:39:50] [INFO ] Decomposing Gal with order
[2024-05-29 21:39:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:39:52] [INFO ] Removed a total of 45126 redundant transitions.
[2024-05-29 21:39:52] [INFO ] Flatten gal took : 1056 ms
[2024-05-29 21:39:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 368 ms.
[2024-05-29 21:39:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9939005681515090929.gal : 41 ms
[2024-05-29 21:39:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16421115650241727482.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/CTLFireability9939005681515090929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16421115650241727482.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 17 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 21:40:22] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:40:22] [INFO ] Invariant cache hit.
[2024-05-29 21:40:22] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 21:40:22] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:40:22] [INFO ] Invariant cache hit.
[2024-05-29 21:40:23] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:40:24] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 21:40:24] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:40:24] [INFO ] Invariant cache hit.
[2024-05-29 21:40:24] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 21:42:12] [INFO ] Deduced a trap composed of 9 places in 1464 ms of which 2 ms to minimize.
[2024-05-29 21:42:14] [INFO ] Deduced a trap composed of 9 places in 1485 ms of which 2 ms to minimize.
SMT process timed out in 110122ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 110167ms
Finished structural reductions in LTL mode , in 1 iterations and 111582 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 21:42:14] [INFO ] Flatten gal took : 283 ms
[2024-05-29 21:42:15] [INFO ] Flatten gal took : 293 ms
[2024-05-29 21:42:15] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 21:42:15] [INFO ] Flatten gal took : 262 ms
[2024-05-29 21:42:16] [INFO ] Flatten gal took : 266 ms
[2024-05-29 21:42:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9832766092466591496.gal : 62 ms
[2024-05-29 21:42:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14406163228579103251.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/CTLFireability9832766092466591496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14406163228579103251.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 21:42:46] [INFO ] Flatten gal took : 261 ms
[2024-05-29 21:42:46] [INFO ] Applying decomposition
[2024-05-29 21:42:46] [INFO ] Flatten gal took : 264 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/graph4581945611405536165.txt' '-o' '/tmp/graph4581945611405536165.bin' '-w' '/tmp/graph4581945611405536165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4581945611405536165.bin' '-l' '-1' '-v' '-w' '/tmp/graph4581945611405536165.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:42:47] [INFO ] Decomposing Gal with order
[2024-05-29 21:42:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:42:48] [INFO ] Removed a total of 45123 redundant transitions.
[2024-05-29 21:42:48] [INFO ] Flatten gal took : 711 ms
[2024-05-29 21:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 229 ms.
[2024-05-29 21:42:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13408299775155798120.gal : 30 ms
[2024-05-29 21:42:49] [INFO ] Time to serialize properties into /tmp/CTLFireability12180708395126930989.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/CTLFireability13408299775155798120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12180708395126930989.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 29 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 21:43:19] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:43:19] [INFO ] Invariant cache hit.
[2024-05-29 21:43:19] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 21:43:19] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:43:19] [INFO ] Invariant cache hit.
[2024-05-29 21:43:20] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:43:20] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 21:43:20] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:43:20] [INFO ] Invariant cache hit.
[2024-05-29 21:43:20] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 21:45:03] [INFO ] Deduced a trap composed of 9 places in 1471 ms of which 2 ms to minimize.
[2024-05-29 21:45:04] [INFO ] Deduced a trap composed of 9 places in 1406 ms of which 1 ms to minimize.
SMT process timed out in 103916ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 103964ms
Finished structural reductions in LTL mode , in 1 iterations and 105437 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 21:45:04] [INFO ] Flatten gal took : 253 ms
[2024-05-29 21:45:05] [INFO ] Flatten gal took : 269 ms
[2024-05-29 21:45:05] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 21:45:06] [INFO ] Flatten gal took : 280 ms
[2024-05-29 21:45:06] [INFO ] Flatten gal took : 294 ms
[2024-05-29 21:45:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15877310229114047236.gal : 56 ms
[2024-05-29 21:45:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7018329044478336315.ctl : 91 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/CTLFireability15877310229114047236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7018329044478336315.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 21:45:36] [INFO ] Flatten gal took : 300 ms
[2024-05-29 21:45:36] [INFO ] Applying decomposition
[2024-05-29 21:45:37] [INFO ] Flatten gal took : 267 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/graph17377047200679997317.txt' '-o' '/tmp/graph17377047200679997317.bin' '-w' '/tmp/graph17377047200679997317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17377047200679997317.bin' '-l' '-1' '-v' '-w' '/tmp/graph17377047200679997317.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:45:38] [INFO ] Decomposing Gal with order
[2024-05-29 21:45:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:45:39] [INFO ] Removed a total of 45125 redundant transitions.
[2024-05-29 21:45:39] [INFO ] Flatten gal took : 806 ms
[2024-05-29 21:45:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 220 ms.
[2024-05-29 21:45:39] [INFO ] Time to serialize gal into /tmp/CTLFireability15382727155026381266.gal : 25 ms
[2024-05-29 21:45:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8626836802869865343.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/CTLFireability15382727155026381266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8626836802869865343.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.2565,31200,7679,26,33806,237,4460,29244,47,770,0


Converting to forward existential form...Done !
original formula: (!(E(!(A(AX((((((i1.u4.p12==1)&&(i3.u6.p26==1))&&((i4.i0.u1.p40==1)&&(i2.i1.u12.p54==1)))&&(((i2.i1.u16.p68==1)&&(i2.i0.u14.p82==1))&&((i...953
=> equivalent forward existential formula: ([(FwdU(Init,!(!((E(!(!(EX(!((((((i1.u4.p12==1)&&(i3.u6.p26==1))&&((i4.i0.u1.p40==1)&&(i2.i1.u12.p54==1)))&&(((i...1532
Reverse transition relation is NOT exact ! Due to transitions t48, t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, i0.t46, i0....560
Using saturation style SCC detection
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
Using saturation style SCC detection
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
(forward)formula 0,1,13.4634,491604,1,0,1.31322e+06,270,53304,1.57232e+06,201,900,2290242
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 19 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 21:45:53] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:45:53] [INFO ] Invariant cache hit.
[2024-05-29 21:45:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 21:45:53] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:45:53] [INFO ] Invariant cache hit.
[2024-05-29 21:45:54] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:45:54] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 21:45:54] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:45:54] [INFO ] Invariant cache hit.
[2024-05-29 21:45:54] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 21:47:34] [INFO ] Deduced a trap composed of 9 places in 1321 ms of which 1 ms to minimize.
[2024-05-29 21:47:36] [INFO ] Deduced a trap composed of 9 places in 1341 ms of which 1 ms to minimize.
SMT process timed out in 101814ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 101867ms
Finished structural reductions in LTL mode , in 1 iterations and 103309 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 21:47:36] [INFO ] Flatten gal took : 258 ms
[2024-05-29 21:47:36] [INFO ] Flatten gal took : 264 ms
[2024-05-29 21:47:37] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 21:47:37] [INFO ] Flatten gal took : 281 ms
[2024-05-29 21:47:38] [INFO ] Flatten gal took : 275 ms
[2024-05-29 21:47:38] [INFO ] Time to serialize gal into /tmp/CTLFireability11702697898173737649.gal : 54 ms
[2024-05-29 21:47:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14873936519258808257.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/CTLFireability11702697898173737649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14873936519258808257.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 21:48:08] [INFO ] Flatten gal took : 260 ms
[2024-05-29 21:48:08] [INFO ] Applying decomposition
[2024-05-29 21:48:08] [INFO ] Flatten gal took : 263 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/graph11583144651311597032.txt' '-o' '/tmp/graph11583144651311597032.bin' '-w' '/tmp/graph11583144651311597032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11583144651311597032.bin' '-l' '-1' '-v' '-w' '/tmp/graph11583144651311597032.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:48:09] [INFO ] Decomposing Gal with order
[2024-05-29 21:48:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:48:10] [INFO ] Removed a total of 45130 redundant transitions.
[2024-05-29 21:48:10] [INFO ] Flatten gal took : 784 ms
[2024-05-29 21:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 266 ms.
[2024-05-29 21:48:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6300935190778181351.gal : 22 ms
[2024-05-29 21:48:11] [INFO ] Time to serialize properties into /tmp/CTLFireability796275967293490004.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/CTLFireability6300935190778181351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability796275967293490004.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.12867,28368,6737,26,35932,246,4260,40639,47,662,0


Converting to forward existential form...Done !
original formula: (AX((!(E(EG((((((i1.i2.u7.p12==1)&&(i3.i1.u31.p26==1))&&((i1.i2.u11.p40==1)&&(i3.i1.u9.p54==1)))&&(((i1.i0.u13.p68==1)&&(i2.i0.u16.p82==1...4236
=> equivalent forward existential formula: ([(EY((Init * !(!(EX(!((!(E(EG((((((i1.i2.u7.p12==1)&&(i3.i1.u31.p26==1))&&((i1.i2.u11.p40==1)&&(i3.i1.u9.p54==1...6362
Reverse transition relation is NOT exact ! Due to transitions t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, i0.t46, i0.t41, ...571
Using saturation style SCC detection
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
(forward)formula 0,1,9.86704,404300,1,0,1.11131e+06,268,46182,1.52365e+06,182,928,1313030
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 66 place count 56 transition count 4184
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2113 place count 56 transition count 2137
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2124 place count 56 transition count 2126
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2146 place count 45 transition count 2115
Applied a total of 2146 rules in 2338 ms. Remains 45 /90 variables (removed 45) and now considering 2115/4218 (removed 2103) transitions.
[2024-05-29 21:48:23] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-05-29 21:48:23] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 21:48:23] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 21:48:23] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 21:48:23] [INFO ] Invariant cache hit.
[2024-05-29 21:48:23] [INFO ] State equation strengthened by 2058 read => feed constraints.
[2024-05-29 21:48:23] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2024-05-29 21:48:24] [INFO ] Redundant transitions in 330 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-29 21:48:24] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 21:48:24] [INFO ] Invariant cache hit.
[2024-05-29 21:48:24] [INFO ] State equation strengthened by 2058 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 21:49:03] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-29 21:49:03] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 21:49:03] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 21:49:03] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 21:49:03] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:49:03] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:49:03] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-29 21:49:03] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:49:04] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 21:49:04] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:49:04] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:49:04] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 0 ms to minimize.
[2024-05-29 21:49:05] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 0 ms to minimize.
[2024-05-29 21:49:05] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 1 ms to minimize.
[2024-05-29 21:49:06] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 0 ms to minimize.
[2024-05-29 21:49:06] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2024-05-29 21:49:06] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 0 ms to minimize.
[2024-05-29 21:49:07] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 1 ms to minimize.
[2024-05-29 21:49:07] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 0 ms to minimize.
[2024-05-29 21:49:08] [INFO ] Deduced a trap composed of 4 places in 418 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 21:49:08] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:49:08] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 21:49:08] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:49:09] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 21:49:10] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:49:10] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 21:49:10] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:49:10] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 21:49:10] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 21:49:10] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-29 21:49:11] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 21:49:15] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-29 21:49:15] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2024-05-29 21:49:15] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2024-05-29 21:49:15] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-29 21:49:15] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:49:16] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 21:49:16] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2024-05-29 21:49:16] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 0 ms to minimize.
[2024-05-29 21:49:17] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2024-05-29 21:49:17] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-29 21:49:17] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-29 21:49:17] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-29 21:49:18] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2024-05-29 21:49:18] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2024-05-29 21:49:18] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2024-05-29 21:49:18] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-29 21:49:19] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 21:49:19] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:49:19] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-29 21:49:19] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 21:49:20] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-29 21:49:20] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-29 21:49:20] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-29 21:49:21] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 21:49:21] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-29 21:49:21] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 21:49:21] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 21:49:21] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:49:22] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-29 21:49:22] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 21:49:22] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:49:22] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-29 21:49:22] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:49:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 21:49:22] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-29 21:49:23] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 21:49:23] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 21:49:23] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:49:23] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 0 ms to minimize.
[2024-05-29 21:49:24] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 21:49:24] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 21:49:24] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-29 21:49:25] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 21:49:25] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 21:49:25] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 21:49:25] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 21:49:25] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:49:25] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 21:49:25] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
SMT process timed out in 61560ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61580ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/90 places, 2115/4218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64949 ms. Remains : 45/90 places, 2115/4218 transitions.
[2024-05-29 21:49:26] [INFO ] Flatten gal took : 149 ms
[2024-05-29 21:49:26] [INFO ] Flatten gal took : 136 ms
[2024-05-29 21:49:26] [INFO ] Input system was already deterministic with 2115 transitions.
RANDOM walk for 44 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 21:49:26] [INFO ] Flatten gal took : 130 ms
[2024-05-29 21:49:26] [INFO ] Flatten gal took : 131 ms
[2024-05-29 21:49:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13683848518840627022.gal : 27 ms
[2024-05-29 21:49:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality32504860980626883.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13683848518840627022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality32504860980626883.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 13 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 21:49:26] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 21:49:26] [INFO ] Computed 1 invariants in 20 ms
[2024-05-29 21:49:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 21:49:26] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:49:26] [INFO ] Invariant cache hit.
[2024-05-29 21:49:27] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:49:28] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 21:49:28] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:49:28] [INFO ] Invariant cache hit.
[2024-05-29 21:49:28] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 21:51:01] [INFO ] Deduced a trap composed of 9 places in 1308 ms of which 1 ms to minimize.
[2024-05-29 21:51:02] [INFO ] Deduced a trap composed of 9 places in 1416 ms of which 1 ms to minimize.
SMT process timed out in 94333ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 94376ms
Finished structural reductions in LTL mode , in 1 iterations and 95837 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 21:51:03] [INFO ] Flatten gal took : 271 ms
[2024-05-29 21:51:03] [INFO ] Flatten gal took : 290 ms
[2024-05-29 21:51:04] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 21:51:04] [INFO ] Flatten gal took : 285 ms
[2024-05-29 21:51:04] [INFO ] Flatten gal took : 288 ms
[2024-05-29 21:51:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12304721680232773426.gal : 56 ms
[2024-05-29 21:51:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7672224328824548172.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/CTLFireability12304721680232773426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7672224328824548172.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 21:51:35] [INFO ] Flatten gal took : 283 ms
[2024-05-29 21:51:35] [INFO ] Applying decomposition
[2024-05-29 21:51:35] [INFO ] Flatten gal took : 305 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/graph11703310845638005119.txt' '-o' '/tmp/graph11703310845638005119.bin' '-w' '/tmp/graph11703310845638005119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11703310845638005119.bin' '-l' '-1' '-v' '-w' '/tmp/graph11703310845638005119.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:51:36] [INFO ] Decomposing Gal with order
[2024-05-29 21:51:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:51:37] [INFO ] Removed a total of 45131 redundant transitions.
[2024-05-29 21:51:37] [INFO ] Flatten gal took : 746 ms
[2024-05-29 21:51:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 152 ms.
[2024-05-29 21:51:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15329600842398159145.gal : 27 ms
[2024-05-29 21:51:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15925002649750821001.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/CTLFireability15329600842398159145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15925002649750821001.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.15231,35012,6662,21,24152,158,4567,6979,39,365,0


Converting to forward existential form...Done !
original formula: AG(((((A(E(A((((((i0.i0.u8.p12==1)&&(i2.i0.u21.p26==1))&&((i0.i1.u3.p40==1)&&(i3.i0.u24.p54==1)))&&(((i4.i0.u31.p68==1)&&(i3.i1.u11.p82==...3212
=> equivalent forward existential formula: [FwdG(((((FwdU(Init,TRUE) * !(((((i4.i0.u31.p68==0)||(i3.i1.u11.p82==0))||((i5.i0.u1.p96==0)||(i5.i1.u18.p110==0...4800
Reverse transition relation is NOT exact ! Due to transitions t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, i0.i0.t54, i0.i1...578
Using saturation style SCC detection
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
(forward)formula 0,1,8.7785,377416,1,0,1.06741e+06,192,50739,1.21384e+06,160,542,1425252
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 17 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 21:51:46] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:51:46] [INFO ] Invariant cache hit.
[2024-05-29 21:51:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 21:51:46] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:51:46] [INFO ] Invariant cache hit.
[2024-05-29 21:51:47] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:51:47] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 21:51:47] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:51:47] [INFO ] Invariant cache hit.
[2024-05-29 21:51:48] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 21:53:23] [INFO ] Deduced a trap composed of 9 places in 1288 ms of which 1 ms to minimize.
[2024-05-29 21:53:25] [INFO ] Deduced a trap composed of 9 places in 1296 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 9 places in 1324 ms of which 1 ms to minimize.
SMT process timed out in 98686ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 98729ms
Finished structural reductions in LTL mode , in 1 iterations and 100136 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 21:53:26] [INFO ] Flatten gal took : 258 ms
[2024-05-29 21:53:27] [INFO ] Flatten gal took : 286 ms
[2024-05-29 21:53:27] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 21:53:27] [INFO ] Flatten gal took : 261 ms
[2024-05-29 21:53:28] [INFO ] Flatten gal took : 262 ms
[2024-05-29 21:53:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16528255876567297313.gal : 52 ms
[2024-05-29 21:53:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6094734697017577749.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/CTLFireability16528255876567297313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6094734697017577749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 21:53:58] [INFO ] Flatten gal took : 262 ms
[2024-05-29 21:53:58] [INFO ] Applying decomposition
[2024-05-29 21:53:58] [INFO ] Flatten gal took : 265 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/graph211285419462648303.txt' '-o' '/tmp/graph211285419462648303.bin' '-w' '/tmp/graph211285419462648303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph211285419462648303.bin' '-l' '-1' '-v' '-w' '/tmp/graph211285419462648303.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:53:59] [INFO ] Decomposing Gal with order
[2024-05-29 21:53:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:54:00] [INFO ] Removed a total of 45127 redundant transitions.
[2024-05-29 21:54:00] [INFO ] Flatten gal took : 645 ms
[2024-05-29 21:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 218 ms.
[2024-05-29 21:54:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15563017425159526716.gal : 31 ms
[2024-05-29 21:54:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10855078819100459308.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/CTLFireability15563017425159526716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10855078819100459308.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 20 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 21:54:30] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:54:30] [INFO ] Invariant cache hit.
[2024-05-29 21:54:30] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 21:54:30] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:54:30] [INFO ] Invariant cache hit.
[2024-05-29 21:54:31] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:54:32] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 21:54:32] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:54:32] [INFO ] Invariant cache hit.
[2024-05-29 21:54:32] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 21:56:04] [INFO ] Deduced a trap composed of 9 places in 1261 ms of which 1 ms to minimize.
[2024-05-29 21:56:05] [INFO ] Deduced a trap composed of 9 places in 1296 ms of which 1 ms to minimize.
[2024-05-29 21:56:07] [INFO ] Deduced a trap composed of 9 places in 1348 ms of which 1 ms to minimize.
SMT process timed out in 95077ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 95118ms
Finished structural reductions in LTL mode , in 1 iterations and 96496 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 21:56:07] [INFO ] Flatten gal took : 243 ms
[2024-05-29 21:56:07] [INFO ] Flatten gal took : 285 ms
[2024-05-29 21:56:08] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 21:56:08] [INFO ] Flatten gal took : 256 ms
[2024-05-29 21:56:08] [INFO ] Flatten gal took : 259 ms
[2024-05-29 21:56:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2884980298491726524.gal : 50 ms
[2024-05-29 21:56:08] [INFO ] Time to serialize properties into /tmp/CTLFireability16183894919888560128.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/CTLFireability2884980298491726524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16183894919888560128.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 21:56:39] [INFO ] Flatten gal took : 259 ms
[2024-05-29 21:56:39] [INFO ] Applying decomposition
[2024-05-29 21:56:39] [INFO ] Flatten gal took : 262 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/graph16798544976173702524.txt' '-o' '/tmp/graph16798544976173702524.bin' '-w' '/tmp/graph16798544976173702524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16798544976173702524.bin' '-l' '-1' '-v' '-w' '/tmp/graph16798544976173702524.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:56:40] [INFO ] Decomposing Gal with order
[2024-05-29 21:56:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:56:41] [INFO ] Removed a total of 45122 redundant transitions.
[2024-05-29 21:56:41] [INFO ] Flatten gal took : 657 ms
[2024-05-29 21:56:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 210 ms.
[2024-05-29 21:56:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8308153893418326771.gal : 28 ms
[2024-05-29 21:56:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16227525090225015808.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/CTLFireability8308153893418326771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16227525090225015808.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,3.27317,80444,11320,34,108158,327,6533,241908,55,741,0


Converting to forward existential form...Done !
original formula: (AX(((((((AX((((((i3.u3.p12==0)||(i3.u22.p26==0))||((i3.u8.p40==0)||(i5.i0.u1.p54==0)))||(((i3.u29.p68==0)||(i4.u17.p82==0))||((u18.p96==...1764
=> equivalent forward existential formula: ([(EY((((((EY((Init * !(EG(EX(EG(!(EG(!((((((i3.u3.p12==0)||(i3.u22.p26==0))||((i3.u8.p40==0)||(i5.i0.u1.p54==0)...3722
Reverse transition relation is NOT exact ! Due to transitions t44, t49, t54, t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, u...568
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 19 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 21:57:11] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:57:11] [INFO ] Invariant cache hit.
[2024-05-29 21:57:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 21:57:11] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:57:11] [INFO ] Invariant cache hit.
[2024-05-29 21:57:12] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:57:12] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 21:57:12] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 21:57:12] [INFO ] Invariant cache hit.
[2024-05-29 21:57:13] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 21:58:45] [INFO ] Deduced a trap composed of 9 places in 1310 ms of which 1 ms to minimize.
[2024-05-29 21:58:46] [INFO ] Deduced a trap composed of 9 places in 1318 ms of which 1 ms to minimize.
[2024-05-29 21:58:47] [INFO ] Deduced a trap composed of 9 places in 1343 ms of which 1 ms to minimize.
SMT process timed out in 95006ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 95048ms
Finished structural reductions in LTL mode , in 1 iterations and 96435 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 21:58:48] [INFO ] Flatten gal took : 245 ms
[2024-05-29 21:58:48] [INFO ] Flatten gal took : 263 ms
[2024-05-29 21:58:48] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 21:58:49] [INFO ] Flatten gal took : 258 ms
[2024-05-29 21:58:49] [INFO ] Flatten gal took : 262 ms
[2024-05-29 21:58:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14097725346315949321.gal : 49 ms
[2024-05-29 21:58:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7210881879845327713.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/CTLFireability14097725346315949321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7210881879845327713.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 21:59:19] [INFO ] Flatten gal took : 254 ms
[2024-05-29 21:59:19] [INFO ] Applying decomposition
[2024-05-29 21:59:20] [INFO ] Flatten gal took : 257 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/graph14675220275293124233.txt' '-o' '/tmp/graph14675220275293124233.bin' '-w' '/tmp/graph14675220275293124233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14675220275293124233.bin' '-l' '-1' '-v' '-w' '/tmp/graph14675220275293124233.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:59:20] [INFO ] Decomposing Gal with order
[2024-05-29 21:59:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:59:21] [INFO ] Removed a total of 45121 redundant transitions.
[2024-05-29 21:59:21] [INFO ] Flatten gal took : 616 ms
[2024-05-29 21:59:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 139 ms.
[2024-05-29 21:59:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12703420842631693330.gal : 27 ms
[2024-05-29 21:59:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8311761759461422971.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/CTLFireability12703420842631693330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8311761759461422971.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.50923,35208,4844,26,37393,284,5276,81516,46,907,0


Converting to forward existential form...Done !
original formula: (AX(EG(EF((((((i2.i0.u3.p12==0)||(i2.i1.u5.p26==0))||((i0.u1.p40==0)||(i0.u12.p54==0)))||(((i3.i1.u30.p68==0)||(i2.i1.u16.p82==0))||((i2....1461
=> equivalent forward existential formula: ([(EY(Init) * !(EG(E(TRUE U (((((i2.i0.u3.p12==0)||(i2.i1.u5.p26==0))||((i0.u1.p40==0)||(i0.u12.p54==0)))||(((i3...1554
Reverse transition relation is NOT exact ! Due to transitions t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, i0.t43, i0.t39, ...569
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,0,16.1547,676460,1,0,1.17451e+06,289,61193,5.19216e+06,191,1165,1195453
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 66 place count 56 transition count 4184
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2113 place count 56 transition count 2137
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2124 place count 56 transition count 2126
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2146 place count 45 transition count 2115
Applied a total of 2146 rules in 1775 ms. Remains 45 /90 variables (removed 45) and now considering 2115/4218 (removed 2103) transitions.
[2024-05-29 21:59:40] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-05-29 21:59:40] [INFO ] Computed 1 invariants in 10 ms
[2024-05-29 21:59:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 21:59:40] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 21:59:40] [INFO ] Invariant cache hit.
[2024-05-29 21:59:40] [INFO ] State equation strengthened by 2058 read => feed constraints.
[2024-05-29 21:59:40] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-05-29 21:59:40] [INFO ] Redundant transitions in 299 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-29 21:59:41] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 21:59:41] [INFO ] Invariant cache hit.
[2024-05-29 21:59:41] [INFO ] State equation strengthened by 2058 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:00:19] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:00:19] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:00:19] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:00:19] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:00:19] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 22:00:19] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:00:19] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:00:20] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:00:20] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:00:20] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:00:20] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:00:20] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 1 ms to minimize.
[2024-05-29 22:00:21] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 0 ms to minimize.
[2024-05-29 22:00:21] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 0 ms to minimize.
[2024-05-29 22:00:22] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-05-29 22:00:22] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2024-05-29 22:00:22] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-29 22:00:23] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 1 ms to minimize.
[2024-05-29 22:00:23] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 0 ms to minimize.
[2024-05-29 22:00:24] [INFO ] Deduced a trap composed of 4 places in 403 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:00:24] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:00:24] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 22:00:24] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:00:24] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:00:24] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:00:24] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:00:24] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 22:00:25] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:00:25] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:00:25] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:00:25] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:00:25] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 22:00:25] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:00:25] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:00:25] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:00:26] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-29 22:00:26] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 22:00:26] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:00:26] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 22:00:26] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:00:30] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 22:00:30] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2024-05-29 22:00:30] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-29 22:00:31] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 22:00:31] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 22:00:31] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 22:00:31] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2024-05-29 22:00:32] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2024-05-29 22:00:32] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 22:00:32] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-29 22:00:32] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:00:32] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:00:33] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 0 ms to minimize.
[2024-05-29 22:00:33] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-29 22:00:33] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 22:00:33] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:00:33] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 22:00:34] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:00:34] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 22:00:34] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:00:35] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-29 22:00:35] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-29 22:00:35] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 22:00:35] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:00:35] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 22:00:36] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 22:00:36] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-29 22:00:36] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:00:36] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2024-05-29 22:00:36] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:00:36] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:00:37] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-29 22:00:37] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:00:37] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:00:37] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 22:00:37] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 22:00:37] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-29 22:00:38] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:00:38] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 0 ms to minimize.
[2024-05-29 22:00:38] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:00:39] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:00:39] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 22:00:39] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 22:00:39] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:00:39] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:00:39] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:00:39] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:00:40] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:00:40] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:00:40] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:00:40] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:00:40] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:00:40] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:00:40] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:00:41] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:00:41] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-29 22:00:41] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:00:41] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 45/2148 variables, and 99 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2058 constraints, PredecessorRefiner: 2104/23 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:00:47] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 22:00:47] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:00:47] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 22:00:48] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-29 22:00:48] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 22:00:48] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:00:48] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:00:49] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:00:49] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:00:49] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-29 22:00:49] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 22:00:49] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:00:50] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-29 22:00:50] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:00:50] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 22:00:50] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:00:50] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 22:00:51] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 22:00:51] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:00:51] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:00:53] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 22:00:53] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 22:00:54] [INFO ] Deduced a trap composed of 4 places in 465 ms of which 1 ms to minimize.
[2024-05-29 22:00:54] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2024-05-29 22:00:55] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-05-29 22:00:55] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-29 22:00:55] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 22:00:56] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 22:00:56] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 22:00:56] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:00:56] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:00:56] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:00:56] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-29 22:00:56] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 14/133 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 45/2148 variables, and 133 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2058 constraints, PredecessorRefiner: 2081/23 constraints, Known Traps: 132/132 constraints]
After SMT, in 91353ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 91373ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/90 places, 2115/4218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94145 ms. Remains : 45/90 places, 2115/4218 transitions.
[2024-05-29 22:01:12] [INFO ] Flatten gal took : 122 ms
[2024-05-29 22:01:12] [INFO ] Flatten gal took : 130 ms
[2024-05-29 22:01:12] [INFO ] Input system was already deterministic with 2115 transitions.
RANDOM walk for 44 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 22:01:13] [INFO ] Flatten gal took : 131 ms
[2024-05-29 22:01:13] [INFO ] Flatten gal took : 132 ms
[2024-05-29 22:01:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8814419801123613873.gal : 26 ms
[2024-05-29 22:01:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1864990116703567429.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8814419801123613873.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1864990116703567429.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:01:13] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:01:13] [INFO ] Computed 1 invariants in 18 ms
[2024-05-29 22:01:13] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 22:01:13] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:01:13] [INFO ] Invariant cache hit.
[2024-05-29 22:01:14] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:01:14] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:01:14] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:01:14] [INFO ] Invariant cache hit.
[2024-05-29 22:01:15] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 22:02:47] [INFO ] Deduced a trap composed of 9 places in 1326 ms of which 1 ms to minimize.
[2024-05-29 22:02:49] [INFO ] Deduced a trap composed of 9 places in 1316 ms of which 1 ms to minimize.
[2024-05-29 22:02:50] [INFO ] Deduced a trap composed of 9 places in 1320 ms of which 1 ms to minimize.
SMT process timed out in 95808ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 95850ms
Finished structural reductions in LTL mode , in 1 iterations and 97268 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 22:02:50] [INFO ] Flatten gal took : 246 ms
[2024-05-29 22:02:51] [INFO ] Flatten gal took : 293 ms
[2024-05-29 22:02:51] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 22:02:51] [INFO ] Flatten gal took : 260 ms
[2024-05-29 22:02:52] [INFO ] Flatten gal took : 262 ms
[2024-05-29 22:02:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1659209192746037575.gal : 50 ms
[2024-05-29 22:02:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2161516045531413054.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/CTLFireability1659209192746037575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2161516045531413054.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 22:03:22] [INFO ] Flatten gal took : 260 ms
[2024-05-29 22:03:22] [INFO ] Applying decomposition
[2024-05-29 22:03:22] [INFO ] Flatten gal took : 262 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/graph14765851990678779683.txt' '-o' '/tmp/graph14765851990678779683.bin' '-w' '/tmp/graph14765851990678779683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14765851990678779683.bin' '-l' '-1' '-v' '-w' '/tmp/graph14765851990678779683.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:03:23] [INFO ] Decomposing Gal with order
[2024-05-29 22:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:03:24] [INFO ] Removed a total of 45131 redundant transitions.
[2024-05-29 22:03:24] [INFO ] Flatten gal took : 641 ms
[2024-05-29 22:03:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 148 ms.
[2024-05-29 22:03:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3361165593736571992.gal : 28 ms
[2024-05-29 22:03:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5810413078397086632.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/CTLFireability3361165593736571992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5810413078397086632.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.21018,34888,6693,31,25639,218,4738,9512,52,548,0


Converting to forward existential form...Done !
original formula: ((AX(AG((((((i4.u4.p12==1)&&(i1.u23.p26==1))&&((i1.u13.p40==1)&&(i2.i0.i0.u11.p54==1)))&&(((i1.u15.p68==1)&&(i2.i1.i0.u18.p82==1))&&((i2....2600
=> equivalent forward existential formula: [(FwdU(EY(((Init * !(!(!((E(!(E((((((i4.u4.p12==1)&&(i1.u23.p26==1))&&((i1.u13.p40==1)&&(i2.i0.i0.u11.p54==1)))&...4113
Reverse transition relation is NOT exact ! Due to transitions t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, u29.t8, u29.t9, ...578
Using saturation style SCC detection
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 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
(forward)formula 0,1,4.86537,166620,1,0,393616,302,47583,491350,220,853,836748
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 11 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:03:29] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:03:29] [INFO ] Invariant cache hit.
[2024-05-29 22:03:29] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 22:03:29] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:03:29] [INFO ] Invariant cache hit.
[2024-05-29 22:03:30] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:03:30] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:03:31] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:03:31] [INFO ] Invariant cache hit.
[2024-05-29 22:03:31] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 22:05:03] [INFO ] Deduced a trap composed of 9 places in 1341 ms of which 1 ms to minimize.
[2024-05-29 22:05:05] [INFO ] Deduced a trap composed of 9 places in 1459 ms of which 1 ms to minimize.
[2024-05-29 22:05:06] [INFO ] Deduced a trap composed of 9 places in 1448 ms of which 3 ms to minimize.
SMT process timed out in 95646ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 95687ms
Finished structural reductions in LTL mode , in 1 iterations and 97076 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 22:05:06] [INFO ] Flatten gal took : 270 ms
[2024-05-29 22:05:07] [INFO ] Flatten gal took : 291 ms
[2024-05-29 22:05:07] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 22:05:08] [INFO ] Flatten gal took : 282 ms
[2024-05-29 22:05:08] [INFO ] Flatten gal took : 311 ms
[2024-05-29 22:05:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16204032905972415143.gal : 49 ms
[2024-05-29 22:05:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12493559253843511377.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/CTLFireability16204032905972415143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12493559253843511377.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 22:05:38] [INFO ] Flatten gal took : 262 ms
[2024-05-29 22:05:38] [INFO ] Applying decomposition
[2024-05-29 22:05:39] [INFO ] Flatten gal took : 264 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/graph1826772797737997033.txt' '-o' '/tmp/graph1826772797737997033.bin' '-w' '/tmp/graph1826772797737997033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1826772797737997033.bin' '-l' '-1' '-v' '-w' '/tmp/graph1826772797737997033.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:05:39] [INFO ] Decomposing Gal with order
[2024-05-29 22:05:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:05:40] [INFO ] Removed a total of 45127 redundant transitions.
[2024-05-29 22:05:40] [INFO ] Flatten gal took : 672 ms
[2024-05-29 22:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 290 ms.
[2024-05-29 22:05:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9986315436838214492.gal : 21 ms
[2024-05-29 22:05:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17773633097774638111.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/CTLFireability9986315436838214492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17773633097774638111.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.25548,31200,6814,43,38076,581,4782,43771,61,1440,0


Converting to forward existential form...Done !
original formula: AF(EX(AX(AF((((((i3.i0.u1.p12==1)&&(i3.i0.u16.p26==1))&&((i1.i1.u9.p40==1)&&(i2.u12.p54==1)))&&(((i3.i0.u15.p68==1)&&(i2.u5.p82==1))&&((i...266
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!(!(EG(!((((((i3.i0.u1.p12==1)&&(i3.i0.u16.p26==1))&&((i1.i1.u9.p40==1)&&(i2.u12.p54==1)))&...323
Reverse transition relation is NOT exact ! Due to transitions t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, i0.t51, i0.t41, ...620
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,8.71464,380732,1,0,1.08287e+06,581,48794,1.39019e+06,262,1605,1207887
FORMULA StigmergyElection-PT-11a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 66 place count 56 transition count 4184
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2113 place count 56 transition count 2137
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2124 place count 56 transition count 2126
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2146 place count 45 transition count 2115
Applied a total of 2146 rules in 1857 ms. Remains 45 /90 variables (removed 45) and now considering 2115/4218 (removed 2103) transitions.
[2024-05-29 22:05:51] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
// Phase 1: matrix 2103 rows 45 cols
[2024-05-29 22:05:51] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 22:05:51] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 22:05:51] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 22:05:51] [INFO ] Invariant cache hit.
[2024-05-29 22:05:52] [INFO ] State equation strengthened by 2058 read => feed constraints.
[2024-05-29 22:05:52] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-05-29 22:05:52] [INFO ] Redundant transitions in 252 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-29 22:05:52] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 22:05:52] [INFO ] Invariant cache hit.
[2024-05-29 22:05:53] [INFO ] State equation strengthened by 2058 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:06:35] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 2 ms to minimize.
[2024-05-29 22:06:35] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-29 22:06:35] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 22:06:36] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 22:06:36] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 22:06:36] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-29 22:06:36] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-29 22:06:36] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 22:06:36] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-29 22:06:36] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-29 22:06:36] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 22:06:37] [INFO ] Deduced a trap composed of 4 places in 555 ms of which 1 ms to minimize.
[2024-05-29 22:06:38] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 0 ms to minimize.
[2024-05-29 22:06:38] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 0 ms to minimize.
[2024-05-29 22:06:38] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-05-29 22:06:39] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2024-05-29 22:06:39] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 22:06:39] [INFO ] Deduced a trap composed of 4 places in 577 ms of which 1 ms to minimize.
[2024-05-29 22:06:40] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 1 ms to minimize.
[2024-05-29 22:06:40] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2024-05-29 22:06:42] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-05-29 22:06:42] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-29 22:06:42] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-29 22:06:42] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-29 22:06:42] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 22:06:42] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 22:06:42] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-29 22:06:43] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-29 22:06:43] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:06:43] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2024-05-29 22:06:43] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-29 22:06:43] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:06:47] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 22:06:48] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-05-29 22:06:48] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2024-05-29 22:06:48] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 22:06:48] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:06:48] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 22:06:49] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2024-05-29 22:06:49] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
[2024-05-29 22:06:49] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2024-05-29 22:06:50] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-29 22:06:50] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-29 22:06:50] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:06:50] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 0 ms to minimize.
[2024-05-29 22:06:51] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-29 22:06:51] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-29 22:06:51] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 22:06:51] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:06:51] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:06:51] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:06:52] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:06:52] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2024-05-29 22:06:53] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2024-05-29 22:06:53] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-29 22:06:53] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 22:06:53] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-29 22:06:53] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-29 22:06:54] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 22:06:54] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:06:54] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2024-05-29 22:06:54] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-05-29 22:06:54] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-29 22:06:54] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 22:06:55] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 22:06:55] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-29 22:06:55] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 22:06:55] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2024-05-29 22:06:55] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 22:06:56] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:06:56] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2024-05-29 22:06:56] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:06:57] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 22:06:57] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-29 22:06:57] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 22:06:57] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-29 22:06:57] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:06:58] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 22:06:58] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 22:06:58] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-29 22:06:58] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-29 22:06:58] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2024-05-29 22:06:58] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
SMT process timed out in 65872ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 65898ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/90 places, 2115/4218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68760 ms. Remains : 45/90 places, 2115/4218 transitions.
[2024-05-29 22:06:58] [INFO ] Flatten gal took : 124 ms
[2024-05-29 22:06:59] [INFO ] Flatten gal took : 136 ms
[2024-05-29 22:06:59] [INFO ] Input system was already deterministic with 2115 transitions.
RANDOM walk for 44 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-11a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 22:06:59] [INFO ] Flatten gal took : 141 ms
[2024-05-29 22:06:59] [INFO ] Flatten gal took : 144 ms
[2024-05-29 22:06:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12393333295381265448.gal : 29 ms
[2024-05-29 22:06:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13537710810530765434.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12393333295381265448.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13537710810530765434.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 66 place count 56 transition count 4184
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2113 place count 56 transition count 2137
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2124 place count 56 transition count 2126
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2146 place count 45 transition count 2115
Applied a total of 2146 rules in 1737 ms. Remains 45 /90 variables (removed 45) and now considering 2115/4218 (removed 2103) transitions.
[2024-05-29 22:07:01] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 22:07:01] [INFO ] Invariant cache hit.
[2024-05-29 22:07:01] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 22:07:01] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 22:07:01] [INFO ] Invariant cache hit.
[2024-05-29 22:07:02] [INFO ] State equation strengthened by 2058 read => feed constraints.
[2024-05-29 22:07:02] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2024-05-29 22:07:02] [INFO ] Redundant transitions in 226 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-29 22:07:02] [INFO ] Flow matrix only has 2103 transitions (discarded 12 similar events)
[2024-05-29 22:07:02] [INFO ] Invariant cache hit.
[2024-05-29 22:07:02] [INFO ] State equation strengthened by 2058 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:07:44] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:07:44] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:07:44] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 22:07:44] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 22:07:45] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 22:07:45] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:07:45] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:07:45] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:07:45] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:07:45] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:07:45] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:07:46] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 1 ms to minimize.
[2024-05-29 22:07:46] [INFO ] Deduced a trap composed of 4 places in 445 ms of which 0 ms to minimize.
[2024-05-29 22:07:47] [INFO ] Deduced a trap composed of 4 places in 417 ms of which 0 ms to minimize.
[2024-05-29 22:07:47] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 0 ms to minimize.
[2024-05-29 22:07:47] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2024-05-29 22:07:47] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-29 22:07:48] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 1 ms to minimize.
[2024-05-29 22:07:49] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 1 ms to minimize.
[2024-05-29 22:07:49] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 22:07:51] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:07:51] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:07:51] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 22:07:51] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 22:07:51] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:07:51] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:07:51] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 22:07:52] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:07:56] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 22:07:56] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-29 22:07:56] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 22:07:56] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 22:07:56] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:07:57] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 22:07:57] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2024-05-29 22:07:57] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2024-05-29 22:07:57] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 22:07:58] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 22:07:58] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 22:07:58] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:07:58] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-05-29 22:07:59] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-05-29 22:07:59] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-29 22:07:59] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-29 22:07:59] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 22:07:59] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:07:59] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 22:08:00] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:08:00] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2024-05-29 22:08:01] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-29 22:08:01] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 22:08:01] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:08:01] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:08:01] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 22:08:01] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:08:02] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:08:02] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-05-29 22:08:02] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:08:02] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 22:08:02] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:08:02] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:08:03] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 22:08:03] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-29 22:08:03] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-29 22:08:03] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-29 22:08:03] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 22:08:04] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 0 ms to minimize.
[2024-05-29 22:08:04] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:08:05] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 22:08:05] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-29 22:08:05] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:08:05] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-29 22:08:05] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:08:05] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 22:08:05] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:08:06] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 22:08:06] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 22:08:06] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:08:06] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-29 22:08:06] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:08:06] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 22:08:06] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 22:08:06] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:08:07] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 22:08:07] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:08:07] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 45/2148 variables, and 99 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2058 constraints, PredecessorRefiner: 2104/23 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (OVERLAPS) 11/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:08:13] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-29 22:08:13] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:08:13] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 22:08:13] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-29 22:08:14] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 22:08:14] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-29 22:08:14] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 22:08:14] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:08:14] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2024-05-29 22:08:14] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-29 22:08:15] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 22:08:15] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-29 22:08:15] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:08:15] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 22:08:16] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-29 22:08:16] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2024-05-29 22:08:16] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-29 22:08:16] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-29 22:08:17] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-29 22:08:17] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-29 22:08:19] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 22:08:19] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:08:20] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 0 ms to minimize.
[2024-05-29 22:08:20] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 0 ms to minimize.
[2024-05-29 22:08:20] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2024-05-29 22:08:21] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 0 ms to minimize.
[2024-05-29 22:08:21] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 22:08:21] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-29 22:08:21] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:08:21] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 22:08:22] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 22:08:22] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:08:22] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 22:08:22] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 14/133 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 45/2148 variables, and 133 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/2058 constraints, PredecessorRefiner: 2081/23 constraints, Known Traps: 132/132 constraints]
After SMT, in 95192ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 95215ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/90 places, 2115/4218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97909 ms. Remains : 45/90 places, 2115/4218 transitions.
[2024-05-29 22:08:37] [INFO ] Flatten gal took : 133 ms
[2024-05-29 22:08:38] [INFO ] Flatten gal took : 142 ms
[2024-05-29 22:08:38] [INFO ] Input system was already deterministic with 2115 transitions.
[2024-05-29 22:08:38] [INFO ] Flatten gal took : 147 ms
[2024-05-29 22:08:38] [INFO ] Flatten gal took : 133 ms
[2024-05-29 22:08:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3678112579625683865.gal : 26 ms
[2024-05-29 22:08:38] [INFO ] Time to serialize properties into /tmp/CTLFireability13430134527302853078.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/CTLFireability3678112579625683865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13430134527302853078.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,4117,2.22273,75232,2,1684,5,38196,6,0,2284,18832,0


Converting to forward existential form...Done !
original formula: AF(EG((AG((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||(((p124==0)||(p138==0))||(p152=...440
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !((((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||...503
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...374
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-29 22:09:08] [INFO ] Flatten gal took : 140 ms
[2024-05-29 22:09:08] [INFO ] Applying decomposition
[2024-05-29 22:09:08] [INFO ] Flatten gal took : 140 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/graph16837081713822213013.txt' '-o' '/tmp/graph16837081713822213013.bin' '-w' '/tmp/graph16837081713822213013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16837081713822213013.bin' '-l' '-1' '-v' '-w' '/tmp/graph16837081713822213013.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:09:09] [INFO ] Decomposing Gal with order
[2024-05-29 22:09:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:09:09] [INFO ] Removed a total of 22624 redundant transitions.
[2024-05-29 22:09:09] [INFO ] Flatten gal took : 293 ms
[2024-05-29 22:09:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2024-05-29 22:09:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1639919643315972448.gal : 16 ms
[2024-05-29 22:09:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9809686044642533569.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/CTLFireability1639919643315972448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9809686044642533569.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 17 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:09:40] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:09:40] [INFO ] Computed 1 invariants in 19 ms
[2024-05-29 22:09:40] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 22:09:40] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:09:40] [INFO ] Invariant cache hit.
[2024-05-29 22:09:41] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:09:41] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:09:41] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:09:41] [INFO ] Invariant cache hit.
[2024-05-29 22:09:41] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-05-29 22:11:20] [INFO ] Deduced a trap composed of 9 places in 1297 ms of which 1 ms to minimize.
[2024-05-29 22:11:22] [INFO ] Deduced a trap composed of 9 places in 1312 ms of which 1 ms to minimize.
SMT process timed out in 100652ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 100703ms
Finished structural reductions in LTL mode , in 1 iterations and 102108 ms. Remains : 90/90 places, 4218/4218 transitions.
[2024-05-29 22:11:22] [INFO ] Flatten gal took : 257 ms
[2024-05-29 22:11:22] [INFO ] Flatten gal took : 267 ms
[2024-05-29 22:11:23] [INFO ] Input system was already deterministic with 4218 transitions.
[2024-05-29 22:11:23] [INFO ] Flatten gal took : 262 ms
[2024-05-29 22:11:23] [INFO ] Flatten gal took : 266 ms
[2024-05-29 22:11:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15662754612537933699.gal : 50 ms
[2024-05-29 22:11:23] [INFO ] Time to serialize properties into /tmp/CTLFireability9114392045525283193.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/CTLFireability15662754612537933699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9114392045525283193.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 22:11:54] [INFO ] Flatten gal took : 270 ms
[2024-05-29 22:11:54] [INFO ] Applying decomposition
[2024-05-29 22:11:54] [INFO ] Flatten gal took : 272 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/graph2078204306946179436.txt' '-o' '/tmp/graph2078204306946179436.bin' '-w' '/tmp/graph2078204306946179436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2078204306946179436.bin' '-l' '-1' '-v' '-w' '/tmp/graph2078204306946179436.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:11:55] [INFO ] Decomposing Gal with order
[2024-05-29 22:11:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:11:56] [INFO ] Removed a total of 45128 redundant transitions.
[2024-05-29 22:11:56] [INFO ] Flatten gal took : 631 ms
[2024-05-29 22:11:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 145 ms.
[2024-05-29 22:11:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11806659303479316045.gal : 29 ms
[2024-05-29 22:11:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13225838775350227267.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/CTLFireability11806659303479316045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13225838775350227267.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.2852,34908,7166,31,31375,256,4791,23533,56,662,0


Converting to forward existential form...Done !
original formula: (AG((((((i5.u30.p12==0)||(i5.u3.p26==0))||((i5.u28.p40==0)||(i1.i0.u10.p54==0)))||(((i2.u13.p68==0)||(i1.i1.u8.p82==0))||((i4.u23.p96==0)...1329
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((((((i5.u30.p12==0)||(i5.u3.p26==0))||((i5.u28.p40==0)||(i1.i0.u10.p54==0)))||(((i2.u13.p...1417
Reverse transition relation is NOT exact ! Due to transitions t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, u21.t18, u21.t19...560
(forward)formula 0,0,4.09887,143936,1,0,334274,290,58998,469802,234,928,755736
FORMULA StigmergyElection-PT-11a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-29 22:12:00] [INFO ] Flatten gal took : 269 ms
[2024-05-29 22:12:01] [INFO ] Flatten gal took : 272 ms
[2024-05-29 22:12:01] [INFO ] Applying decomposition
[2024-05-29 22:12:01] [INFO ] Flatten gal took : 267 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/graph12265540102647728497.txt' '-o' '/tmp/graph12265540102647728497.bin' '-w' '/tmp/graph12265540102647728497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12265540102647728497.bin' '-l' '-1' '-v' '-w' '/tmp/graph12265540102647728497.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:12:02] [INFO ] Decomposing Gal with order
[2024-05-29 22:12:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:12:03] [INFO ] Removed a total of 45120 redundant transitions.
[2024-05-29 22:12:03] [INFO ] Flatten gal took : 659 ms
[2024-05-29 22:12:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 150 ms.
[2024-05-29 22:12:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13686307926403614063.gal : 28 ms
[2024-05-29 22:12:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12673818062718824459.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/CTLFireability13686307926403614063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12673818062718824459.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.35021,35080,4730,34,26130,265,4862,52654,59,673,0


Converting to forward existential form...Done !
original formula: E(AX(EF((AF((((((i0.u3.p12==1)&&(i4.u29.p26==1))&&((i4.u11.p40==1)&&(i0.u1.p54==1)))&&(((i3.i0.i0.u13.p68==1)&&(u18.p82==1))&&((i3.i0.i1....918
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(E(TRUE U (!(EG(!((((((i0.u3.p12==1)&&(i4.u29.p26==1))&&((i4.u11.p40==1)&&(i0.u1.p54==1)))&&((...994
Reverse transition relation is NOT exact ! Due to transitions t4196, t4198, t4200, t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, u18.t28, u18.t29...587
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,33.2046,1137404,1,0,1.36503e+06,479,49290,1.0418e+07,251,1766,1650979
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((AX(((EG((((((i0.u3.p12==0)||(i4.u29.p26==0))||((i4.u11.p40==0)||(i0.u1.p54==0)))||(((i3.i0.i0.u13.p68==0)||(u18.p82==0))||((i3.i0.i1....1369
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(((EG((((((i0.u3.p12==0)||(i4.u29.p26==0))||((i4.u11.p40==0)||(i0.u1.p54==0)))||(((i3.i0.i0.u1...1436
(forward)formula 1,1,35.4676,1207628,1,0,1.47345e+06,526,49634,1.07882e+07,270,1974,2096528
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(EG(((EF((((((i0.u3.p12==1)&&(i4.u29.p26==1))&&((i4.u11.p40==1)&&(i0.u1.p54==1)))&&(((i3.i0.i0.u13.p68==1)&&(u18.p82==1))&&((i3.i0.i1.u2...3593
=> equivalent forward existential formula: [((Init * !(EG(!(((!(!(EG(!(EG((((((i0.u3.p12==1)&&(i4.u29.p26==1))&&((i4.u11.p40==1)&&(i0.u1.p54==1)))&&(((i3.i...11396
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 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 2,1,35.8672,1212644,1,0,1.47391e+06,527,49761,1.08441e+07,277,1975,2101961
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(((((((AX((((((i0.u3.p12==0)||(i4.u29.p26==0))||((i4.u11.p40==0)||(i0.u1.p54==0)))||(((i3.i0.i0.u13.p68==0)||(u18.p82==0))||((i3.i0.i1...1820
=> equivalent forward existential formula: ([(EY((((((EY((Init * !(EG(EX(EG(!(EG(!((((((i0.u3.p12==0)||(i4.u29.p26==0))||((i4.u11.p40==0)||(i0.u1.p54==0)))...3834
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 3,0,35.9467,1212908,1,0,1.47518e+06,541,49764,1.08484e+07,277,1991,2104111
FORMULA StigmergyElection-PT-11a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(EG((AG((((((i0.u3.p12==0)||(i4.u29.p26==0))||((i4.u11.p40==0)||(i0.u1.p54==0)))||(((i3.i0.i0.u13.p68==0)||(u18.p82==0))||((i3.i0.i1.u2...692
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !((((((i0.u3.p12==0)||(i4.u29.p26==0))||((i4.u11.p40==0)||(i0.u1.p54==0)))||(((i3.i0...755
(forward)formula 4,0,36.0411,1214756,1,0,1.47743e+06,541,49767,1.0854e+07,277,1991,2115521
FORMULA StigmergyElection-PT-11a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2124584 ms.

BK_STOP 1717020759772

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-11a"
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 StigmergyElection-PT-11a, 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 r400-tall-171690532200394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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