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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 17:53 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 50K 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-02a-CTLFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-02a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716983299193

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-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 11:48:20] [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 11:48:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:48:20] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-29 11:48:20] [INFO ] Transformed 112 places.
[2024-05-29 11:48:20] [INFO ] Transformed 204 transitions.
[2024-05-29 11:48:20] [INFO ] Found NUPN structural information;
[2024-05-29 11:48:20] [INFO ] Parsed PT model containing 112 places and 204 transitions and 693 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 8 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 159/159 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 98 transition count 144
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 98 transition count 144
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 95 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 95 transition count 140
Applied a total of 34 rules in 29 ms. Remains 95 /112 variables (removed 17) and now considering 140/159 (removed 19) transitions.
[2024-05-29 11:48:20] [INFO ] Flow matrix only has 133 transitions (discarded 7 similar events)
// Phase 1: matrix 133 rows 95 cols
[2024-05-29 11:48:20] [INFO ] Computed 3 invariants in 8 ms
[2024-05-29 11:48:20] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-29 11:48:20] [INFO ] Flow matrix only has 133 transitions (discarded 7 similar events)
[2024-05-29 11:48:20] [INFO ] Invariant cache hit.
[2024-05-29 11:48:20] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-29 11:48:20] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2024-05-29 11:48:20] [INFO ] Flow matrix only has 133 transitions (discarded 7 similar events)
[2024-05-29 11:48:20] [INFO ] Invariant cache hit.
[2024-05-29 11:48:20] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-29 11:48:21] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 10 ms to minimize.
[2024-05-29 11:48:21] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-05-29 11:48:21] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:48:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:48:21] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 33 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-29 11:48:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-29 11:48:23] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:23] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-29 11:48:23] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 132/227 variables, 95/115 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 52/167 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (OVERLAPS) 1/228 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (OVERLAPS) 0/228 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 168 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6552 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-29 11:48:28] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 132/227 variables, 95/116 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 52/168 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 139/307 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 1/228 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 308 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4166 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 18/18 constraints]
After SMT, in 10798ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 10815ms
Starting structural reductions in LTL mode, iteration 1 : 95/112 places, 140/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11200 ms. Remains : 95/112 places, 140/159 transitions.
Support contains 33 out of 95 places after structural reductions.
[2024-05-29 11:48:31] [INFO ] Flatten gal took : 28 ms
[2024-05-29 11:48:31] [INFO ] Flatten gal took : 18 ms
[2024-05-29 11:48:31] [INFO ] Input system was already deterministic with 140 transitions.
RANDOM walk for 8350 steps (37 resets) in 375 ms. (22 steps per ms) remains 0/30 properties
[2024-05-29 11:48:32] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:48:32] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:48:32] [INFO ] Input system was already deterministic with 140 transitions.
Computed a total of 21 stabilizing places and 20 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 95/95 places, 140/140 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 93 transition count 87
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 63 rules applied. Total rules applied 116 place count 41 transition count 76
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 39 transition count 74
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 120 place count 39 transition count 68
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 132 place count 33 transition count 68
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 145 place count 20 transition count 53
Iterating global reduction 3 with 13 rules applied. Total rules applied 158 place count 20 transition count 53
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 166 place count 20 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 166 place count 20 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 19 transition count 44
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 170 place count 17 transition count 40
Iterating global reduction 4 with 2 rules applied. Total rules applied 172 place count 17 transition count 40
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 178 place count 17 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 181 place count 17 transition count 31
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 187 place count 14 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 13 transition count 27
Applied a total of 188 rules in 22 ms. Remains 13 /95 variables (removed 82) and now considering 27/140 (removed 113) transitions.
[2024-05-29 11:48:32] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 13 cols
[2024-05-29 11:48:32] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 11:48:32] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 11:48:32] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-05-29 11:48:32] [INFO ] Invariant cache hit.
[2024-05-29 11:48:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 11:48:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-29 11:48:32] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-29 11:48:32] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-05-29 11:48:32] [INFO ] Invariant cache hit.
[2024-05-29 11:48:32] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 4 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 4 ms to minimize.
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-29 11:48:32] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 22/35 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/36 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 36 constraints, problems are : Problem set: 0 solved, 24 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 22/35 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/36 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/36 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 60 constraints, problems are : Problem set: 0 solved, 24 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 12/12 constraints]
After SMT, in 808ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 809ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/95 places, 27/140 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 892 ms. Remains : 13/95 places, 27/140 transitions.
[2024-05-29 11:48:33] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:48:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:48:33] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-29 11:48:33] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:48:33] [INFO ] Flatten gal took : 1 ms
[2024-05-29 11:48:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6273143368944392593.gal : 2 ms
[2024-05-29 11:48:33] [INFO ] Time to serialize properties into /tmp/CTLFireability6076388725760291067.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/CTLFireability6273143368944392593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6076388725760291067.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,21,0.011069,3324,2,58,5,248,6,0,76,179,0


Converting to forward existential form...Done !
original formula: EG(AF((((p30==1)&&(p66==1))&&(p102==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((p30==1)&&(p66==1))&&(p102==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t9, t14, t16, t18, Intersection with reachable at each step ...211
(forward)formula 0,1,0.017413,3672,1,0,82,1436,76,36,490,1462,90
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 95/95 places, 140/140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 95 transition count 138
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 93 transition count 135
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 92 transition count 134
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 9 place count 92 transition count 114
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 49 place count 72 transition count 114
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 59 place count 62 transition count 102
Iterating global reduction 3 with 10 rules applied. Total rules applied 69 place count 62 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 62 transition count 100
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 76 place count 57 transition count 93
Iterating global reduction 4 with 5 rules applied. Total rules applied 81 place count 57 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 83 place count 57 transition count 91
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 86 place count 54 transition count 88
Iterating global reduction 5 with 3 rules applied. Total rules applied 89 place count 54 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 93 place count 54 transition count 84
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 99 place count 51 transition count 81
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 101 place count 49 transition count 79
Iterating global reduction 6 with 2 rules applied. Total rules applied 103 place count 49 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 107 place count 49 transition count 75
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 108 place count 48 transition count 74
Iterating global reduction 7 with 1 rules applied. Total rules applied 109 place count 48 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 110 place count 48 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 113 place count 48 transition count 70
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 119 place count 45 transition count 67
Applied a total of 119 rules in 33 ms. Remains 45 /95 variables (removed 50) and now considering 67/140 (removed 73) transitions.
[2024-05-29 11:48:33] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
// Phase 1: matrix 63 rows 45 cols
[2024-05-29 11:48:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 11:48:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 11:48:33] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-05-29 11:48:33] [INFO ] Invariant cache hit.
[2024-05-29 11:48:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-29 11:48:33] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-29 11:48:33] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-29 11:48:33] [INFO ] Flow matrix only has 63 transitions (discarded 4 similar events)
[2024-05-29 11:48:33] [INFO ] Invariant cache hit.
[2024-05-29 11:48:33] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:48:33] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 62/107 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 34/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 94 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 62/107 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 34/93 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 66/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/108 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 160 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 12/12 constraints]
After SMT, in 2676ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2677ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/95 places, 67/140 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2813 ms. Remains : 45/95 places, 67/140 transitions.
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 11 ms
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:48:36] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 8 ms
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14262449756352190099.gal : 1 ms
[2024-05-29 11:48:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17247222241494321826.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/CTLFireability14262449756352190099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17247222241494321826.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,148,0.011543,3796,2,251,5,1190,6,0,241,933,0


Converting to forward existential form...Done !
original formula: EF(!(A((!(((!(((p30==1)&&(p66==1))&&(p102==1)))&&((p85==1)||((p25==1)&&(p111==1))))) + !(AG((p104==1)))) U !((E((p21==1) U (p29==1)) + A(...205
=> equivalent forward existential formula: (([(FwdU((FwdU(FwdU(Init,TRUE),!(!((E((p21==1) U (p29==1)) + !((E(!((p22==1)) U (!((((p30==1)&&(p66==1))&&(p102=...889
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t19, t41, t42, t44, t46, t47, t48, t52, t56, Intersection with r...233
(forward)formula 0,0,0.060989,6752,1,0,140,11509,179,73,1530,10361,206
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 140/140 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 81 transition count 124
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 81 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 81 transition count 121
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 73 transition count 111
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 73 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 73 transition count 108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 70 transition count 105
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 70 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 67 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 67 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 64 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 64 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 64 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 63 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 63 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 63 transition count 95
Applied a total of 73 rules in 13 ms. Remains 63 /95 variables (removed 32) and now considering 95/140 (removed 45) transitions.
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 63 cols
[2024-05-29 11:48:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-05-29 11:48:36] [INFO ] Invariant cache hit.
[2024-05-29 11:48:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/95 places, 95/140 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 54 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 54 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 54 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 51 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 51 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 48 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 45 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 45 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 42 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 42 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 40 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 40 transition count 70
Applied a total of 47 rules in 7 ms. Remains 40 /62 variables (removed 22) and now considering 70/95 (removed 25) transitions.
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
// Phase 1: matrix 66 rows 40 cols
[2024-05-29 11:48:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-29 11:48:36] [INFO ] Invariant cache hit.
[2024-05-29 11:48:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 40/95 places, 70/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 40/95 places, 70/140 transitions.
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:36] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:48:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14786918154602002041.gal : 1 ms
[2024-05-29 11:48:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8347947200494449010.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/CTLFireability14786918154602002041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8347947200494449010.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,572,0.010149,3764,2,228,5,1110,6,0,226,841,0


Converting to forward existential form...Done !
original formula: AF(EX(AX((((p30==0)||(p66==0))||(p102==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!((((p30==0)||(p66==0))||(p102==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t29, t32, t33, t35, t38, t39, t41, t44, t45, t64, t66,...259
(forward)formula 0,1,0.048295,5664,1,0,135,10127,158,56,1361,9884,168
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 140/140 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 81 transition count 124
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 81 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 81 transition count 121
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 73 transition count 111
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 73 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 73 transition count 108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 70 transition count 105
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 70 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 67 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 67 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 64 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 64 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 64 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 63 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 63 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 63 transition count 95
Applied a total of 73 rules in 9 ms. Remains 63 /95 variables (removed 32) and now considering 95/140 (removed 45) transitions.
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
// Phase 1: matrix 91 rows 63 cols
[2024-05-29 11:48:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 91 transitions (discarded 4 similar events)
[2024-05-29 11:48:36] [INFO ] Invariant cache hit.
[2024-05-29 11:48:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/95 places, 95/140 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 54 transition count 87
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 54 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 54 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 51 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 51 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 48 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 45 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 45 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 42 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 42 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 40 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 40 transition count 70
Applied a total of 47 rules in 11 ms. Remains 40 /62 variables (removed 22) and now considering 70/95 (removed 25) transitions.
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
// Phase 1: matrix 66 rows 40 cols
[2024-05-29 11:48:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-29 11:48:36] [INFO ] Invariant cache hit.
[2024-05-29 11:48:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 40/95 places, 70/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 40/95 places, 70/140 transitions.
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:36] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10772237284748464446.gal : 1 ms
[2024-05-29 11:48:36] [INFO ] Time to serialize properties into /tmp/CTLFireability1099112447099929000.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/CTLFireability10772237284748464446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1099112447099929000.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,572,0.0103,3784,2,228,5,1110,6,0,226,841,0


Converting to forward existential form...Done !
original formula: AX(AF((p29==1)))
=> equivalent forward existential formula: [FwdG(EY(Init),!((p29==1)))] = FALSE
Hit Full ! (commute/partial/dont) 65/0/5
(forward)formula 0,0,0.043697,5420,1,0,30,8824,20,2,1105,7642,29
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 140/140 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 83 transition count 127
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 83 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 83 transition count 124
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 77 transition count 117
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 77 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 77 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 75 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 75 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 73 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 73 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 71 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 71 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 71 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 70 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 70 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 70 transition count 105
Applied a total of 58 rules in 8 ms. Remains 70 /95 variables (removed 25) and now considering 105/140 (removed 35) transitions.
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
// Phase 1: matrix 100 rows 70 cols
[2024-05-29 11:48:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
[2024-05-29 11:48:36] [INFO ] Invariant cache hit.
[2024-05-29 11:48:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-29 11:48:36] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-29 11:48:36] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
[2024-05-29 11:48:36] [INFO ] Invariant cache hit.
[2024-05-29 11:48:36] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:48:37] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 99/169 variables, 70/86 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 42/128 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 1/170 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-29 11:48:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 130 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 99/169 variables, 70/87 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 42/129 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 104/233 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/170 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 234 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2368 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 15/15 constraints]
After SMT, in 6013ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 6015ms
Starting structural reductions in LTL mode, iteration 1 : 70/95 places, 105/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6116 ms. Remains : 70/95 places, 105/140 transitions.
[2024-05-29 11:48:42] [INFO ] Flatten gal took : 8 ms
[2024-05-29 11:48:42] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:48:42] [INFO ] Input system was already deterministic with 105 transitions.
[2024-05-29 11:48:42] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:48:42] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3848275510178723595.gal : 1 ms
[2024-05-29 11:48:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14681400776761409346.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/CTLFireability3848275510178723595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14681400776761409346.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,651,0.028194,4304,2,513,5,2405,6,0,378,1715,0


Converting to forward existential form...Done !
original formula: (AX(E((p73==1) U ((p59==1)&&(p111==1)))) * AX(EF(((EX(((p4==0)||(p111==0))) + (p101==0)) + (((p30==1)&&(p66==1))&&(p102==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E((p73==1) U ((p59==1)&&(p111==1)))))] = FALSE * [(EY(Init) * !(E(TRUE U ((EX(((p4==0)||(p111==0...221
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t13, t14, t16, t17, t18, t21, t23, t25, t33, t39, t46, t52,...272
(forward)formula 0,0,0.130192,9056,1,0,156,21531,232,89,2324,16607,229
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 140/140 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 82 transition count 126
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 82 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 82 transition count 123
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 75 transition count 115
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 75 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 75 transition count 112
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 72 transition count 109
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 72 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 69 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 69 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 66 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 66 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 66 transition count 101
Applied a total of 66 rules in 12 ms. Remains 66 /95 variables (removed 29) and now considering 101/140 (removed 39) transitions.
[2024-05-29 11:48:43] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
// Phase 1: matrix 96 rows 66 cols
[2024-05-29 11:48:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 11:48:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 11:48:43] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
[2024-05-29 11:48:43] [INFO ] Invariant cache hit.
[2024-05-29 11:48:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-29 11:48:43] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-29 11:48:43] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
[2024-05-29 11:48:43] [INFO ] Invariant cache hit.
[2024-05-29 11:48:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:48:43] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:48:44] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-29 11:48:44] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:44] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 95/161 variables, 66/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 40/126 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-29 11:48:44] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 128 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3625 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-29 11:48:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 95/161 variables, 66/88 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 40/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 100/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 229 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2675 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 20/20 constraints]
After SMT, in 6319ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6320ms
Starting structural reductions in LTL mode, iteration 1 : 66/95 places, 101/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6429 ms. Remains : 66/95 places, 101/140 transitions.
[2024-05-29 11:48:49] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:48:49] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:48:49] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-29 11:48:49] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:48:49] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:48:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4973388863035094425.gal : 1 ms
[2024-05-29 11:48:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15538073958033871015.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/CTLFireability4973388863035094425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15538073958033871015.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,647,0.020046,4260,2,445,5,2177,6,0,358,1563,0


Converting to forward existential form...Done !
original formula: EX((!(E((((p30==1)&&(p66==1))&&(p102==1)) U ((p27==1)&&(p111==1)))) + (p77==0)))
=> equivalent forward existential formula: ([(EY(Init) * !(E((((p30==1)&&(p66==1))&&(p102==1)) U ((p27==1)&&(p111==1)))))] != FALSE + [(EY(Init) * (p77==0)...167
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t13, t14, t16, t17, t18, t21, t23, t25, t33, t40, t44, t50,...270
(forward)formula 0,1,0.083559,7428,1,0,144,14320,216,79,2118,10316,208
FORMULA StigmergyCommit-PT-02a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 140/140 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 89 transition count 134
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 89 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 89 transition count 133
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 84 transition count 128
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 84 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 84 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 82 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 82 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 80 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 80 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 78 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 78 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 78 transition count 120
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 77 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 77 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 77 transition count 118
Applied a total of 40 rules in 14 ms. Remains 77 /95 variables (removed 18) and now considering 118/140 (removed 22) transitions.
[2024-05-29 11:48:49] [INFO ] Flow matrix only has 111 transitions (discarded 7 similar events)
// Phase 1: matrix 111 rows 77 cols
[2024-05-29 11:48:49] [INFO ] Computed 3 invariants in 0 ms
[2024-05-29 11:48:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 11:48:49] [INFO ] Flow matrix only has 111 transitions (discarded 7 similar events)
[2024-05-29 11:48:49] [INFO ] Invariant cache hit.
[2024-05-29 11:48:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 11:48:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-29 11:48:49] [INFO ] Flow matrix only has 111 transitions (discarded 7 similar events)
[2024-05-29 11:48:49] [INFO ] Invariant cache hit.
[2024-05-29 11:48:49] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:48:50] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 110/187 variables, 77/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 43/136 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 1/188 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 137 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3664 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 11:48:53] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 110/187 variables, 77/94 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 117/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 1/188 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 255 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2852 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 14/14 constraints]
After SMT, in 6539ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6541ms
Starting structural reductions in LTL mode, iteration 1 : 77/95 places, 118/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6645 ms. Remains : 77/95 places, 118/140 transitions.
[2024-05-29 11:48:56] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:48:56] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:48:56] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-29 11:48:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:48:56] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17463036260891813636.gal : 1 ms
[2024-05-29 11:48:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15214666389807810472.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/CTLFireability17463036260891813636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15214666389807810472.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,661,0.023709,4348,2,521,5,2465,6,0,415,1709,0


Converting to forward existential form...Done !
original formula: (EF(((p10==1)&&(p111==1))) * A(((((p8==1) + AF((p104!=1))) * ((((((p108==1)||((p97==1)&&(p111==1))) * EX((((p30==1)&&(p66==1))&&(p102==1)...473
=> equivalent forward existential formula: [(((Init * E(TRUE U ((p10==1)&&(p111==1)))) * !(EG(!(!((E(!(((EX((p77==1)) + E((((p30==1)&&(p66==1))&&(p102==1))...2122
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t15, t19, t20, t21, t24, t28, t38, t45, t51, t59, t107...286
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.221114,13060,1,0,221,41948,279,128,2650,37697,339
FORMULA StigmergyCommit-PT-02a-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 140/140 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 84 transition count 128
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 84 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 84 transition count 125
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 79 transition count 119
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 79 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 79 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 77 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 77 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 75 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 75 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 73 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 73 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 73 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 72 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 72 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 72 transition count 108
Applied a total of 53 rules in 3 ms. Remains 72 /95 variables (removed 23) and now considering 108/140 (removed 32) transitions.
[2024-05-29 11:48:56] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
// Phase 1: matrix 103 rows 72 cols
[2024-05-29 11:48:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 11:48:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 11:48:56] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2024-05-29 11:48:56] [INFO ] Invariant cache hit.
[2024-05-29 11:48:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 11:48:56] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-29 11:48:56] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2024-05-29 11:48:56] [INFO ] Invariant cache hit.
[2024-05-29 11:48:56] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 11:48:56] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:48:56] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:48:56] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 11:48:57] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/174 variables, 72/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 43/132 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 11:48:58] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 11:48:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 135 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4842 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 11:49:01] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:49:01] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/174 variables, 72/93 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 43/136 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 107/243 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 244 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 19/19 constraints]
After SMT, in 7714ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 7715ms
Starting structural reductions in LTL mode, iteration 1 : 72/95 places, 108/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7810 ms. Remains : 72/95 places, 108/140 transitions.
[2024-05-29 11:49:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:49:04] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:49:04] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-29 11:49:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:49:04] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:49:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15012604391880804886.gal : 2 ms
[2024-05-29 11:49:04] [INFO ] Time to serialize properties into /tmp/CTLFireability7362683725310840411.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/CTLFireability15012604391880804886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7362683725310840411.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,653,0.027219,4300,2,488,5,2567,6,0,389,2079,0


Converting to forward existential form...Done !
original formula: (AF(AX((p41==0))) * EX(A((((((p30==1)&&(p66==1))&&(p102==1)) + A((p101==1) U ((p50==1)&&(p111==1)))) + ((p71==1)&&(p111==1))) U ((EX(((p8...250
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!((p41==0))))))] = FALSE * [(Init * !(EX(!((E(!(((EX(((p88==1)&&(p111==1))) * (p49!=1)) * (((...625
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t11, t12, t14, t16, t17, t18, t20, t21, t25, t28, t36, t42, t47, ...283
(forward)formula 0,0,0.151362,10108,1,0,187,25232,248,98,2409,23088,268
FORMULA StigmergyCommit-PT-02a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-29 11:49:04] [INFO ] Flatten gal took : 11 ms
[2024-05-29 11:49:04] [INFO ] Flatten gal took : 6 ms
Total runtime 44157 ms.

BK_STOP 1716983344535

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

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

Sequence of Actions to be Executed by the VM

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

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

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