About the Execution of ITS-Tools for StigmergyCommit-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 367.363 | 34526.00 | 53722.00 | 158.50 | TTFTFTFFFTFFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531600089.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-02a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531600089
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-02a-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716983251151
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-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 11:47:32] [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]
[2024-05-29 11:47:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:47:32] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-29 11:47:32] [INFO ] Transformed 112 places.
[2024-05-29 11:47:32] [INFO ] Transformed 204 transitions.
[2024-05-29 11:47:32] [INFO ] Found NUPN structural information;
[2024-05-29 11:47:32] [INFO ] Parsed PT model containing 112 places and 204 transitions and 693 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 159/159 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 151
Applied a total of 14 rules in 21 ms. Remains 105 /112 variables (removed 7) and now considering 151/159 (removed 8) transitions.
[2024-05-29 11:47:32] [INFO ] Flow matrix only has 145 transitions (discarded 6 similar events)
// Phase 1: matrix 145 rows 105 cols
[2024-05-29 11:47:32] [INFO ] Computed 2 invariants in 14 ms
[2024-05-29 11:47:32] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-29 11:47:32] [INFO ] Flow matrix only has 145 transitions (discarded 6 similar events)
[2024-05-29 11:47:32] [INFO ] Invariant cache hit.
[2024-05-29 11:47:32] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-29 11:47:33] [INFO ] Implicit Places using invariants and state equation in 175 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 417 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/112 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 150
Applied a total of 2 rules in 6 ms. Remains 103 /104 variables (removed 1) and now considering 150/151 (removed 1) transitions.
[2024-05-29 11:47:33] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
// Phase 1: matrix 144 rows 103 cols
[2024-05-29 11:47:33] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 11:47:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 11:47:33] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
[2024-05-29 11:47:33] [INFO ] Invariant cache hit.
[2024-05-29 11:47:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:47:33] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/112 places, 150/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 583 ms. Remains : 103/112 places, 150/159 transitions.
Support contains 53 out of 103 places after structural reductions.
[2024-05-29 11:47:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-29 11:47:33] [INFO ] Flatten gal took : 30 ms
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 11:47:33] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:47:33] [INFO ] Input system was already deterministic with 150 transitions.
Support contains 48 out of 103 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (137 resets) in 1174 ms. (34 steps per ms) remains 1/31 properties
BEST_FIRST walk for 40004 steps (24 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-05-29 11:47:33] [INFO ] Flow matrix only has 144 transitions (discarded 6 similar events)
[2024-05-29 11:47:33] [INFO ] Invariant cache hit.
[2024-05-29 11:47:34] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/247 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/247 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 11:47:34] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 6 ms to minimize.
[2024-05-29 11:47:34] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:47:34] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
[2024-05-29 11:47:34] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:47:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Int declared 103/247 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/103 constraints, ReadFeed: 0/16 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 440ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2024-05-29 11:47:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:47:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 11:47:34] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:47:34] [INFO ] Input system was already deterministic with 150 transitions.
Support contains 34 out of 103 places (down from 45) after GAL structural reductions.
Computed a total of 20 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 85 transition count 130
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 85 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 85 transition count 127
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 72 transition count 113
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 72 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 72 transition count 110
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 68 transition count 106
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 68 transition count 106
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 65 transition count 103
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 65 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 62 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 62 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 60 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 60 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 60 transition count 97
Applied a total of 93 rules in 20 ms. Remains 60 /103 variables (removed 43) and now considering 97/150 (removed 53) transitions.
[2024-05-29 11:47:34] [INFO ] Flow matrix only has 92 transitions (discarded 5 similar events)
// Phase 1: matrix 92 rows 60 cols
[2024-05-29 11:47:34] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 11:47:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 11:47:34] [INFO ] Flow matrix only has 92 transitions (discarded 5 similar events)
[2024-05-29 11:47:34] [INFO ] Invariant cache hit.
[2024-05-29 11:47:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:47:34] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-29 11:47:34] [INFO ] Flow matrix only has 92 transitions (discarded 5 similar events)
[2024-05-29 11:47:34] [INFO ] Invariant cache hit.
[2024-05-29 11:47:34] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 11:47:34] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 3 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 2 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-29 11:47:35] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 91/151 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 94 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 91/151 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 96/189 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 190 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 17/17 constraints]
After SMT, in 5772ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5774ms
Starting structural reductions in LTL mode, iteration 1 : 60/103 places, 97/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5882 ms. Remains : 60/103 places, 97/150 transitions.
[2024-05-29 11:47:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:47:40] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:47:40] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-29 11:47:40] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:47:40] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:47:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality7336482268824419874.gal : 2 ms
[2024-05-29 11:47:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5384218672301091292.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7336482268824419874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5384218672301091292.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,637,0.023141,3696,2,362,5,1761,6,0,332,1404,0
Converting to forward existential form...Done !
original formula: EX(((!(A(AX((p0==1)) U EX((p50==1)))) + A(AF((p40==0)) U ((EG((p66==1)) + (p14==1)) + !(((p69==1)&&((p41==0)||(p20==1))))))) + ((p96==0) ...184
=> equivalent forward existential formula: ((([((FwdU(EY(Init),!(EX((p50==1)))) * !(!(EX(!((p0==1)))))) * !(EX((p50==1))))] != FALSE + [FwdG(EY(Init),!(EX(...528
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t12, t14, t16, t17, t19, t20, t32, t33, t39, t43, t44, t49, t50,...304
(forward)formula 0,1,0.108912,8268,1,0,225,21932,210,140,1890,25052,295
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 82 transition count 126
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 82 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 82 transition count 123
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 66 transition count 105
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 66 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 83 place count 66 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 59 transition count 92
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 59 transition count 92
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 54 transition count 87
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 54 transition count 87
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 49 transition count 82
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 49 transition count 82
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 44 transition count 77
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 44 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 129 place count 44 transition count 75
Applied a total of 129 rules in 11 ms. Remains 44 /103 variables (removed 59) and now considering 75/150 (removed 75) transitions.
[2024-05-29 11:47:40] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
// Phase 1: matrix 71 rows 44 cols
[2024-05-29 11:47:40] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 11:47:40] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 11:47:40] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
[2024-05-29 11:47:40] [INFO ] Invariant cache hit.
[2024-05-29 11:47:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:47:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-29 11:47:40] [INFO ] Flow matrix only has 71 transitions (discarded 4 similar events)
[2024-05-29 11:47:40] [INFO ] Invariant cache hit.
[2024-05-29 11:47:40] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 11:47:40] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:47:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:47:40] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:47:40] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-29 11:47:40] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-29 11:47:40] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:47:40] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:47:41] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 11:47:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:47:41] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 3 ms to minimize.
[2024-05-29 11:47:41] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 11:47:41] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 73 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 11:47:42] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-29 11:47:42] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 70/114 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 74/148 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/115 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/115 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 149 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 14/14 constraints]
After SMT, in 3489ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3492ms
Starting structural reductions in LTL mode, iteration 1 : 44/103 places, 75/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3558 ms. Remains : 44/103 places, 75/150 transitions.
[2024-05-29 11:47:44] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:47:44] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:47:44] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-29 11:47:44] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:47:44] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:47:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality2782343630816003119.gal : 1 ms
[2024-05-29 11:47:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality2350115091451604218.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2782343630816003119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2350115091451604218.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,576,0.010941,3800,2,238,5,1143,6,0,247,852,0
Converting to forward existential form...Done !
original formula: E((p89==1) U AF(EX(((p40==0)||(p89==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(p89==1)) * !(EG(!(EX(((p40==0)||(p89==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t31, t34, t35, t38, t40, t43, t44, t46, t49, t50, t69,...264
Hit Full ! (commute/partial/dont) 73/0/2
(forward)formula 0,1,0.051392,5964,1,0,137,10406,175,57,1476,10402,177
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 83 transition count 127
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 83 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 83 transition count 124
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 68 transition count 107
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 68 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 78 place count 68 transition count 102
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 60 transition count 94
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 60 transition count 94
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 54 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 54 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 48 transition count 82
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 48 transition count 82
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 42 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 42 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 42 transition count 73
Applied a total of 133 rules in 10 ms. Remains 42 /103 variables (removed 61) and now considering 73/150 (removed 77) transitions.
[2024-05-29 11:47:44] [INFO ] Flow matrix only has 69 transitions (discarded 4 similar events)
// Phase 1: matrix 69 rows 42 cols
[2024-05-29 11:47:44] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 11:47:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-29 11:47:44] [INFO ] Flow matrix only has 69 transitions (discarded 4 similar events)
[2024-05-29 11:47:44] [INFO ] Invariant cache hit.
[2024-05-29 11:47:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:47:44] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-29 11:47:44] [INFO ] Flow matrix only has 69 transitions (discarded 4 similar events)
[2024-05-29 11:47:44] [INFO ] Invariant cache hit.
[2024-05-29 11:47:44] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:47:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 68/110 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 71 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1657 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 11:47:46] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-29 11:47:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:47:46] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 68/110 variables, 42/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 72/145 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/111 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/111 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 146 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 15/15 constraints]
After SMT, in 3900ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3900ms
Starting structural reductions in LTL mode, iteration 1 : 42/103 places, 73/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3978 ms. Remains : 42/103 places, 73/150 transitions.
[2024-05-29 11:47:48] [INFO ] Flatten gal took : 9 ms
[2024-05-29 11:47:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:47:48] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-29 11:47:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:47:48] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:47:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality15266656771095896243.gal : 4 ms
[2024-05-29 11:47:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10482009969696668958.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15266656771095896243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10482009969696668958.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,574,0.011527,3792,2,225,5,1108,6,0,237,828,0
Converting to forward existential form...Done !
original formula: AX(AG((p83==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p83==0)))] = FALSE
(forward)formula 0,0,0.015527,4108,1,0,9,1137,10,2,465,828,4
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 102 transition count 84
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 78 rules applied. Total rules applied 143 place count 37 transition count 71
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 148 place count 35 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 34 transition count 68
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 149 place count 34 transition count 62
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 161 place count 28 transition count 62
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 169 place count 20 transition count 51
Iterating global reduction 4 with 8 rules applied. Total rules applied 177 place count 20 transition count 51
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 183 place count 20 transition count 45
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 18 transition count 41
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 18 transition count 41
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 193 place count 18 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 202 place count 18 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 208 place count 15 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 210 place count 13 transition count 21
Applied a total of 210 rules in 20 ms. Remains 13 /103 variables (removed 90) and now considering 21/150 (removed 129) transitions.
[2024-05-29 11:47:48] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-29 11:47:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 11:47:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-29 11:47:48] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-29 11:47:48] [INFO ] Invariant cache hit.
[2024-05-29 11:47:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 11:47:48] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-29 11:47:48] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-29 11:47:48] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-05-29 11:47:48] [INFO ] Invariant cache hit.
[2024-05-29 11:47:48] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 17/30 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 27 constraints, problems are : Problem set: 0 solved, 20 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 17/30 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 1/31 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/31 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 47 constraints, problems are : Problem set: 0 solved, 20 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 9/9 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 550ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/103 places, 21/150 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 621 ms. Remains : 13/103 places, 21/150 transitions.
[2024-05-29 11:47:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:47:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:47:48] [INFO ] Input system was already deterministic with 21 transitions.
[2024-05-29 11:47:48] [INFO ] Flatten gal took : 1 ms
[2024-05-29 11:47:48] [INFO ] Flatten gal took : 1 ms
[2024-05-29 11:47:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality12875623392597603584.gal : 1 ms
[2024-05-29 11:47:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14882362816109196844.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12875623392597603584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14882362816109196844.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17,0.00336,3412,2,48,5,202,6,0,69,149,0
Converting to forward existential form...Done !
original formula: AG(EF(AG(((p66==0)&&(p71==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((p66==0)&&(p71==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t15, Intersection with reachable at each step enabled. (dest...196
(forward)formula 0,0,0.00723,3728,1,0,47,816,60,20,413,770,48
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 102 transition count 84
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 79 rules applied. Total rules applied 144 place count 37 transition count 70
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 150 place count 35 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 33 transition count 66
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 152 place count 33 transition count 60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 164 place count 27 transition count 60
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 167 place count 24 transition count 54
Iterating global reduction 4 with 3 rules applied. Total rules applied 170 place count 24 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 171 place count 24 transition count 53
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 173 place count 22 transition count 49
Iterating global reduction 5 with 2 rules applied. Total rules applied 175 place count 22 transition count 49
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 181 place count 22 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 21 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 184 place count 21 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 194 place count 21 transition count 31
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 200 place count 18 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 202 place count 18 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 203 place count 18 transition count 27
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 206 place count 15 transition count 24
Applied a total of 206 rules in 13 ms. Remains 15 /103 variables (removed 88) and now considering 24/150 (removed 126) transitions.
[2024-05-29 11:47:48] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 15 cols
[2024-05-29 11:47:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 11:47:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-29 11:47:48] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2024-05-29 11:47:48] [INFO ] Invariant cache hit.
[2024-05-29 11:47:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 11:47:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-29 11:47:48] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-29 11:47:48] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2024-05-29 11:47:48] [INFO ] Invariant cache hit.
[2024-05-29 11:47:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 11:47:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 20/35 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 26 constraints, problems are : Problem set: 0 solved, 19 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 3/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 20/35 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 45 constraints, problems are : Problem set: 0 solved, 19 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 9/9 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 523ms
Starting structural reductions in SI_CTL mode, iteration 1 : 15/103 places, 24/150 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 586 ms. Remains : 15/103 places, 24/150 transitions.
[2024-05-29 11:47:49] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:47:49] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:47:49] [INFO ] Input system was already deterministic with 24 transitions.
[2024-05-29 11:47:49] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:47:49] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:47:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality12975193911006229606.gal : 1 ms
[2024-05-29 11:47:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality13436095549225395706.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12975193911006229606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13436095549225395706.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19,0.003355,3428,2,51,5,221,6,0,81,163,0
Converting to forward existential form...Done !
original formula: AF(AG(((p27==1) * AG(((p47==0)&&(p95==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p27==1) * !(E(TRUE U !(((p47==0)&&(p95==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t7, t16, t19, t20, t21, Intersection with reachable at each step enabled...204
(forward)formula 0,0,0.008411,3744,1,0,50,1035,71,26,512,1040,63
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 83 transition count 128
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 83 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 83 transition count 125
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 69 transition count 110
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 69 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 69 transition count 104
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 63 transition count 98
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 63 transition count 98
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 94 place count 58 transition count 93
Iterating global reduction 2 with 5 rules applied. Total rules applied 99 place count 58 transition count 93
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 53 transition count 88
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 53 transition count 88
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 48 transition count 83
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 48 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 48 transition count 81
Applied a total of 121 rules in 6 ms. Remains 48 /103 variables (removed 55) and now considering 81/150 (removed 69) transitions.
[2024-05-29 11:47:49] [INFO ] Flow matrix only has 76 transitions (discarded 5 similar events)
// Phase 1: matrix 76 rows 48 cols
[2024-05-29 11:47:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 11:47:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 11:47:49] [INFO ] Flow matrix only has 76 transitions (discarded 5 similar events)
[2024-05-29 11:47:49] [INFO ] Invariant cache hit.
[2024-05-29 11:47:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:47:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-29 11:47:49] [INFO ] Flow matrix only has 76 transitions (discarded 5 similar events)
[2024-05-29 11:47:49] [INFO ] Invariant cache hit.
[2024-05-29 11:47:49] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-29 11:47:49] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 11:47:50] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:47:50] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:47:50] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:47:50] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:47:50] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:47:50] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 11:47:50] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/123 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 80 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 75/123 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 15/79 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 80/159 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 160 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 15/15 constraints]
After SMT, in 3791ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3792ms
Starting structural reductions in LTL mode, iteration 1 : 48/103 places, 81/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3859 ms. Remains : 48/103 places, 81/150 transitions.
[2024-05-29 11:47:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:47:53] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:47:53] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-29 11:47:53] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:47:53] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:47:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality6456975737981378784.gal : 1 ms
[2024-05-29 11:47:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality2998125886985165692.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6456975737981378784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2998125886985165692.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,625,0.01996,3840,2,244,5,1270,6,0,268,917,0
Converting to forward existential form...Done !
original formula: EX((((p76==0)&&(p24==1)) * (EG((p23==0)) + (p41==0))))
=> equivalent forward existential formula: ([FwdG((EY(Init) * ((p76==0)&&(p24==1))),(p23==0))] != FALSE + [((EY(Init) * ((p76==0)&&(p24==1))) * (p41==0))] ...164
(forward)formula 0,0,0.048129,5476,1,0,31,8356,20,2,1186,5433,28
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 88 transition count 133
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 88 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 88 transition count 132
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 75 transition count 118
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 75 transition count 118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 75 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 71 transition count 109
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 71 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 68 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 68 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 66 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 66 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 64 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 64 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 64 transition count 101
Applied a total of 85 rules in 14 ms. Remains 64 /103 variables (removed 39) and now considering 101/150 (removed 49) transitions.
[2024-05-29 11:47:53] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
// Phase 1: matrix 96 rows 64 cols
[2024-05-29 11:47:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 11:47:53] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 11:47:53] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
[2024-05-29 11:47:53] [INFO ] Invariant cache hit.
[2024-05-29 11:47:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:47:53] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-29 11:47:53] [INFO ] Flow matrix only has 96 transitions (discarded 5 similar events)
[2024-05-29 11:47:53] [INFO ] Invariant cache hit.
[2024-05-29 11:47:53] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-29 11:47:53] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:47:53] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:47:53] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:47:53] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:47:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:47:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:47:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:47:54] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:47:54] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:47:54] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-29 11:47:54] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 11:47:54] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:47:54] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 95/159 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 1/160 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 94 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 95/159 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-29 11:47:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/160 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 195 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 14/14 constraints]
After SMT, in 6322ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6322ms
Starting structural reductions in LTL mode, iteration 1 : 64/103 places, 101/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6407 ms. Remains : 64/103 places, 101/150 transitions.
[2024-05-29 11:47:59] [INFO ] Flatten gal took : 7 ms
[2024-05-29 11:47:59] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:47:59] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-29 11:47:59] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:47:59] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:47:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality12032948953415837974.gal : 1 ms
[2024-05-29 11:47:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3136122069485381364.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12032948953415837974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3136122069485381364.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,641,0.014731,3872,2,351,5,1463,6,0,352,1162,0
Converting to forward existential form...Done !
original formula: EF(EG((EX(((p21==0)&&((p62==0)||(p57==1)))) + (EF((((p50==0)||(p1==1))||(p15==1))) * ((p53==0)||(p31==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EX(((p21==0)&&((p62==0)||(p57==1)))) + (E(TRUE U (((p50==0)||(p1==1))||(p15==1))) * ((p53...183
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t17, t19, t22, t29, t41, t43, t46, t47, t63, t65,...295
(forward)formula 0,1,0.093479,7884,1,0,180,16844,223,84,2194,16327,241
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 150/150 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 86 transition count 131
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 86 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 86 transition count 129
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 51 place count 71 transition count 112
Iterating global reduction 1 with 15 rules applied. Total rules applied 66 place count 71 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 71 place count 71 transition count 107
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 65 transition count 101
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 65 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 63 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 63 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 61 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 61 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 59 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 59 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 59 transition count 93
Applied a total of 97 rules in 5 ms. Remains 59 /103 variables (removed 44) and now considering 93/150 (removed 57) transitions.
[2024-05-29 11:47:59] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
// Phase 1: matrix 89 rows 59 cols
[2024-05-29 11:47:59] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 11:47:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 11:47:59] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-29 11:47:59] [INFO ] Invariant cache hit.
[2024-05-29 11:48:00] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 11:48:00] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-29 11:48:00] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-29 11:48:00] [INFO ] Invariant cache hit.
[2024-05-29 11:48:00] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 11:48:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 88/147 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/148 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/148 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 92 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 88/147 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 92/183 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 184 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 16/16 constraints]
After SMT, in 5326ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5327ms
Starting structural reductions in LTL mode, iteration 1 : 59/103 places, 93/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5395 ms. Remains : 59/103 places, 93/150 transitions.
[2024-05-29 11:48:05] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:48:05] [INFO ] Flatten gal took : 5 ms
[2024-05-29 11:48:05] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-29 11:48:05] [INFO ] Flatten gal took : 3 ms
[2024-05-29 11:48:05] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:48:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality17972865296644066634.gal : 1 ms
[2024-05-29 11:48:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality2671484529513815864.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17972865296644066634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2671484529513815864.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,621,0.01466,3900,2,328,5,1557,6,0,325,1201,0
Converting to forward existential form...Done !
original formula: A((AF(EX((((p105==0)||(p78==1))&&(p29==1)))) * EX(!(((p88==0)||(p70==1))))) U ((AG((p100!=1)) * !(EG(((p90==1) * EG(((p34==0)||(p50==1)))...205
=> equivalent forward existential formula: [((Init * !(EG(!(((!(E(TRUE U !((p100!=1)))) * !(EG(((p90==1) * EG(((p34==0)||(p50==1))))))) * (!(EG(!(EG((p96==...558
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t8, t10, t11, t13, t15, t16, t20, t21, t25, t32, t36, t38, t40, t44, t47,...294
Using saturation style SCC detection
Using saturation style SCC detection
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.213268,13720,1,0,393,59681,235,211,2056,49532,531
FORMULA StigmergyCommit-PT-02a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-29 11:48:05] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:48:05] [INFO ] Flatten gal took : 4 ms
Total runtime 33310 ms.
BK_STOP 1716983285677
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-02a"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-02a, 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 r400-tall-171690531600089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-02a.tgz
mv StigmergyCommit-PT-02a execution
cd execution
if [ "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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;