About the Execution of ITS-Tools for DBSingleClientW-PT-d1m10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4858.655 | 1039267.00 | 1075622.00 | 2979.60 | FFFFTFTFFTTFTFFF | 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.r092-tall-171624189500537.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 DBSingleClientW-PT-d1m10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189500537
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 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 DBSingleClientW-PT-d1m10-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m10-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716323513180
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 20:31:54] [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-21 20:31:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:31:54] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-21 20:31:54] [INFO ] Transformed 1440 places.
[2024-05-21 20:31:54] [INFO ] Transformed 672 transitions.
[2024-05-21 20:31:54] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 329 transition count 615
Discarding 90 places :
Symmetric choice reduction at 1 with 90 rule applications. Total rules 165 place count 239 transition count 345
Iterating global reduction 1 with 90 rules applied. Total rules applied 255 place count 239 transition count 345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 259 place count 239 transition count 341
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 326 place count 172 transition count 274
Iterating global reduction 2 with 67 rules applied. Total rules applied 393 place count 172 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 397 place count 172 transition count 270
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 433 place count 136 transition count 219
Iterating global reduction 3 with 36 rules applied. Total rules applied 469 place count 136 transition count 219
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 491 place count 136 transition count 197
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 498 place count 129 transition count 182
Iterating global reduction 4 with 7 rules applied. Total rules applied 505 place count 129 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 506 place count 129 transition count 181
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 511 place count 124 transition count 176
Iterating global reduction 5 with 5 rules applied. Total rules applied 516 place count 124 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 517 place count 124 transition count 175
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 520 place count 121 transition count 172
Iterating global reduction 6 with 3 rules applied. Total rules applied 523 place count 121 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 526 place count 121 transition count 169
Applied a total of 526 rules in 81 ms. Remains 121 /347 variables (removed 226) and now considering 169/672 (removed 503) transitions.
// Phase 1: matrix 169 rows 121 cols
[2024-05-21 20:31:54] [INFO ] Computed 2 invariants in 17 ms
[2024-05-21 20:31:54] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-21 20:31:54] [INFO ] Invariant cache hit.
[2024-05-21 20:31:55] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 20:31:55] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-21 20:31:55] [INFO ] Invariant cache hit.
[2024-05-21 20:31:55] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/287 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 59/179 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 3/290 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 168 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/290 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 182 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/287 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 59/179 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 146/325 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 3/290 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 22/350 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/290 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 350 constraints, problems are : Problem set: 0 solved, 168 unsolved in 14658 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 22998ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 23012ms
Starting structural reductions in LTL mode, iteration 1 : 121/347 places, 169/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23627 ms. Remains : 121/347 places, 169/672 transitions.
Support contains 15 out of 121 places after structural reductions.
[2024-05-21 20:32:18] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-21 20:32:18] [INFO ] Flatten gal took : 37 ms
[2024-05-21 20:32:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:32:18] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:32:18] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 5 out of 121 places (down from 15) after GAL structural reductions.
RANDOM walk for 40000 steps (9125 resets) in 1423 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4017 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3883 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3979 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4014 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 996012 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :2 out of 4
Probabilistic random walk after 996012 steps, saw 369758 distinct states, run finished after 3008 ms. (steps per millisecond=331 ) properties seen :2
[2024-05-21 20:32:22] [INFO ] Invariant cache hit.
[2024-05-21 20:32:22] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/48 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/81 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/203 variables, 81/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 12/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 282/290 variables, and 130 constraints, problems are : Problem set: 2 solved, 0 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/121 constraints, ReadFeed: 12/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2024-05-21 20:32:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 20:32:22] [INFO ] Flatten gal took : 10 ms
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:32:22] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:32:22] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 0 out of 121 places (down from 3) after GAL structural reductions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 418 edges and 121 vertex of which 117 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 169/169 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 118 transition count 165
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 17 place count 108 transition count 149
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 108 transition count 149
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 99 transition count 137
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 99 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 99 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 94 transition count 122
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 94 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 89 transition count 116
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 89 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 86 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 84 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 83 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 83 transition count 101
Applied a total of 84 rules in 11 ms. Remains 83 /121 variables (removed 38) and now considering 101/169 (removed 68) transitions.
// Phase 1: matrix 101 rows 83 cols
[2024-05-21 20:32:22] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 20:32:22] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 20:32:22] [INFO ] Invariant cache hit.
[2024-05-21 20:32:22] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:32:22] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 20:32:22] [INFO ] Invariant cache hit.
[2024-05-21 20:32:22] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-21 20:32:23] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 117 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2505 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/184 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 100/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 217 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
After SMT, in 6278ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6280ms
Starting structural reductions in LTL mode, iteration 1 : 83/121 places, 101/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6481 ms. Remains : 83/121 places, 101/169 transitions.
[2024-05-21 20:32:28] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:32:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:32:28] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 20:32:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:32:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:32:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality8075597297212852855.gal : 3 ms
[2024-05-21 20:32:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10217117014446981402.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8075597297212852855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10217117014446981402.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,1.4384e+08,27.3197,658132,2,39984,5,2.09855e+06,6,0,433,2.54306e+06,0
Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,27.3256,658132,1,0,6,2.09855e+06,7,1,580,2.54306e+06,1
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 169/169 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 118 transition count 165
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 17 place count 108 transition count 149
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 108 transition count 149
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 99 transition count 137
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 99 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 99 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 94 transition count 122
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 94 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 89 transition count 116
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 89 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 86 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 84 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 83 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 83 transition count 101
Applied a total of 84 rules in 17 ms. Remains 83 /121 variables (removed 38) and now considering 101/169 (removed 68) transitions.
[2024-05-21 20:32:56] [INFO ] Invariant cache hit.
[2024-05-21 20:32:56] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 20:32:56] [INFO ] Invariant cache hit.
[2024-05-21 20:32:56] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:32:56] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 20:32:56] [INFO ] Invariant cache hit.
[2024-05-21 20:32:56] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-21 20:32:57] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 117 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2410 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/184 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 100/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 217 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
After SMT, in 6107ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6110ms
Starting structural reductions in LTL mode, iteration 1 : 83/121 places, 101/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6445 ms. Remains : 83/121 places, 101/169 transitions.
[2024-05-21 20:33:02] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:33:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:33:02] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 20:33:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:33:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:33:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5803991842909601040.gal : 2 ms
[2024-05-21 20:33:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality5245386625638392904.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/CTLCardinality5803991842909601040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5245386625638392904.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,1.4384e+08,27.1177,657632,2,39984,5,2.09855e+06,6,0,433,2.54306e+06,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,27.122,657632,1,0,6,2.09855e+06,7,1,580,2.54306e+06,1
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 169/169 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 118 transition count 165
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 17 place count 108 transition count 149
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 108 transition count 149
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 99 transition count 137
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 99 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 99 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 94 transition count 122
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 94 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 89 transition count 116
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 89 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 86 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 84 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 83 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 83 transition count 101
Applied a total of 84 rules in 9 ms. Remains 83 /121 variables (removed 38) and now considering 101/169 (removed 68) transitions.
[2024-05-21 20:33:29] [INFO ] Invariant cache hit.
[2024-05-21 20:33:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 20:33:29] [INFO ] Invariant cache hit.
[2024-05-21 20:33:30] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:33:30] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 20:33:30] [INFO ] Invariant cache hit.
[2024-05-21 20:33:30] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-21 20:33:31] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 117 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/184 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 100/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 217 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
After SMT, in 5993ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5995ms
Starting structural reductions in LTL mode, iteration 1 : 83/121 places, 101/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6413 ms. Remains : 83/121 places, 101/169 transitions.
[2024-05-21 20:33:36] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:33:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:33:36] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 20:33:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:33:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:33:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality11658353154488268158.gal : 2 ms
[2024-05-21 20:33:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality11333358316477142813.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/CTLCardinality11658353154488268158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11333358316477142813.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,1.4384e+08,27.036,657108,2,39984,5,2.09855e+06,6,0,433,2.54306e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 20:34:06] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:34:06] [INFO ] Applying decomposition
[2024-05-21 20:34:06] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6844576170685373494.txt' '-o' '/tmp/graph6844576170685373494.bin' '-w' '/tmp/graph6844576170685373494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6844576170685373494.bin' '-l' '-1' '-v' '-w' '/tmp/graph6844576170685373494.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:34:06] [INFO ] Decomposing Gal with order
[2024-05-21 20:34:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:34:06] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-21 20:34:06] [INFO ] Flatten gal took : 38 ms
[2024-05-21 20:34:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 11 ms.
[2024-05-21 20:34:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality10255158690165057078.gal : 3 ms
[2024-05-21 20:34:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14736931333655614636.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/CTLCardinality10255158690165057078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14736931333655614636.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 169/169 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 118 transition count 165
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 17 place count 108 transition count 149
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 108 transition count 149
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 99 transition count 137
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 99 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 99 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 94 transition count 122
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 94 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 89 transition count 116
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 89 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 86 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 84 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 83 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 83 transition count 101
Applied a total of 84 rules in 15 ms. Remains 83 /121 variables (removed 38) and now considering 101/169 (removed 68) transitions.
[2024-05-21 20:34:36] [INFO ] Invariant cache hit.
[2024-05-21 20:34:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 20:34:36] [INFO ] Invariant cache hit.
[2024-05-21 20:34:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:34:36] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 20:34:36] [INFO ] Invariant cache hit.
[2024-05-21 20:34:36] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-21 20:34:37] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 117 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/184 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 100/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 217 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3666 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
After SMT, in 6110ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6111ms
Starting structural reductions in LTL mode, iteration 1 : 83/121 places, 101/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6320 ms. Remains : 83/121 places, 101/169 transitions.
[2024-05-21 20:34:42] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:34:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:34:42] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 20:34:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:34:42] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:34:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17363614523127968424.gal : 1 ms
[2024-05-21 20:34:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4533819728779005092.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/CTLCardinality17363614523127968424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4533819728779005092.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,1.4384e+08,26.7253,657936,2,39984,5,2.09855e+06,6,0,433,2.54306e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 20:35:13] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:35:13] [INFO ] Applying decomposition
[2024-05-21 20:35:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13469275336588235476.txt' '-o' '/tmp/graph13469275336588235476.bin' '-w' '/tmp/graph13469275336588235476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13469275336588235476.bin' '-l' '-1' '-v' '-w' '/tmp/graph13469275336588235476.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:35:13] [INFO ] Decomposing Gal with order
[2024-05-21 20:35:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:35:13] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-21 20:35:13] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:35:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 5 ms.
[2024-05-21 20:35:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality112833234204971071.gal : 2 ms
[2024-05-21 20:35:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12746875070411727362.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/CTLCardinality112833234204971071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12746875070411727362.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4384e+08,7.52699,220224,3029,866,285890,34685,347,1.29562e+06,106,255042,0
Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t11, t12, t45, t63, t70, t71, t72, t75, t79, t80, t81, t82, t83, t84, t85, t86, t87, ...375
(forward)formula 0,1,10.9324,220564,1,0,285890,84050,1343,1.29562e+06,601,473317,253935
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 169/169 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 118 transition count 165
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 17 place count 108 transition count 149
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 108 transition count 149
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 99 transition count 137
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 99 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 99 transition count 133
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 94 transition count 122
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 94 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 89 transition count 116
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 89 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 86 transition count 112
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 84 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 83 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 83 transition count 101
Applied a total of 84 rules in 7 ms. Remains 83 /121 variables (removed 38) and now considering 101/169 (removed 68) transitions.
[2024-05-21 20:35:24] [INFO ] Invariant cache hit.
[2024-05-21 20:35:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 20:35:24] [INFO ] Invariant cache hit.
[2024-05-21 20:35:24] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 20:35:24] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-21 20:35:24] [INFO ] Invariant cache hit.
[2024-05-21 20:35:24] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-21 20:35:25] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 117 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/184 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 100/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 217 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3584 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
After SMT, in 6053ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 6054ms
Starting structural reductions in LTL mode, iteration 1 : 83/121 places, 101/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6234 ms. Remains : 83/121 places, 101/169 transitions.
[2024-05-21 20:35:30] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:35:30] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:35:30] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-21 20:35:30] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:35:30] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:35:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality8831993226607039895.gal : 1 ms
[2024-05-21 20:35:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15983445150549456398.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/CTLCardinality8831993226607039895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15983445150549456398.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,1.4384e+08,26.9494,658756,2,39984,5,2.09855e+06,6,0,433,2.54306e+06,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,26.9535,658756,1,0,6,2.09855e+06,7,1,580,2.54306e+06,1
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2024-05-21 20:35:57] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:35:57] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:35:57] [INFO ] Applying decomposition
[2024-05-21 20:35:57] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12131622507185197125.txt' '-o' '/tmp/graph12131622507185197125.bin' '-w' '/tmp/graph12131622507185197125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12131622507185197125.bin' '-l' '-1' '-v' '-w' '/tmp/graph12131622507185197125.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:35:57] [INFO ] Decomposing Gal with order
[2024-05-21 20:35:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:35:57] [INFO ] Removed a total of 161 redundant transitions.
[2024-05-21 20:35:57] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:35:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 6 ms.
[2024-05-21 20:35:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality6284558039495968509.gal : 3 ms
[2024-05-21 20:35:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality12322680481420070303.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/CTLCardinality6284558039495968509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12322680481420070303.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64609e+09,679.892,4206948,16668,7075,1.63385e+06,397746,526,4.48681e+07,208,3.67355e+06,0
Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t12, t21, t51, t58, t62, t69, t74, t76, t94, t95, t96, t97, t99, t109, t123, t124, t1...607
(forward)formula 0,1,793.651,4207740,1,0,1.68811e+06,827740,2126,4.48681e+07,1224,6.07872e+06,2122259
FORMULA DBSingleClientW-PT-d1m10-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1038122 ms.
BK_STOP 1716324552447
--------------------
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="DBSingleClientW-PT-d1m10"
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 DBSingleClientW-PT-d1m10, 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 r092-tall-171624189500537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m10.tgz
mv DBSingleClientW-PT-d1m10 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 ;