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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 227K 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 StigmergyCommit-PT-04a-CTLFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-04a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716985498145

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 12:24:59] [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 12:24:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:24:59] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-29 12:24:59] [INFO ] Transformed 184 places.
[2024-05-29 12:24:59] [INFO ] Transformed 592 transitions.
[2024-05-29 12:24:59] [INFO ] Found NUPN structural information;
[2024-05-29 12:24:59] [INFO ] Parsed PT model containing 184 places and 592 transitions and 4011 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
Support contains 41 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 301/301 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 158 transition count 273
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 158 transition count 273
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 158 transition count 269
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 148 transition count 259
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 148 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 148 transition count 255
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 146 transition count 253
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 146 transition count 253
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 144 transition count 251
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 144 transition count 251
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 142 transition count 249
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 142 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 141 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 141 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 141 transition count 247
Applied a total of 95 rules in 72 ms. Remains 141 /184 variables (removed 43) and now considering 247/301 (removed 54) transitions.
[2024-05-29 12:24:59] [INFO ] Flow matrix only has 234 transitions (discarded 13 similar events)
// Phase 1: matrix 234 rows 141 cols
[2024-05-29 12:24:59] [INFO ] Computed 6 invariants in 19 ms
[2024-05-29 12:25:00] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-29 12:25:00] [INFO ] Flow matrix only has 234 transitions (discarded 13 similar events)
[2024-05-29 12:25:00] [INFO ] Invariant cache hit.
[2024-05-29 12:25:00] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-29 12:25:00] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2024-05-29 12:25:00] [INFO ] Flow matrix only has 234 transitions (discarded 13 similar events)
[2024-05-29 12:25:00] [INFO ] Invariant cache hit.
[2024-05-29 12:25:00] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-29 12:25:01] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 12 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-29 12:25:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:25:03] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-29 12:25:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2024-05-29 12:25:04] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 2 ms to minimize.
[2024-05-29 12:25:04] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:25:05] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:25:05] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:25:05] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-29 12:25:05] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:25:05] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 233/374 variables, 141/188 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 118/306 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (OVERLAPS) 1/375 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 12 (OVERLAPS) 0/375 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 307 constraints, problems are : Problem set: 0 solved, 246 unsolved in 17394 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-29 12:25:18] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:25:18] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:25:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 233/374 variables, 141/191 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 118/309 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 246/555 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-29 12:25:22] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (OVERLAPS) 1/375 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 12 (OVERLAPS) 0/375 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 557 constraints, problems are : Problem set: 0 solved, 246 unsolved in 15074 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 45/45 constraints]
After SMT, in 32709ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 32735ms
Starting structural reductions in LTL mode, iteration 1 : 141/184 places, 247/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33253 ms. Remains : 141/184 places, 247/301 transitions.
Support contains 41 out of 141 places after structural reductions.
[2024-05-29 12:25:33] [INFO ] Flatten gal took : 39 ms
[2024-05-29 12:25:33] [INFO ] Flatten gal took : 17 ms
[2024-05-29 12:25:33] [INFO ] Input system was already deterministic with 247 transitions.
Support contains 40 out of 141 places (down from 41) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 31
RANDOM walk for 40000 steps (67 resets) in 1977 ms. (20 steps per ms) remains 1/31 properties
BEST_FIRST walk for 40004 steps (62 resets) in 379 ms. (105 steps per ms) remains 1/1 properties
[2024-05-29 12:25:33] [INFO ] Flow matrix only has 234 transitions (discarded 13 similar events)
[2024-05-29 12:25:33] [INFO ] Invariant cache hit.
[2024-05-29 12:25:33] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 233/374 variables, 141/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 118/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/375 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/375 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 140/375 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/141 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 12:25:34] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:25:34] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:25:34] [INFO ] Input system was already deterministic with 247 transitions.
Computed a total of 32 stabilizing places and 31 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 223
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 122 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 113 transition count 209
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 113 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 113 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 110 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 110 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 107 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 107 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 107 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 105 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 105 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 103 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 103 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 103 transition count 195
Applied a total of 82 rules in 16 ms. Remains 103 /141 variables (removed 38) and now considering 195/247 (removed 52) transitions.
[2024-05-29 12:25:34] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-05-29 12:25:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:25:34] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 12:25:34] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-29 12:25:34] [INFO ] Invariant cache hit.
[2024-05-29 12:25:34] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:25:34] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 205 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/141 places, 195/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 7 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-05-29 12:25:34] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-05-29 12:25:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:25:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 12:25:34] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-05-29 12:25:34] [INFO ] Invariant cache hit.
[2024-05-29 12:25:34] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:25:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/141 places, 152/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 313 ms. Remains : 64/141 places, 152/247 transitions.
[2024-05-29 12:25:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:25:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:25:34] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-29 12:25:34] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:25:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:25:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17308101516758137189.gal : 4 ms
[2024-05-29 12:25:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5590136599495533547.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/CTLFireability17308101516758137189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5590136599495533547.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,24744,0.060168,5016,2,677,5,4669,6,0,402,3603,0


Converting to forward existential form...Done !
original formula: EG(EX(EX(!(A(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1)) U (p137==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX(EX(!(!((E(!((p137==1)) U (!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))) * !((p137...197
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t47, t50, t51, t53, t56,...336
(forward)formula 0,1,0.3346,15564,1,0,251,42072,326,84,3503,41585,355
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 223
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 122 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 113 transition count 209
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 113 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 113 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 110 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 110 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 107 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 107 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 107 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 105 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 105 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 103 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 103 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 103 transition count 195
Applied a total of 82 rules in 17 ms. Remains 103 /141 variables (removed 38) and now considering 195/247 (removed 52) transitions.
[2024-05-29 12:25:34] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-05-29 12:25:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:25:35] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 12:25:35] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-29 12:25:35] [INFO ] Invariant cache hit.
[2024-05-29 12:25:35] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:25:35] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 208 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/141 places, 195/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 9 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-05-29 12:25:35] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-05-29 12:25:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:25:35] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 12:25:35] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-05-29 12:25:35] [INFO ] Invariant cache hit.
[2024-05-29 12:25:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:25:35] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/141 places, 152/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 64/141 places, 152/247 transitions.
[2024-05-29 12:25:35] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:25:35] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:25:35] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-29 12:25:35] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:25:35] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:25:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16292188508394773265.gal : 2 ms
[2024-05-29 12:25:35] [INFO ] Time to serialize properties into /tmp/CTLFireability17510823600039217004.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/CTLFireability16292188508394773265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17510823600039217004.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24744,0.050301,5132,2,677,5,4669,6,0,402,3603,0


Converting to forward existential form...Done !
original formula: AF(AG(AX((p101==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EX(!((p101==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t47, t50, t51, t53, t56,...336
(forward)formula 0,0,0.594024,26836,1,0,359,86113,325,183,3449,89704,464
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 133 transition count 238
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 133 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 133 transition count 236
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 130 transition count 233
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 130 transition count 233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 129 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 129 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 128 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 128 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 128 transition count 230
Applied a total of 29 rules in 8 ms. Remains 128 /141 variables (removed 13) and now considering 230/247 (removed 17) transitions.
[2024-05-29 12:25:35] [INFO ] Flow matrix only has 219 transitions (discarded 11 similar events)
// Phase 1: matrix 219 rows 128 cols
[2024-05-29 12:25:35] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 12:25:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 12:25:36] [INFO ] Flow matrix only has 219 transitions (discarded 11 similar events)
[2024-05-29 12:25:36] [INFO ] Invariant cache hit.
[2024-05-29 12:25:36] [INFO ] State equation strengthened by 114 read => feed constraints.
[2024-05-29 12:25:36] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2024-05-29 12:25:36] [INFO ] Flow matrix only has 219 transitions (discarded 11 similar events)
[2024-05-29 12:25:36] [INFO ] Invariant cache hit.
[2024-05-29 12:25:36] [INFO ] State equation strengthened by 114 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:25:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:25:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:25:39] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:25:40] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:25:40] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:25:40] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:25:40] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:25:40] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:25:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:25:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:25:41] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:43] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:43] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:25:43] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:44] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (OVERLAPS) 218/346 variables, 128/187 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/346 variables, 113/300 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 14 (OVERLAPS) 1/347 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 16 (OVERLAPS) 0/347 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 301 constraints, problems are : Problem set: 0 solved, 229 unsolved in 18600 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2024-05-29 12:25:55] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 218/346 variables, 128/188 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 113/301 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 229/530 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 9 (OVERLAPS) 1/347 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 11 (OVERLAPS) 0/347 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 531 constraints, problems are : Problem set: 0 solved, 229 unsolved in 13143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 114/114 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 56/56 constraints]
After SMT, in 31911ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 31913ms
Starting structural reductions in LTL mode, iteration 1 : 128/141 places, 230/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32081 ms. Remains : 128/141 places, 230/247 transitions.
[2024-05-29 12:26:08] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:26:08] [INFO ] Flatten gal took : 9 ms
[2024-05-29 12:26:08] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-29 12:26:08] [INFO ] Flatten gal took : 9 ms
[2024-05-29 12:26:08] [INFO ] Flatten gal took : 15 ms
[2024-05-29 12:26:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17156248434924842158.gal : 3 ms
[2024-05-29 12:26:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10717573391012696666.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/CTLFireability17156248434924842158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10717573391012696666.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25811,0.123655,8816,2,2158,5,13383,6,0,725,9075,0


Converting to forward existential form...Done !
original formula: ((EF(((((p1==1) + AF((p80==1))) + AF(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(p174==0)))) * ((AF(((p43==1)&&(p183==1))) * ((E((p...1062
=> equivalent forward existential formula: ([(FwdU(((Init * !(((EX(((E((EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))) + !(((p181==1)&&(p1...2600
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t13, t15, t16, t17, t18, t19, t21, t23, t24, t26, t27, t31,...365
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,1,3.15652,112296,1,0,625,533796,528,417,5612,405163,964
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 224
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 123 transition count 223
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 114 transition count 211
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 114 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 114 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 111 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 111 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 108 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 108 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 108 transition count 203
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 106 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 106 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 104 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 104 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 104 transition count 197
Applied a total of 79 rules in 13 ms. Remains 104 /141 variables (removed 37) and now considering 197/247 (removed 50) transitions.
[2024-05-29 12:26:11] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
// Phase 1: matrix 191 rows 104 cols
[2024-05-29 12:26:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:26:11] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 12:26:11] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-05-29 12:26:11] [INFO ] Invariant cache hit.
[2024-05-29 12:26:11] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-29 12:26:11] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-29 12:26:11] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-05-29 12:26:11] [INFO ] Invariant cache hit.
[2024-05-29 12:26:11] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:26:12] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:26:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 2 ms to minimize.
[2024-05-29 12:26:14] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:26:15] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 12:26:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:26:15] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:26:15] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 12:26:15] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:26:15] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 190/294 variables, 104/155 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 106/261 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 12:26:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:26:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:26:19] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 12:26:19] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 12:26:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:26:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:26:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 1/295 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-29 12:26:24] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/295 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 16 (OVERLAPS) 0/295 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 270 constraints, problems are : Problem set: 0 solved, 196 unsolved in 18805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 190/294 variables, 104/163 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 106/269 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 196/465 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 1/295 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 466 constraints, problems are : Problem set: 0 solved, 196 unsolved in 12177 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 57/57 constraints]
After SMT, in 31114ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 31116ms
Starting structural reductions in LTL mode, iteration 1 : 104/141 places, 197/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31277 ms. Remains : 104/141 places, 197/247 transitions.
[2024-05-29 12:26:42] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:26:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:26:42] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-29 12:26:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:26:42] [INFO ] Flatten gal took : 7 ms
[2024-05-29 12:26:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16882277831028008151.gal : 2 ms
[2024-05-29 12:26:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10361976169333001531.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/CTLFireability16882277831028008151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10361976169333001531.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25559,0.08608,6792,2,1248,5,9625,6,0,605,6129,0


Converting to forward existential form...Done !
original formula: !(E(EF(!(((p164==1)&&(p183==1)))) U !(((!(((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p30==1))&&((p66==1)&&(p102==1)...337
=> equivalent forward existential formula: [(EY((FwdU(Init,E(TRUE U !(((p164==1)&&(p183==1))))) * !((!(((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(...382
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...345
(forward)formula 0,0,0.687102,31880,1,0,304,92538,418,126,4813,74483,444
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 124 transition count 225
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 124 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 124 transition count 223
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 45 place count 115 transition count 211
Iterating global reduction 1 with 9 rules applied. Total rules applied 54 place count 115 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 115 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 112 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 112 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 109 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 109 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 109 transition count 203
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 107 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 107 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 105 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 105 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 105 transition count 197
Applied a total of 78 rules in 21 ms. Remains 105 /141 variables (removed 36) and now considering 197/247 (removed 50) transitions.
[2024-05-29 12:26:43] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
// Phase 1: matrix 189 rows 105 cols
[2024-05-29 12:26:43] [INFO ] Computed 4 invariants in 2 ms
[2024-05-29 12:26:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 12:26:43] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-05-29 12:26:43] [INFO ] Invariant cache hit.
[2024-05-29 12:26:43] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:26:43] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/141 places, 197/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 90 transition count 183
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 90 transition count 183
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 90 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 85 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 85 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 80 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 80 transition count 168
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 75 transition count 163
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 75 transition count 163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 70 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 70 transition count 158
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 66 transition count 154
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 66 transition count 154
Applied a total of 81 rules in 6 ms. Remains 66 /104 variables (removed 38) and now considering 154/197 (removed 43) transitions.
[2024-05-29 12:26:43] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
// Phase 1: matrix 146 rows 66 cols
[2024-05-29 12:26:43] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 12:26:43] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 12:26:43] [INFO ] Flow matrix only has 146 transitions (discarded 8 similar events)
[2024-05-29 12:26:43] [INFO ] Invariant cache hit.
[2024-05-29 12:26:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:26:43] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/141 places, 154/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 296 ms. Remains : 66/141 places, 154/247 transitions.
[2024-05-29 12:26:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:43] [INFO ] Input system was already deterministic with 154 transitions.
[2024-05-29 12:26:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15711861770646999660.gal : 2 ms
[2024-05-29 12:26:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13118006135091968067.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/CTLFireability15711861770646999660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13118006135091968067.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24744,0.054218,5412,2,787,5,5901,6,0,406,3932,0


Converting to forward existential form...Done !
original formula: (AX(EX(E(EX((p152==1)) U ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))))) + EX(A(!(((((EX(((((p30==1)&&(p66==1))&&((p102==1...332
=> equivalent forward existential formula: [(EY((Init * !(EX(!((E(!(EX((p116==1))) U (!(!(((((EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1)...449
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t48, t51, t52, t54, t57, t58, t5...328
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.789451,34128,1,0,408,147805,337,226,3779,131571,541
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 224
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 123 transition count 223
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 114 transition count 211
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 114 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 114 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 112 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 112 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 110 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 110 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 110 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 109 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 109 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 108 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 108 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 108 transition count 202
Applied a total of 70 rules in 7 ms. Remains 108 /141 variables (removed 33) and now considering 202/247 (removed 45) transitions.
[2024-05-29 12:26:44] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
// Phase 1: matrix 196 rows 108 cols
[2024-05-29 12:26:44] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 12:26:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 12:26:44] [INFO ] Flow matrix only has 196 transitions (discarded 6 similar events)
[2024-05-29 12:26:44] [INFO ] Invariant cache hit.
[2024-05-29 12:26:44] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-29 12:26:44] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 215 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/141 places, 202/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 93 transition count 188
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 93 transition count 188
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 93 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 88 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 88 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 83 transition count 173
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 83 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 78 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 78 transition count 168
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 73 transition count 163
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 73 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 69 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 69 transition count 159
Applied a total of 81 rules in 6 ms. Remains 69 /107 variables (removed 38) and now considering 159/202 (removed 43) transitions.
[2024-05-29 12:26:44] [INFO ] Flow matrix only has 153 transitions (discarded 6 similar events)
// Phase 1: matrix 153 rows 69 cols
[2024-05-29 12:26:44] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:26:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 12:26:44] [INFO ] Flow matrix only has 153 transitions (discarded 6 similar events)
[2024-05-29 12:26:44] [INFO ] Invariant cache hit.
[2024-05-29 12:26:44] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:26:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 69/141 places, 159/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 324 ms. Remains : 69/141 places, 159/247 transitions.
[2024-05-29 12:26:44] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:44] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:44] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-29 12:26:44] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:44] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3381677364626036230.gal : 1 ms
[2024-05-29 12:26:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8003776063006583593.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/CTLFireability3381677364626036230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8003776063006583593.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24749,0.051985,5168,2,723,5,4883,6,0,429,3753,0


Converting to forward existential form...Done !
original formula: E(AX(AX((p57!=1))) U !((EF(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))) + (EF(EX((p24==1))) * A(AG(((((p30==1)&&(p66==1))...264
=> equivalent forward existential formula: [((FwdU(Init,!(EX(!(!(EX(!((p57!=1)))))))) * !((E(TRUE U EX((p24==1))) * !((E(!(EG(((((p30==1)&&(p66==1))&&((p10...504
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t49, t52, t53, t55, t58,...347
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.797386,36068,1,0,499,164493,352,281,3751,134694,688
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 225
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 123 transition count 223
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 115 transition count 213
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 115 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 115 transition count 212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 112 transition count 209
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 112 transition count 209
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 109 transition count 206
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 109 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 109 transition count 205
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 107 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 107 transition count 203
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 105 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 105 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 105 transition count 199
Applied a total of 78 rules in 7 ms. Remains 105 /141 variables (removed 36) and now considering 199/247 (removed 48) transitions.
[2024-05-29 12:26:45] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
// Phase 1: matrix 192 rows 105 cols
[2024-05-29 12:26:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:26:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 12:26:45] [INFO ] Flow matrix only has 192 transitions (discarded 7 similar events)
[2024-05-29 12:26:45] [INFO ] Invariant cache hit.
[2024-05-29 12:26:45] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:26:45] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 176 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/141 places, 199/247 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 186
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 186
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 91 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 86 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 86 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 81 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 81 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 76 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 76 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 71 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 71 transition count 161
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 67 transition count 157
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 67 transition count 157
Applied a total of 79 rules in 5 ms. Remains 67 /104 variables (removed 37) and now considering 157/199 (removed 42) transitions.
[2024-05-29 12:26:45] [INFO ] Flow matrix only has 150 transitions (discarded 7 similar events)
// Phase 1: matrix 150 rows 67 cols
[2024-05-29 12:26:45] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:26:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 12:26:45] [INFO ] Flow matrix only has 150 transitions (discarded 7 similar events)
[2024-05-29 12:26:45] [INFO ] Invariant cache hit.
[2024-05-29 12:26:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:26:45] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 67/141 places, 157/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 275 ms. Remains : 67/141 places, 157/247 transitions.
[2024-05-29 12:26:45] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:45] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:45] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-29 12:26:45] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:26:45] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4399068416344025284.gal : 1 ms
[2024-05-29 12:26:45] [INFO ] Time to serialize properties into /tmp/CTLFireability12075901369384111527.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/CTLFireability4399068416344025284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12075901369384111527.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,25512,0.038726,4840,2,686,5,4127,6,0,418,2767,0


Converting to forward existential form...Done !
original formula: AF(EX(EG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||((p174==0)||(p145==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||((p174==0)||(p145==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t26, t27, t31, t32, t33,...366
(forward)formula 0,1,0.668524,29632,1,0,481,138752,332,216,3376,115052,615
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 139 transition count 175
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 84 rules applied. Total rules applied 156 place count 68 transition count 162
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 162 place count 65 transition count 159
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 162 place count 65 transition count 145
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 190 place count 51 transition count 145
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 210 place count 31 transition count 120
Iterating global reduction 3 with 20 rules applied. Total rules applied 230 place count 31 transition count 120
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 240 place count 31 transition count 110
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 243 place count 28 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 246 place count 28 transition count 104
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 274 place count 28 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 27 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 277 place count 27 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 282 place count 27 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 292 place count 22 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 21 transition count 63
Applied a total of 293 rules in 35 ms. Remains 21 /141 variables (removed 120) and now considering 63/247 (removed 184) transitions.
[2024-05-29 12:26:46] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
// Phase 1: matrix 57 rows 21 cols
[2024-05-29 12:26:46] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:26:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 12:26:46] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
[2024-05-29 12:26:46] [INFO ] Invariant cache hit.
[2024-05-29 12:26:46] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-29 12:26:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-29 12:26:46] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-29 12:26:46] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
[2024-05-29 12:26:46] [INFO ] Invariant cache hit.
[2024-05-29 12:26:46] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 5/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:26:46] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:26:46] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 12:26:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:26:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:26:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 56/77 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 35/76 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:26:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 1/78 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:26:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 80 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 5/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:26:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 12:26:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:26:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 12:26:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:26:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:26:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 56/77 variables, 21/50 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 144 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 28/28 constraints]
After SMT, in 3280ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3281ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/141 places, 63/247 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3373 ms. Remains : 21/141 places, 63/247 transitions.
[2024-05-29 12:26:50] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:26:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:26:50] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 12:26:50] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:26:50] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:26:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2031327638519938212.gal : 2 ms
[2024-05-29 12:26:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4278363749488611738.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/ReachabilityCardinality2031327638519938212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4278363749488611738.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 : 141/141 places, 247/247 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 223
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 122 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 113 transition count 209
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 113 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 113 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 110 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 110 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 107 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 107 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 107 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 105 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 105 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 103 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 103 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 103 transition count 195
Applied a total of 82 rules in 8 ms. Remains 103 /141 variables (removed 38) and now considering 195/247 (removed 52) transitions.
[2024-05-29 12:26:50] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-05-29 12:26:50] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 12:26:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 12:26:50] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-29 12:26:50] [INFO ] Invariant cache hit.
[2024-05-29 12:26:50] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:26:50] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 191 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/141 places, 195/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 7 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-05-29 12:26:50] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-05-29 12:26:50] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:26:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 12:26:50] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-05-29 12:26:50] [INFO ] Invariant cache hit.
[2024-05-29 12:26:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:26:50] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/141 places, 152/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 289 ms. Remains : 64/141 places, 152/247 transitions.
[2024-05-29 12:26:50] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:50] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:50] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-29 12:26:50] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:50] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:26:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16149639927489782984.gal : 1 ms
[2024-05-29 12:26:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3051876393375714503.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/CTLFireability16149639927489782984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3051876393375714503.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,24744,0.052268,5136,2,677,5,4669,6,0,402,3603,0


Converting to forward existential form...Done !
original formula: AF(((!(E(E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1)) U ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))) U !...486
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(E(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1)) U ((((p30==1)&&(p66==1))&&((p10...549
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t47, t50, t51, t53, t56,...336
(forward)formula 0,0,0.738717,30372,1,0,420,138329,334,165,3698,103300,582
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 223
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 122 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 113 transition count 209
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 113 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 113 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 110 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 110 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 107 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 107 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 107 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 105 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 105 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 103 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 103 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 103 transition count 195
Applied a total of 82 rules in 6 ms. Remains 103 /141 variables (removed 38) and now considering 195/247 (removed 52) transitions.
[2024-05-29 12:26:51] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-05-29 12:26:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:26:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 12:26:51] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-29 12:26:51] [INFO ] Invariant cache hit.
[2024-05-29 12:26:51] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:26:51] [INFO ] Implicit Places using invariants and state equation in 148 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 194 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/141 places, 195/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 4 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-05-29 12:26:51] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-05-29 12:26:51] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:26:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 12:26:51] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-05-29 12:26:51] [INFO ] Invariant cache hit.
[2024-05-29 12:26:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:26:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/141 places, 152/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 281 ms. Remains : 64/141 places, 152/247 transitions.
[2024-05-29 12:26:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:51] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-29 12:26:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14741110726539248341.gal : 2 ms
[2024-05-29 12:26:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7813641719686151921.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/CTLFireability14741110726539248341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7813641719686151921.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,24744,0.057396,5140,2,677,5,4669,6,0,402,3603,0


Converting to forward existential form...Done !
original formula: EX(AG(EF(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(p174==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U ((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(p174==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t47, t50, t51, t53, t56,...336
(forward)formula 0,1,0.2005,11476,1,0,213,28670,318,79,3451,20971,308
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 223
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 122 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 113 transition count 209
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 113 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 113 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 110 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 110 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 107 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 107 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 107 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 105 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 105 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 103 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 103 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 103 transition count 195
Applied a total of 82 rules in 13 ms. Remains 103 /141 variables (removed 38) and now considering 195/247 (removed 52) transitions.
[2024-05-29 12:26:51] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-05-29 12:26:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:26:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 12:26:51] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-29 12:26:51] [INFO ] Invariant cache hit.
[2024-05-29 12:26:51] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:26:51] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/141 places, 195/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 6 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-05-29 12:26:51] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-05-29 12:26:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:26:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 12:26:51] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-05-29 12:26:51] [INFO ] Invariant cache hit.
[2024-05-29 12:26:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:26:51] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/141 places, 152/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 280 ms. Remains : 64/141 places, 152/247 transitions.
[2024-05-29 12:26:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:51] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-29 12:26:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:26:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16436177313684565587.gal : 1 ms
[2024-05-29 12:26:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12348487011519380181.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/CTLFireability16436177313684565587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12348487011519380181.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24744,0.048763,5136,2,677,5,4669,6,0,402,3603,0


Converting to forward existential form...Done !
original formula: EX(EF(AG(((((p30!=1)||(p66!=1))||((p102!=1)||(p138!=1)))||(p174!=1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(((((p30!=1)||(p66!=1))||((p102!=1)||(p138!=1)))||(p174!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t47, t50, t51, t53, t56,...336
(forward)formula 0,1,0.284704,15168,1,0,225,44831,320,89,3532,33153,333
FORMULA StigmergyCommit-PT-04a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 224
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 123 transition count 222
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 115 transition count 211
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 115 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 115 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 113 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 113 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 111 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 111 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 109 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 109 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 107 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 107 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 107 transition count 200
Applied a total of 73 rules in 5 ms. Remains 107 /141 variables (removed 34) and now considering 200/247 (removed 47) transitions.
[2024-05-29 12:26:52] [INFO ] Flow matrix only has 194 transitions (discarded 6 similar events)
// Phase 1: matrix 194 rows 107 cols
[2024-05-29 12:26:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:26:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 12:26:52] [INFO ] Flow matrix only has 194 transitions (discarded 6 similar events)
[2024-05-29 12:26:52] [INFO ] Invariant cache hit.
[2024-05-29 12:26:52] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-05-29 12:26:52] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-29 12:26:52] [INFO ] Flow matrix only has 194 transitions (discarded 6 similar events)
[2024-05-29 12:26:52] [INFO ] Invariant cache hit.
[2024-05-29 12:26:52] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:26:53] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:26:54] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-29 12:26:55] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:26:56] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 12:26:56] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:26:56] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:26:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 12:26:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:26:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:26:58] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:26:58] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 193/300 variables, 107/166 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 107/273 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:27:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:27:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 14 (OVERLAPS) 1/301 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 16 (OVERLAPS) 0/301 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 276 constraints, problems are : Problem set: 0 solved, 199 unsolved in 16426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:27:09] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-29 12:27:09] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:27:10] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:27:11] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-29 12:27:12] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 193/300 variables, 107/173 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 107/280 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 199/479 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (OVERLAPS) 1/301 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 14 (OVERLAPS) 0/301 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 480 constraints, problems are : Problem set: 0 solved, 199 unsolved in 16182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 64/64 constraints]
After SMT, in 32739ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 32742ms
Starting structural reductions in LTL mode, iteration 1 : 107/141 places, 200/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32909 ms. Remains : 107/141 places, 200/247 transitions.
[2024-05-29 12:27:25] [INFO ] Flatten gal took : 9 ms
[2024-05-29 12:27:25] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:27:25] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-29 12:27:25] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:27:25] [INFO ] Flatten gal took : 5 ms
[2024-05-29 12:27:25] [INFO ] Time to serialize gal into /tmp/CTLFireability2281883962488787475.gal : 1 ms
[2024-05-29 12:27:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5946924314837775637.ctl : 2 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/CTLFireability2281883962488787475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5946924314837775637.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25562,0.126618,8664,2,2384,5,14237,6,0,620,9819,0


Converting to forward existential form...Done !
original formula: AG(EF((EF(((AX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))) + ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))...378
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(TRUE U ((!(EX(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1)))))...450
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t23, t24, t25, ...345
(forward)formula 0,0,1.71677,60904,1,0,309,213175,418,150,4917,141035,464
FORMULA StigmergyCommit-PT-04a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 122 transition count 223
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 122 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 122 transition count 221
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 113 transition count 209
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 113 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 113 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 110 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 110 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 107 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 107 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 107 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 105 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 105 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 103 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 103 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 103 transition count 195
Applied a total of 82 rules in 11 ms. Remains 103 /141 variables (removed 38) and now considering 195/247 (removed 52) transitions.
[2024-05-29 12:27:26] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 103 cols
[2024-05-29 12:27:26] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 12:27:26] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 12:27:26] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-29 12:27:26] [INFO ] Invariant cache hit.
[2024-05-29 12:27:27] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:27:27] [INFO ] Implicit Places using invariants and state equation in 131 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 175 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/141 places, 195/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 181
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 83 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 83 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 78 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 78 transition count 166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 73 transition count 161
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 73 transition count 161
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 68 transition count 156
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 68 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 64 transition count 152
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 64 transition count 152
Applied a total of 81 rules in 5 ms. Remains 64 /102 variables (removed 38) and now considering 152/195 (removed 43) transitions.
[2024-05-29 12:27:27] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
// Phase 1: matrix 146 rows 64 cols
[2024-05-29 12:27:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:27:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 12:27:27] [INFO ] Flow matrix only has 146 transitions (discarded 6 similar events)
[2024-05-29 12:27:27] [INFO ] Invariant cache hit.
[2024-05-29 12:27:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:27:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 64/141 places, 152/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 271 ms. Remains : 64/141 places, 152/247 transitions.
[2024-05-29 12:27:27] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:27:27] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:27:27] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-29 12:27:27] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:27:27] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:27:27] [INFO ] Time to serialize gal into /tmp/CTLFireability423566733536450882.gal : 1 ms
[2024-05-29 12:27:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11476233683838155260.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/CTLFireability423566733536450882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11476233683838155260.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,24744,0.049236,5140,2,677,5,4669,6,0,402,3603,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(p174==0)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(p174==0)))] != FALSE
Hit Full ! (commute/partial/dont) 69/0/83
(forward)formula 0,1,0.28764,14380,1,0,41,40388,19,2,2677,34469,41
FORMULA StigmergyCommit-PT-04a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 123 transition count 225
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 123 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 123 transition count 223
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 114 transition count 211
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 114 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 114 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 111 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 111 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 108 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 108 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 108 transition count 203
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 106 transition count 201
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 106 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 104 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 104 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 104 transition count 197
Applied a total of 80 rules in 6 ms. Remains 104 /141 variables (removed 37) and now considering 197/247 (removed 50) transitions.
[2024-05-29 12:27:27] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
// Phase 1: matrix 191 rows 104 cols
[2024-05-29 12:27:27] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 12:27:27] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 12:27:27] [INFO ] Flow matrix only has 191 transitions (discarded 6 similar events)
[2024-05-29 12:27:27] [INFO ] Invariant cache hit.
[2024-05-29 12:27:27] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-29 12:27:27] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 185 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/141 places, 197/247 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 90 transition count 184
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 90 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 90 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 85 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 85 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 80 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 80 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 75 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 75 transition count 164
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 70 transition count 159
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 70 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 66 transition count 155
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 66 transition count 155
Applied a total of 79 rules in 11 ms. Remains 66 /103 variables (removed 37) and now considering 155/197 (removed 42) transitions.
[2024-05-29 12:27:27] [INFO ] Flow matrix only has 149 transitions (discarded 6 similar events)
// Phase 1: matrix 149 rows 66 cols
[2024-05-29 12:27:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 12:27:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 12:27:27] [INFO ] Flow matrix only has 149 transitions (discarded 6 similar events)
[2024-05-29 12:27:27] [INFO ] Invariant cache hit.
[2024-05-29 12:27:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-29 12:27:27] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 66/141 places, 155/247 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 292 ms. Remains : 66/141 places, 155/247 transitions.
[2024-05-29 12:27:27] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:27:27] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:27:27] [INFO ] Input system was already deterministic with 155 transitions.
[2024-05-29 12:27:27] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:27:27] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:27:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10860158296723465817.gal : 1 ms
[2024-05-29 12:27:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11547377092336122863.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/CTLFireability10860158296723465817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11547377092336122863.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25256,0.056545,5416,2,764,5,6230,6,0,413,4020,0


Converting to forward existential form...Done !
original formula: AG(EX(E((EF(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))) + ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))) U...366
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E((E(TRUE U ((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(p174==1))) + ((((p30==1)&...438
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t10, t11, t13, t15, t16, t18, t20, t21, t23, t25, t26, t28, t29, t30,...366
(forward)formula 0,0,0.349769,16504,1,0,253,55299,329,101,3593,39696,364
FORMULA StigmergyCommit-PT-04a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 141/141 places, 247/247 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 139 transition count 175
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 84 rules applied. Total rules applied 156 place count 68 transition count 162
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 162 place count 65 transition count 159
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 162 place count 65 transition count 145
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 190 place count 51 transition count 145
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 210 place count 31 transition count 120
Iterating global reduction 3 with 20 rules applied. Total rules applied 230 place count 31 transition count 120
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 240 place count 31 transition count 110
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 243 place count 28 transition count 104
Iterating global reduction 4 with 3 rules applied. Total rules applied 246 place count 28 transition count 104
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 274 place count 28 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 27 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 277 place count 27 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 282 place count 27 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 292 place count 22 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 21 transition count 63
Applied a total of 293 rules in 28 ms. Remains 21 /141 variables (removed 120) and now considering 63/247 (removed 184) transitions.
[2024-05-29 12:27:28] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
// Phase 1: matrix 57 rows 21 cols
[2024-05-29 12:27:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 12:27:28] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-29 12:27:28] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
[2024-05-29 12:27:28] [INFO ] Invariant cache hit.
[2024-05-29 12:27:28] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-29 12:27:28] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-29 12:27:28] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-29 12:27:28] [INFO ] Flow matrix only has 57 transitions (discarded 6 similar events)
[2024-05-29 12:27:28] [INFO ] Invariant cache hit.
[2024-05-29 12:27:28] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 5/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 3 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:27:28] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:27:29] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:27:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 56/77 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 35/76 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:27:29] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:27:29] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 1/78 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:27:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 80 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 5/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-29 12:27:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 12:27:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 12:27:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 12:27:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:27:30] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:27:30] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 56/77 variables, 21/50 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 35/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 144 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 28/28 constraints]
After SMT, in 3194ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3195ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/141 places, 63/247 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3272 ms. Remains : 21/141 places, 63/247 transitions.
[2024-05-29 12:27:31] [INFO ] Flatten gal took : 8 ms
[2024-05-29 12:27:31] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:27:31] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-04a-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 12:27:31] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:27:31] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:27:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16776442910501193179.gal : 1 ms
[2024-05-29 12:27:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality381844579186895040.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/ReachabilityCardinality16776442910501193179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality381844579186895040.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 12:27:31] [INFO ] Flatten gal took : 6 ms
[2024-05-29 12:27:31] [INFO ] Flatten gal took : 5 ms
Total runtime 152211 ms.

BK_STOP 1716985651579

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

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

Sequence of Actions to be Executed by the VM

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

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

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