About the Execution of ITS-Tools for StigmergyCommit-PT-03a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 462193.00 | 0.00 | 0.00 | FFFFTTFTFTTFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490500017.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyCommit-PT-03a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490500017
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 98K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2023-15
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1749050994245
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 15:29:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 15:29:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 15:29:57] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-06-04 15:29:57] [INFO ] Transformed 148 places.
[2025-06-04 15:29:57] [INFO ] Transformed 332 transitions.
[2025-06-04 15:29:57] [INFO ] Found NUPN structural information;
[2025-06-04 15:29:57] [INFO ] Parsed PT model containing 148 places and 332 transitions and 1538 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 222/222 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 134 transition count 207
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 134 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 134 transition count 205
Applied a total of 30 rules in 61 ms. Remains 134 /148 variables (removed 14) and now considering 205/222 (removed 17) transitions.
[2025-06-04 15:29:57] [INFO ] Flow matrix only has 194 transitions (discarded 11 similar events)
// Phase 1: matrix 194 rows 134 cols
[2025-06-04 15:29:57] [INFO ] Computed 5 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:29:57] [INFO ] Implicit Places using invariants in 606 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 679 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/148 places, 205/222 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 201
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 200
Applied a total of 10 rules in 28 ms. Remains 128 /133 variables (removed 5) and now considering 200/205 (removed 5) transitions.
[2025-06-04 15:29:58] [INFO ] Flow matrix only has 189 transitions (discarded 11 similar events)
// Phase 1: matrix 189 rows 128 cols
[2025-06-04 15:29:58] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:29:58] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-04 15:29:58] [INFO ] Flow matrix only has 189 transitions (discarded 11 similar events)
[2025-06-04 15:29:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:29:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:29:58] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/148 places, 200/222 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1312 ms. Remains : 128/148 places, 200/222 transitions.
Support contains 72 out of 128 places after structural reductions.
[2025-06-04 15:29:59] [INFO ] Flatten gal took : 80 ms
[2025-06-04 15:29:59] [INFO ] Flatten gal took : 32 ms
[2025-06-04 15:29:59] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 58 out of 128 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (78 resets) in 2682 ms. (14 steps per ms) remains 3/40 properties
BEST_FIRST walk for 40003 steps (14 resets) in 479 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 377 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
[2025-06-04 15:30:00] [INFO ] Flow matrix only has 189 transitions (discarded 11 similar events)
[2025-06-04 15:30:00] [INFO ] Invariant cache hit.
[2025-06-04 15:30:00] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 116/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 188/316 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 32/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/317 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 165 constraints, problems are : Problem set: 0 solved, 3 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 116/128 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:01] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 22 ms to minimize.
Problem AtomicPropp27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:01] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:01] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Int declared 128/317 variables, and 8 constraints, problems are : Problem set: 3 solved, 0 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/128 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 898ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2025-06-04 15:30:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-04 15:30:01] [INFO ] Flatten gal took : 15 ms
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 15:30:01] [INFO ] Flatten gal took : 16 ms
[2025-06-04 15:30:01] [INFO ] Input system was already deterministic with 200 transitions.
Computed a total of 21 stabilizing places and 21 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 99 transition count 167
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 99 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 99 transition count 162
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 79 place count 83 transition count 143
Iterating global reduction 1 with 16 rules applied. Total rules applied 95 place count 83 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 99 place count 83 transition count 139
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 110 place count 72 transition count 128
Iterating global reduction 2 with 11 rules applied. Total rules applied 121 place count 72 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 128 place count 65 transition count 121
Iterating global reduction 2 with 7 rules applied. Total rules applied 135 place count 65 transition count 121
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 58 transition count 114
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 58 transition count 114
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 154 place count 53 transition count 109
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 53 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 163 place count 53 transition count 105
Applied a total of 163 rules in 50 ms. Remains 53 /128 variables (removed 75) and now considering 105/200 (removed 95) transitions.
[2025-06-04 15:30:01] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
// Phase 1: matrix 100 rows 53 cols
[2025-06-04 15:30:01] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 15:30:01] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
[2025-06-04 15:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:01] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:30:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2025-06-04 15:30:01] [INFO ] Flow matrix only has 100 transitions (discarded 5 similar events)
[2025-06-04 15:30:01] [INFO ] Invariant cache hit.
[2025-06-04 15:30:01] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:02] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:03] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:04] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:05] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 99/152 variables, 53/75 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 32/107 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:07] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 1/153 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/153 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 109 constraints, problems are : Problem set: 0 solved, 104 unsolved in 11476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:14] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:14] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 99/152 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 32/110 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 104/214 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:18] [INFO ] Deduced a trap along path composed of 6 places in 64 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 1/153 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 216 constraints, problems are : Problem set: 0 solved, 104 unsolved in 25966 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37618ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 37625ms
Starting structural reductions in LTL mode, iteration 1 : 53/128 places, 105/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37866 ms. Remains : 53/128 places, 105/200 transitions.
[2025-06-04 15:30:39] [INFO ] Flatten gal took : 8 ms
[2025-06-04 15:30:39] [INFO ] Flatten gal took : 7 ms
[2025-06-04 15:30:39] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-04 15:30:39] [INFO ] Flatten gal took : 7 ms
[2025-06-04 15:30:39] [INFO ] Flatten gal took : 7 ms
[2025-06-04 15:30:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality14857369604160920343.gal : 4 ms
[2025-06-04 15:30:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10453501728365666674.ctl : 4 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14857369604160920343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10453501728365666674.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3721,0.070621,4380,2,318,5,1727,6,0,312,1243,0
Converting to forward existential form...Done !
original formula: EX(EX(EF(AG((p12==0)))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * !(E(TRUE U !((p12==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t38, t41, t42, t44, t47, t48, t51, t52,...302
(forward)formula 0,1,0.258621,7964,1,0,170,19294,227,75,2240,15468,236
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 100 transition count 168
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 100 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 100 transition count 163
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 84 transition count 144
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 84 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 84 transition count 139
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 108 place count 74 transition count 129
Iterating global reduction 2 with 10 rules applied. Total rules applied 118 place count 74 transition count 129
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 68 transition count 123
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 68 transition count 123
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 136 place count 62 transition count 117
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 62 transition count 117
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 146 place count 58 transition count 113
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 153 place count 58 transition count 110
Applied a total of 153 rules in 15 ms. Remains 58 /128 variables (removed 70) and now considering 110/200 (removed 90) transitions.
[2025-06-04 15:30:39] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
// Phase 1: matrix 105 rows 58 cols
[2025-06-04 15:30:39] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-04 15:30:39] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
[2025-06-04 15:30:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:30:39] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:30:39] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-06-04 15:30:39] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
[2025-06-04 15:30:39] [INFO ] Invariant cache hit.
[2025-06-04 15:30:39] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:41] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:42] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:42] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:42] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:42] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:42] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:42] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:42] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:43] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 104/162 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:45] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 116 constraints, problems are : Problem set: 0 solved, 109 unsolved in 13081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 104/162 variables, 58/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 32/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 109/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:30:57] [INFO ] Deduced a trap along path composed of 6 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:06] [INFO ] Deduced a trap along path composed of 6 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:06] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 1/163 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:21] [INFO ] Deduced a trap along path composed of 6 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:21] [INFO ] Deduced a trap along path composed of 6 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/163 variables, and 230 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 43174ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 43176ms
Starting structural reductions in LTL mode, iteration 1 : 58/128 places, 110/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43339 ms. Remains : 58/128 places, 110/200 transitions.
[2025-06-04 15:31:23] [INFO ] Flatten gal took : 11 ms
[2025-06-04 15:31:23] [INFO ] Flatten gal took : 10 ms
[2025-06-04 15:31:23] [INFO ] Input system was already deterministic with 110 transitions.
[2025-06-04 15:31:23] [INFO ] Flatten gal took : 10 ms
[2025-06-04 15:31:23] [INFO ] Flatten gal took : 11 ms
[2025-06-04 15:31:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality14939581447008917427.gal : 5 ms
[2025-06-04 15:31:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5107656461803585755.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14939581447008917427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5107656461803585755.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3726,0.047333,4568,2,334,5,1789,6,0,337,1311,0
Converting to forward existential form...Done !
original formula: (EX(TRUE) * EF((p130==1)))
=> equivalent forward existential formula: [(FwdU((Init * EX(TRUE)),TRUE) * (p130==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t41, t42, t48, t50, t53, t54, t56, t59,...305
(forward)formula 0,1,0.188277,7000,1,0,161,13472,231,73,2286,11625,223
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 100 transition count 169
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 100 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 100 transition count 164
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 84 transition count 146
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 84 transition count 146
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 84 transition count 141
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 108 place count 74 transition count 131
Iterating global reduction 2 with 10 rules applied. Total rules applied 118 place count 74 transition count 131
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 125 place count 67 transition count 124
Iterating global reduction 2 with 7 rules applied. Total rules applied 132 place count 67 transition count 124
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 61 transition count 118
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 61 transition count 118
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 149 place count 56 transition count 113
Iterating global reduction 2 with 5 rules applied. Total rules applied 154 place count 56 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 158 place count 56 transition count 109
Applied a total of 158 rules in 25 ms. Remains 56 /128 variables (removed 72) and now considering 109/200 (removed 91) transitions.
[2025-06-04 15:31:23] [INFO ] Flow matrix only has 103 transitions (discarded 6 similar events)
// Phase 1: matrix 103 rows 56 cols
[2025-06-04 15:31:23] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:31:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-04 15:31:23] [INFO ] Flow matrix only has 103 transitions (discarded 6 similar events)
[2025-06-04 15:31:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:31:23] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:31:23] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2025-06-04 15:31:23] [INFO ] Flow matrix only has 103 transitions (discarded 6 similar events)
[2025-06-04 15:31:23] [INFO ] Invariant cache hit.
[2025-06-04 15:31:23] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:24] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:24] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:24] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:24] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:24] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:27] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:27] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:28] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 102/158 variables, 56/86 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 32/118 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 1/159 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/159 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 119 constraints, problems are : Problem set: 0 solved, 108 unsolved in 14783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 102/158 variables, 56/86 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 32/118 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 108/226 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:43] [INFO ] Deduced a trap along path composed of 6 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:45] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:31:51] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 1/159 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 159/159 variables, and 230 constraints, problems are : Problem set: 0 solved, 108 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44856ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 44861ms
Starting structural reductions in LTL mode, iteration 1 : 56/128 places, 109/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45080 ms. Remains : 56/128 places, 109/200 transitions.
[2025-06-04 15:32:08] [INFO ] Flatten gal took : 11 ms
[2025-06-04 15:32:08] [INFO ] Flatten gal took : 10 ms
[2025-06-04 15:32:08] [INFO ] Input system was already deterministic with 109 transitions.
[2025-06-04 15:32:08] [INFO ] Flatten gal took : 10 ms
[2025-06-04 15:32:08] [INFO ] Flatten gal took : 9 ms
[2025-06-04 15:32:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality3105732744559574792.gal : 3 ms
[2025-06-04 15:32:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality9225095625029437579.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3105732744559574792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9225095625029437579.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3913,0.029808,4592,2,373,5,2022,6,0,327,1444,0
Converting to forward existential form...Done !
original formula: AF((AX((p77==1)) * (AG(EF(AG((p72==1)))) + EX(EX(AX((p138==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!((p77==1)))) * (!(E(TRUE U !(E(TRUE U !(E(TRUE U !((p72==1)))))))) + EX(EX(!(EX(!((p138==1))...172
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t14, t16, t17, t19, t21, t22, t24, t25, t26, t34, t42, t45,...324
(forward)formula 0,0,0.207391,10224,1,0,214,26805,241,82,2392,26158,271
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 101 transition count 169
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 101 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 101 transition count 166
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 73 place count 85 transition count 147
Iterating global reduction 1 with 16 rules applied. Total rules applied 89 place count 85 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 85 transition count 142
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 104 place count 75 transition count 132
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 75 transition count 132
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 121 place count 68 transition count 125
Iterating global reduction 2 with 7 rules applied. Total rules applied 128 place count 68 transition count 125
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 61 transition count 118
Iterating global reduction 2 with 7 rules applied. Total rules applied 142 place count 61 transition count 118
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 147 place count 56 transition count 113
Iterating global reduction 2 with 5 rules applied. Total rules applied 152 place count 56 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 155 place count 56 transition count 110
Applied a total of 155 rules in 9 ms. Remains 56 /128 variables (removed 72) and now considering 110/200 (removed 90) transitions.
[2025-06-04 15:32:08] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
// Phase 1: matrix 105 rows 56 cols
[2025-06-04 15:32:08] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:32:08] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-04 15:32:08] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
[2025-06-04 15:32:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:32:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:32:08] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-06-04 15:32:08] [INFO ] Flow matrix only has 105 transitions (discarded 5 similar events)
[2025-06-04 15:32:08] [INFO ] Invariant cache hit.
[2025-06-04 15:32:08] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:10] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:11] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:11] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:11] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:11] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:11] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:11] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:12] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:12] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:12] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 104/160 variables, 56/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/161 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/161 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 115 constraints, problems are : Problem set: 0 solved, 109 unsolved in 12169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 104/160 variables, 56/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 109/223 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:25] [INFO ] Deduced a trap along path composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/161 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:47] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/161 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 161/161 variables, and 226 constraints, problems are : Problem set: 0 solved, 109 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42241ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 42244ms
Starting structural reductions in LTL mode, iteration 1 : 56/128 places, 110/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42390 ms. Remains : 56/128 places, 110/200 transitions.
[2025-06-04 15:32:51] [INFO ] Flatten gal took : 8 ms
[2025-06-04 15:32:51] [INFO ] Flatten gal took : 8 ms
[2025-06-04 15:32:51] [INFO ] Input system was already deterministic with 110 transitions.
[2025-06-04 15:32:51] [INFO ] Flatten gal took : 8 ms
[2025-06-04 15:32:51] [INFO ] Flatten gal took : 8 ms
[2025-06-04 15:32:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5239446360434045831.gal : 2 ms
[2025-06-04 15:32:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14473790507819728173.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5239446360434045831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14473790507819728173.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3724,0.047285,4612,2,335,5,1821,6,0,329,1313,0
Converting to forward existential form...Done !
original formula: AG(AF((EX((p50==0)) + ((AF((p40==0)) * (p19==1)) * ((p76==0)||(p129==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EX((p50==0)) + ((!(EG(!((p40==0)))) * (p19==1)) * ((p76==0)||(p129==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t30, t40, t44, t45, t47, t51, t52, t54,...315
(forward)formula 0,1,0.255494,8964,1,0,199,20512,244,80,2201,20039,264
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 127 transition count 124
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 92 rules applied. Total rules applied 167 place count 52 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 169 place count 50 transition count 107
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 169 place count 50 transition count 99
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 42 transition count 99
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 191 place count 36 transition count 90
Iterating global reduction 3 with 6 rules applied. Total rules applied 197 place count 36 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 198 place count 36 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 34 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 34 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 208 place count 34 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 218 place count 29 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 222 place count 29 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 244 place count 29 transition count 48
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 252 place count 25 transition count 44
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 256 place count 21 transition count 40
Applied a total of 256 rules in 62 ms. Remains 21 /128 variables (removed 107) and now considering 40/200 (removed 160) transitions.
[2025-06-04 15:32:51] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
// Phase 1: matrix 35 rows 21 cols
[2025-06-04 15:32:51] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:32:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-04 15:32:51] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
[2025-06-04 15:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:32:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:32:51] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:32:51] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-04 15:32:51] [INFO ] Flow matrix only has 35 transitions (discarded 5 similar events)
[2025-06-04 15:32:51] [INFO ] Invariant cache hit.
[2025-06-04 15:32:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 4/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:51] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:51] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 34/55 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 37 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1937 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 4/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:53] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:53] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 34/55 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 69 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3318ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 3319ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/128 places, 40/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3487 ms. Remains : 21/128 places, 40/200 transitions.
[2025-06-04 15:32:54] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:32:55] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:32:55] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-04 15:32:55] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:32:55] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:32:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality1934103545948366730.gal : 0 ms
[2025-06-04 15:32:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality11066784913710235340.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1934103545948366730.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11066784913710235340.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,46,0.013546,3960,2,74,5,432,6,0,119,285,0
Converting to forward existential form...Done !
original formula: A(AF((p133==1)) U AG((!(AF((p113==1))) * EG(((p19!=0)||(p123!=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((!(!(EG(!((p113==1))))) * EG(((p19!=0)||(p123!=1))))))))))) * !(E(!(!(E(TRUE U !((...324
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t20, t26, t28, t29, t30, t31, t32, t33, Intersection wit...236
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.045032,4984,1,0,107,2906,119,58,842,2866,152
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 101 transition count 169
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 101 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 101 transition count 164
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 72 place count 88 transition count 148
Iterating global reduction 1 with 13 rules applied. Total rules applied 85 place count 88 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 89 place count 88 transition count 144
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 80 transition count 136
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 80 transition count 136
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 76 transition count 132
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 76 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 74 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 74 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 73 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 73 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 73 transition count 128
Applied a total of 120 rules in 16 ms. Remains 73 /128 variables (removed 55) and now considering 128/200 (removed 72) transitions.
[2025-06-04 15:32:55] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
// Phase 1: matrix 122 rows 73 cols
[2025-06-04 15:32:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:32:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-04 15:32:55] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
[2025-06-04 15:32:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:32:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:32:55] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2025-06-04 15:32:55] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
[2025-06-04 15:32:55] [INFO ] Invariant cache hit.
[2025-06-04 15:32:55] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:56] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:56] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:56] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:56] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:56] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:56] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:57] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:32:58] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 121/194 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 32/129 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 1/195 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 130 constraints, problems are : Problem set: 0 solved, 127 unsolved in 14330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 121/194 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/129 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 127/256 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:14] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:16] [INFO ] Deduced a trap along path composed of 6 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:18] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 1/195 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:35] [INFO ] Deduced a trap along path composed of 6 places in 39 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/195 variables, and 261 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44392ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 44394ms
Starting structural reductions in LTL mode, iteration 1 : 73/128 places, 128/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44600 ms. Remains : 73/128 places, 128/200 transitions.
[2025-06-04 15:33:39] [INFO ] Flatten gal took : 10 ms
[2025-06-04 15:33:39] [INFO ] Flatten gal took : 12 ms
[2025-06-04 15:33:39] [INFO ] Input system was already deterministic with 128 transitions.
[2025-06-04 15:33:39] [INFO ] Flatten gal took : 9 ms
[2025-06-04 15:33:39] [INFO ] Flatten gal took : 9 ms
[2025-06-04 15:33:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality4666885901226137647.gal : 2 ms
[2025-06-04 15:33:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality3445156391098354678.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4666885901226137647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3445156391098354678.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3740,0.037721,4632,2,461,5,2537,6,0,412,1751,0
Converting to forward existential form...Done !
original formula: (AG(AX((p89==1))) + (EF(AG((p76==0))) * !(E(AF((p80==1)) U (((p12==0)||(p94==1)) * (!(((p134==0)||(p26==1))) + AG(((p124==0)||(p99==1))))...160
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(!(EX(!((p89==1))))))))) * !(E(TRUE U !(E(TRUE U !((p76==0)))))))] = FALSE * ([((FwdU((...434
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t8, t9, t11, t13, t14, t16, t18, t19, t28, t48, t53, t55, t58, t61, t62, t65, t66...316
(forward)formula 0,1,0.329276,14232,1,0,252,50096,290,124,2784,42750,368
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 127 transition count 120
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 97 rules applied. Total rules applied 176 place count 48 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 47 transition count 102
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 177 place count 47 transition count 94
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 193 place count 39 transition count 94
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 200 place count 32 transition count 83
Iterating global reduction 3 with 7 rules applied. Total rules applied 207 place count 32 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 32 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 211 place count 29 transition count 76
Iterating global reduction 4 with 3 rules applied. Total rules applied 214 place count 29 transition count 76
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 220 place count 29 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 230 place count 24 transition count 65
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 235 place count 24 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 257 place count 24 transition count 38
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 265 place count 20 transition count 34
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 268 place count 17 transition count 31
Applied a total of 268 rules in 31 ms. Remains 17 /128 variables (removed 111) and now considering 31/200 (removed 169) transitions.
[2025-06-04 15:33:40] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 17 cols
[2025-06-04 15:33:40] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:33:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-04 15:33:40] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2025-06-04 15:33:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:33:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-04 15:33:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:33:40] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-04 15:33:40] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2025-06-04 15:33:40] [INFO ] Invariant cache hit.
[2025-06-04 15:33:40] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:40] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:41] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:41] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:41] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 26/43 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 40 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 26/43 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 30/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 70 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3130ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 3130ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/128 places, 31/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3253 ms. Remains : 17/128 places, 31/200 transitions.
[2025-06-04 15:33:43] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:33:43] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:33:43] [INFO ] Input system was already deterministic with 31 transitions.
[2025-06-04 15:33:43] [INFO ] Flatten gal took : 2 ms
[2025-06-04 15:33:43] [INFO ] Flatten gal took : 2 ms
[2025-06-04 15:33:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality13351378805365984397.gal : 1 ms
[2025-06-04 15:33:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality13538735684664541642.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13351378805365984397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13538735684664541642.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,42,0.007462,3916,2,65,5,402,6,0,94,282,0
Converting to forward existential form...Done !
original formula: EG(AF(((p70==0)||(p111==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p70==0)||(p111==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t19, t20, t21, t22, t23, Intersection with reachable at each...217
(forward)formula 0,1,0.017401,4172,1,0,63,1545,82,26,689,1364,74
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 99 transition count 167
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 99 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 99 transition count 162
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 80 place count 82 transition count 142
Iterating global reduction 1 with 17 rules applied. Total rules applied 97 place count 82 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 102 place count 82 transition count 137
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 113 place count 71 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 124 place count 71 transition count 126
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 131 place count 64 transition count 119
Iterating global reduction 2 with 7 rules applied. Total rules applied 138 place count 64 transition count 119
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 58 transition count 113
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 58 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 154 place count 54 transition count 109
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 54 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 161 place count 54 transition count 106
Applied a total of 161 rules in 14 ms. Remains 54 /128 variables (removed 74) and now considering 106/200 (removed 94) transitions.
[2025-06-04 15:33:43] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
// Phase 1: matrix 101 rows 54 cols
[2025-06-04 15:33:43] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:33:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-04 15:33:43] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2025-06-04 15:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:33:43] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:33:43] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-06-04 15:33:43] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2025-06-04 15:33:43] [INFO ] Invariant cache hit.
[2025-06-04 15:33:43] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:44] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:44] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:44] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:44] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:44] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:44] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:44] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:44] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:46] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:46] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:46] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:47] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:33:47] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 100/154 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 1/155 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 112 constraints, problems are : Problem set: 0 solved, 105 unsolved in 12043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 100/154 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 105/216 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:00] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:01] [INFO ] Deduced a trap along path composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/155 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 219 constraints, problems are : Problem set: 0 solved, 105 unsolved in 28417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40500ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 40501ms
Starting structural reductions in LTL mode, iteration 1 : 54/128 places, 106/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40670 ms. Remains : 54/128 places, 106/200 transitions.
[2025-06-04 15:34:24] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:34:24] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:34:24] [INFO ] Input system was already deterministic with 106 transitions.
[2025-06-04 15:34:24] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:34:24] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:34:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8544067161309947331.gal : 2 ms
[2025-06-04 15:34:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9403888832714658991.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8544067161309947331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9403888832714658991.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3722,0.029374,4556,2,335,5,1783,6,0,317,1278,0
Converting to forward existential form...Done !
original formula: AG(AX((p98==0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p98==0)))] = FALSE
(forward)formula 0,0,0.035966,4684,1,0,8,1906,9,2,539,1278,2
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 127 transition count 129
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 84 rules applied. Total rules applied 154 place count 57 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 55 transition count 115
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 156 place count 55 transition count 107
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 172 place count 47 transition count 107
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 179 place count 40 transition count 96
Iterating global reduction 3 with 7 rules applied. Total rules applied 186 place count 40 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 187 place count 40 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 190 place count 37 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 193 place count 37 transition count 89
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 207 place count 37 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 217 place count 32 transition count 70
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 222 place count 32 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 238 place count 32 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 246 place count 28 transition count 45
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 249 place count 28 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 28 transition count 44
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 254 place count 24 transition count 40
Applied a total of 254 rules in 44 ms. Remains 24 /128 variables (removed 104) and now considering 40/200 (removed 160) transitions.
[2025-06-04 15:34:24] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
// Phase 1: matrix 36 rows 24 cols
[2025-06-04 15:34:24] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:34:24] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-04 15:34:24] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2025-06-04 15:34:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:34:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 15:34:24] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:34:24] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-04 15:34:24] [INFO ] Flow matrix only has 36 transitions (discarded 4 similar events)
[2025-06-04 15:34:24] [INFO ] Invariant cache hit.
[2025-06-04 15:34:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 4/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:24] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:25] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:25] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:25] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 35/59 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 42 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 4/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 35/59 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 30/71 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/60 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 72 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3000ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 3000ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/128 places, 40/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3140 ms. Remains : 24/128 places, 40/200 transitions.
[2025-06-04 15:34:27] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:34:27] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:34:27] [INFO ] Input system was already deterministic with 40 transitions.
[2025-06-04 15:34:27] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:34:27] [INFO ] Flatten gal took : 3 ms
[2025-06-04 15:34:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality1078544268336347678.gal : 0 ms
[2025-06-04 15:34:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality8222275674962626889.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1078544268336347678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8222275674962626889.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,35,0.008733,3956,2,78,5,494,6,0,132,319,0
Converting to forward existential form...Done !
original formula: A(((p26==0)||(p22==1)) U !(((E(EG((p55==0)) U (p88==1)) * EG(EF((p121==1)))) + AG(((p21==0)||(p55==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(((E(EG((p55==0)) U (p88==1)) * EG(E(TRUE U (p121==1)))) + !(E(TRUE U !(((p21==0)||(p55==1))))...415
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t21, t25, t26, t29, t30, t31, t32, t33, Intersection with reacha...228
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.040121,5236,1,0,137,5499,117,102,897,5443,204
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 127 transition count 120
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 174 place count 48 transition count 104
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 174 place count 48 transition count 95
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 192 place count 39 transition count 95
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 199 place count 32 transition count 84
Iterating global reduction 2 with 7 rules applied. Total rules applied 206 place count 32 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 207 place count 32 transition count 83
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 210 place count 29 transition count 77
Iterating global reduction 3 with 3 rules applied. Total rules applied 213 place count 29 transition count 77
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 227 place count 29 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 237 place count 24 transition count 58
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 242 place count 24 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 258 place count 24 transition count 37
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 266 place count 20 transition count 33
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 269 place count 17 transition count 30
Applied a total of 269 rules in 26 ms. Remains 17 /128 variables (removed 111) and now considering 30/200 (removed 170) transitions.
[2025-06-04 15:34:27] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 17 cols
[2025-06-04 15:34:27] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:34:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-04 15:34:27] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2025-06-04 15:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:34:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 15:34:27] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 15:34:27] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2025-06-04 15:34:27] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2025-06-04 15:34:27] [INFO ] Invariant cache hit.
[2025-06-04 15:34:27] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:28] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:28] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 25/42 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 41 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1823 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 25/42 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1/43 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 0/43 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 71 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1315 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3146ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 3147ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/128 places, 30/200 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3244 ms. Remains : 17/128 places, 30/200 transitions.
[2025-06-04 15:34:30] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:34:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 15:34:30] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-04 15:34:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 15:34:30] [INFO ] Flatten gal took : 2 ms
[2025-06-04 15:34:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality4100854599309831012.gal : 1 ms
[2025-06-04 15:34:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality17412606845844967803.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4100854599309831012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17412606845844967803.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,28,0.014173,3984,2,66,5,345,6,0,93,254,0
Converting to forward existential form...Done !
original formula: A(AF((p140==0)) U (p88==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p88==1))))) * !(E(!((p88==1)) U (!(!(EG(!((p140==0))))) * !((p88==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t20, t21, t22, t23, t24, t25, Intersection with reachable at...222
(forward)formula 0,0,0.03083,4368,1,0,72,1553,84,33,612,1443,83
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 101 transition count 169
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 101 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 101 transition count 165
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 75 place count 84 transition count 145
Iterating global reduction 1 with 17 rules applied. Total rules applied 92 place count 84 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 97 place count 84 transition count 140
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 74 transition count 130
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 74 transition count 130
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 69 transition count 125
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 69 transition count 125
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 64 transition count 120
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 64 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 141 place count 60 transition count 116
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 60 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 149 place count 60 transition count 112
Applied a total of 149 rules in 13 ms. Remains 60 /128 variables (removed 68) and now considering 112/200 (removed 88) transitions.
[2025-06-04 15:34:30] [INFO ] Flow matrix only has 106 transitions (discarded 6 similar events)
// Phase 1: matrix 106 rows 60 cols
[2025-06-04 15:34:30] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:34:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-04 15:34:30] [INFO ] Flow matrix only has 106 transitions (discarded 6 similar events)
[2025-06-04 15:34:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:34:30] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:34:30] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2025-06-04 15:34:30] [INFO ] Flow matrix only has 106 transitions (discarded 6 similar events)
[2025-06-04 15:34:30] [INFO ] Invariant cache hit.
[2025-06-04 15:34:30] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:32] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:33] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:33] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:33] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:33] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:33] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:33] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 105/165 variables, 60/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 32/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 1/166 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 118 constraints, problems are : Problem set: 0 solved, 111 unsolved in 8927 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 105/165 variables, 60/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 32/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 111/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:42] [INFO ] Deduced a trap along path composed of 6 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:43] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 1/166 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:55] [INFO ] Deduced a trap along path composed of 6 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:55] [INFO ] Deduced a trap along path composed of 6 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:34:55] [INFO ] Deduced a trap along path composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/166 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 0/166 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 234 constraints, problems are : Problem set: 0 solved, 111 unsolved in 28437 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 37412ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 37413ms
Starting structural reductions in LTL mode, iteration 1 : 60/128 places, 112/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37608 ms. Remains : 60/128 places, 112/200 transitions.
[2025-06-04 15:35:08] [INFO ] Flatten gal took : 14 ms
[2025-06-04 15:35:08] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:35:08] [INFO ] Input system was already deterministic with 112 transitions.
[2025-06-04 15:35:08] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:35:08] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:35:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality1205148519224982744.gal : 2 ms
[2025-06-04 15:35:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7778025191897355955.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1205148519224982744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7778025191897355955.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3727,0.047206,4504,2,350,5,1687,6,0,344,1159,0
Converting to forward existential form...Done !
original formula: AF(AG((AX(((p107==1)||((p116==0)&&(p10==1)))) + (p141==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(EX(!(((p107==1)||((p116==0)&&(p10==1)))))) + (p141==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t34, t42, t44, t46, t50, t53, t54, t58, t61...300
(forward)formula 0,1,0.370518,10648,1,0,262,28883,246,131,2378,31172,312
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 103 transition count 171
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 103 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 103 transition count 167
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 66 place count 91 transition count 153
Iterating global reduction 1 with 12 rules applied. Total rules applied 78 place count 91 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 91 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 85 transition count 143
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 85 transition count 143
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 83 transition count 141
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 83 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 81 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 81 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 80 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 80 transition count 138
Applied a total of 104 rules in 14 ms. Remains 80 /128 variables (removed 48) and now considering 138/200 (removed 62) transitions.
[2025-06-04 15:35:08] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
// Phase 1: matrix 133 rows 80 cols
[2025-06-04 15:35:08] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:35:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-04 15:35:08] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
[2025-06-04 15:35:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:35:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:35:08] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2025-06-04 15:35:08] [INFO ] Flow matrix only has 133 transitions (discarded 5 similar events)
[2025-06-04 15:35:08] [INFO ] Invariant cache hit.
[2025-06-04 15:35:08] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:10] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:10] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:10] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:10] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:10] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:11] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:12] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:12] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:12] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:12] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:12] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:13] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:14] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:14] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 132/212 variables, 80/106 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 32/138 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (OVERLAPS) 1/213 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:21] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:22] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:24] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 142 constraints, problems are : Problem set: 0 solved, 137 unsolved in 26081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 132/212 variables, 80/109 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 137/278 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:35:43] [INFO ] Deduced a trap along path composed of 6 places in 84 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 1/213 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 213/213 variables, and 280 constraints, problems are : Problem set: 0 solved, 137 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56140ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 56141ms
Starting structural reductions in LTL mode, iteration 1 : 80/128 places, 138/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56355 ms. Remains : 80/128 places, 138/200 transitions.
[2025-06-04 15:36:05] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:36:05] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:36:05] [INFO ] Input system was already deterministic with 138 transitions.
[2025-06-04 15:36:05] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:36:05] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:36:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality259193420909496155.gal : 1 ms
[2025-06-04 15:36:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality16258483443596928686.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality259193420909496155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16258483443596928686.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3874,0.03904,4652,2,467,5,2496,6,0,453,1797,0
Converting to forward existential form...Done !
original formula: (EF(!(A(((((p63==1)&&(p131==0))||(p94==0))||((p68==1)||(p23==1))) U AF((p54==1))))) * AG((EX((p69==0)) + AF((((p10==0)&&(p38==1))||((p14=...175
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(!((E(!(!(EG(!((p54==1))))) U (!(((((p63==1)&&(p131==0))||(p94==0))||((p68==1)||(p23==1)))...329
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t13, t15, t16, t18, t20, t21, t23, t26, t27, t33, t35, t42,...346
Hit Full ! (commute/partial/dont) 129/6/9
(forward)formula 0,0,0.390431,12076,1,0,235,32302,297,101,2984,31437,309
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 100 transition count 168
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 100 transition count 168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 100 transition count 163
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 84 transition count 144
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 84 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 97 place count 84 transition count 140
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 108 place count 73 transition count 129
Iterating global reduction 2 with 11 rules applied. Total rules applied 119 place count 73 transition count 129
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 126 place count 66 transition count 122
Iterating global reduction 2 with 7 rules applied. Total rules applied 133 place count 66 transition count 122
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 60 transition count 116
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 60 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 56 transition count 112
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 56 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 157 place count 56 transition count 108
Applied a total of 157 rules in 12 ms. Remains 56 /128 variables (removed 72) and now considering 108/200 (removed 92) transitions.
[2025-06-04 15:36:05] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
// Phase 1: matrix 103 rows 56 cols
[2025-06-04 15:36:05] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:36:05] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-04 15:36:05] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2025-06-04 15:36:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:36:05] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:36:05] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2025-06-04 15:36:05] [INFO ] Flow matrix only has 103 transitions (discarded 5 similar events)
[2025-06-04 15:36:05] [INFO ] Invariant cache hit.
[2025-06-04 15:36:05] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:06] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:06] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:07] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/158 variables, 56/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 32/113 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 114 constraints, problems are : Problem set: 0 solved, 107 unsolved in 11452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:18] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 102/158 variables, 56/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 107/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:22] [INFO ] Deduced a trap along path composed of 6 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:24] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 1/159 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:40] [INFO ] Deduced a trap along path composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/159 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 159/159 variables, and 225 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41499ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 41499ms
Starting structural reductions in LTL mode, iteration 1 : 56/128 places, 108/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41714 ms. Remains : 56/128 places, 108/200 transitions.
[2025-06-04 15:36:47] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:36:47] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:36:47] [INFO ] Input system was already deterministic with 108 transitions.
[2025-06-04 15:36:47] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:36:47] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:36:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality8476902830077958580.gal : 2 ms
[2025-06-04 15:36:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality5310517377837018115.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8476902830077958580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5310517377837018115.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3724,0.052269,4588,2,341,5,1815,6,0,327,1287,0
Converting to forward existential form...Done !
original formula: A(EX(TRUE) U !(((p81==0)||(p143==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(((p81==0)||(p143==1))))))) * !(E(!(!(((p81==0)||(p143==1)))) U (!(EX(TRUE)) * !(!(((p81==0)||...181
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t39, t40, t43, t46, t49, t50, t52, t55,...304
(forward)formula 0,0,0.250684,8812,1,0,194,20005,232,76,2185,19611,257
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 200/200 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 101 transition count 170
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 101 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 59 place count 101 transition count 165
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 71 place count 89 transition count 151
Iterating global reduction 1 with 12 rules applied. Total rules applied 83 place count 89 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 88 place count 89 transition count 146
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 83 transition count 140
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 83 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 80 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 80 transition count 137
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 77 transition count 134
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 77 transition count 134
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 74 transition count 131
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 74 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 74 transition count 130
Applied a total of 119 rules in 12 ms. Remains 74 /128 variables (removed 54) and now considering 130/200 (removed 70) transitions.
[2025-06-04 15:36:47] [INFO ] Flow matrix only has 124 transitions (discarded 6 similar events)
// Phase 1: matrix 124 rows 74 cols
[2025-06-04 15:36:47] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:36:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-04 15:36:47] [INFO ] Flow matrix only has 124 transitions (discarded 6 similar events)
[2025-06-04 15:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 15:36:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-04 15:36:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2025-06-04 15:36:47] [INFO ] Flow matrix only has 124 transitions (discarded 6 similar events)
[2025-06-04 15:36:47] [INFO ] Invariant cache hit.
[2025-06-04 15:36:47] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:49] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:50] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:51] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:51] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 123/197 variables, 74/99 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 32/131 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:36:55] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 133 constraints, problems are : Problem set: 0 solved, 129 unsolved in 18521 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 123/197 variables, 74/100 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 32/132 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 129/261 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:37:14] [INFO ] Deduced a trap along path composed of 9 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:37:16] [INFO ] Deduced a trap along path composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:37:32] [INFO ] Deduced a trap along path composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/198 variables, and 265 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 48580ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 48581ms
Starting structural reductions in LTL mode, iteration 1 : 74/128 places, 130/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48792 ms. Remains : 74/128 places, 130/200 transitions.
[2025-06-04 15:37:36] [INFO ] Flatten gal took : 5 ms
[2025-06-04 15:37:36] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:37:36] [INFO ] Input system was already deterministic with 130 transitions.
[2025-06-04 15:37:36] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:37:36] [INFO ] Flatten gal took : 4 ms
[2025-06-04 15:37:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality5404417795506425287.gal : 1 ms
[2025-06-04 15:37:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality13039108427763115856.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5404417795506425287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13039108427763115856.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3931,0.03911,4692,2,452,5,2425,6,0,420,1653,0
Converting to forward existential form...Done !
original formula: (AG(EF(((EX((p90==0)) * (AX(((p59==0)||(p71==1))) + !(E((p89==1) U (p115==0))))) * ((p68==0)&&(p23==1))))) * AX((p113==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((EX((p90==0)) * (!(EX(!(((p59==0)||(p71==1))))) + !(E((p89==1) U (p115==0))))) ...229
(forward)formula 0,0,0.042909,4948,1,0,9,2425,9,2,557,1653,2
FORMULA StigmergyCommit-PT-03a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-04 15:37:36] [INFO ] Flatten gal took : 6 ms
[2025-06-04 15:37:36] [INFO ] Flatten gal took : 6 ms
Total runtime 459768 ms.
BK_STOP 1749051456438
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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-03a"
export BK_EXAMINATION="CTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-03a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490500017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03a.tgz
mv StigmergyCommit-PT-03a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;