About the Execution of ITS-Tools for DBSingleClientW-PT-d0m08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
724.304 | 34312.00 | 48765.00 | 163.40 | TFTTFTFFFTTFTTTT | 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-171624189300465.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-d0m08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189300465
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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 119K 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-d0m08-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716317861206
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-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 18:57:42] [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 18:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:57:42] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-21 18:57:42] [INFO ] Transformed 553 places.
[2024-05-21 18:57:42] [INFO ] Transformed 150 transitions.
[2024-05-21 18:57:42] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 104 transition count 148
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 29 place count 82 transition count 101
Iterating global reduction 1 with 22 rules applied. Total rules applied 51 place count 82 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 82 transition count 99
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 64 place count 71 transition count 88
Iterating global reduction 2 with 11 rules applied. Total rules applied 75 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 71 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 68 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 68 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 68 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 67 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 67 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 66 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 66 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 66 transition count 75
Applied a total of 90 rules in 38 ms. Remains 66 /109 variables (removed 43) and now considering 75/150 (removed 75) transitions.
// Phase 1: matrix 75 rows 66 cols
[2024-05-21 18:57:42] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 18:57:42] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-21 18:57:42] [INFO ] Invariant cache hit.
[2024-05-21 18:57:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 18:57:42] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-21 18:57:42] [INFO ] Invariant cache hit.
[2024-05-21 18:57:42] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 92 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 64/154 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 2/141 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 10/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 166 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2956 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 4867ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 4884ms
Starting structural reductions in LTL mode, iteration 1 : 66/109 places, 75/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5299 ms. Remains : 66/109 places, 75/150 transitions.
Support contains 7 out of 66 places after structural reductions.
[2024-05-21 18:57:48] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 18:57:48] [INFO ] Flatten gal took : 25 ms
[2024-05-21 18:57:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:57:48] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:57:48] [INFO ] Input system was already deterministic with 75 transitions.
Support contains 5 out of 66 places (down from 7) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9170 resets) in 1083 ms. (36 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (3545 resets) in 430 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4041 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4096 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4052 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
[2024-05-21 18:57:48] [INFO ] Invariant cache hit.
[2024-05-21 18:57:48] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 88/120 variables, 41/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 24/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 18:57:48] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/121 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/129 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 13 (OVERLAPS) 12/141 variables, 12/93 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/141 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 93 constraints, problems are : Problem set: 3 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/24 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/103 variables, 37/38 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 14/52 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/104 variables, 1/54 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/55 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/114 variables, 1/56 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 10/66 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 1/67 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 0/67 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 24/138 variables, 15/82 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/138 variables, 9/91 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/141 variables, 2/93 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/141 variables, 1/94 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/141 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/141 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 94 constraints, problems are : Problem set: 3 solved, 1 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 256ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 75/75 transitions.
Graph (complete) has 193 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 63 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 61 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 60 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 57 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 57 transition count 63
Applied a total of 18 rules in 20 ms. Remains 57 /66 variables (removed 9) and now considering 63/75 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 57/66 places, 63/75 transitions.
RANDOM walk for 36412 steps (8334 resets) in 115 ms. (313 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:57:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 18:57:49] [INFO ] Flatten gal took : 6 ms
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:57:49] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:57:49] [INFO ] Input system was already deterministic with 75 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 211 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 75/75 transitions.
Graph (complete) has 211 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 63 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 63 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 62 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 61 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 61 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 59 transition count 65
Applied a total of 16 rules in 15 ms. Remains 59 /66 variables (removed 7) and now considering 65/75 (removed 10) transitions.
// Phase 1: matrix 65 rows 59 cols
[2024-05-21 18:57:49] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 18:57:49] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 18:57:49] [INFO ] Invariant cache hit.
[2024-05-21 18:57:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 18:57:49] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 18:57:49] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 18:57:49] [INFO ] Invariant cache hit.
[2024-05-21 18:57:49] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/123 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 21/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 82 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/123 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 21/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 60/141 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 146 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1981 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 3377ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3379ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/66 places, 65/75 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3525 ms. Remains : 59/66 places, 65/75 transitions.
[2024-05-21 18:57:52] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:57:52] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:57:52] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-21 18:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:57:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:57:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality3372828387892675170.gal : 2 ms
[2024-05-21 18:57:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality15614813686381408475.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/CTLCardinality3372828387892675170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15614813686381408475.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,3.09229e+06,0.826426,33912,2,10188,5,114958,6,0,298,129723,0
Converting to forward existential form...Done !
original formula: EG(AF((l377<=0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((l377<=0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t11, t29, t41, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...286
(forward)formula 0,1,14.0867,408016,1,0,521,1.89837e+06,157,288,2035,2.3313e+06,480
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 66/66 places, 75/75 transitions.
Graph (complete) has 211 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 62 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 61 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 58 transition count 64
Applied a total of 17 rules in 18 ms. Remains 58 /66 variables (removed 8) and now considering 64/75 (removed 11) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 18:58:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 18:58:06] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 18:58:06] [INFO ] Invariant cache hit.
[2024-05-21 18:58:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:58:07] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 18:58:07] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-21 18:58:07] [INFO ] Invariant cache hit.
[2024-05-21 18:58:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2460ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2460ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/66 places, 64/75 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2604 ms. Remains : 58/66 places, 64/75 transitions.
[2024-05-21 18:58:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:58:09] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:58:09] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 18:58:09] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:58:09] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:58:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11356193712600088365.gal : 1 ms
[2024-05-21 18:58:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11024453774838628149.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11356193712600088365.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11024453774838628149.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11024453774838628149.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 142
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :142 after 232
RANDOM walk for 40000 steps (9084 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Reachability property DBSingleClientW-PT-d0m08-CTLCardinality-2024-03 is true.
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,462,0.036912,5096,2,446,12,6676,6,0,296,3266,0
Total reachable state count : 462
Verifying 1 reachability properties.
Reachability property DBSingleClientW-PT-d0m08-CTLCardinality-2024-03 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d0m08-CTLCardinality-2024-03,6,0.037489,5096,2,62,12,6676,7,0,299,3266,0
ITS tools runner thread asked to quit. Dying gracefully.
BEST_FIRST walk for 40002 steps (3549 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 291 steps, run visited all 1 properties in 7 ms. (steps per millisecond=41 )
Probabilistic random walk after 291 steps, saw 168 distinct states, run finished after 10 ms. (steps per millisecond=29 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 75/75 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 64 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 62 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 62 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 61 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 58 transition count 64
Applied a total of 18 rules in 6 ms. Remains 58 /66 variables (removed 8) and now considering 64/75 (removed 11) transitions.
[2024-05-21 18:58:09] [INFO ] Invariant cache hit.
[2024-05-21 18:58:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 18:58:09] [INFO ] Invariant cache hit.
[2024-05-21 18:58:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 18:58:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 18:58:09] [INFO ] Invariant cache hit.
[2024-05-21 18:58:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2549ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2550ms
Starting structural reductions in LTL mode, iteration 1 : 58/66 places, 64/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2676 ms. Remains : 58/66 places, 64/75 transitions.
[2024-05-21 18:58:12] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:58:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:58:12] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-21 18:58:12] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:58:12] [INFO ] Flatten gal took : 3 ms
[2024-05-21 18:58:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10399663369366655802.gal : 1 ms
[2024-05-21 18:58:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality4973943289294110165.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/CTLCardinality10399663369366655802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4973943289294110165.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,2.28703e+06,0.984631,39800,2,10587,5,133082,6,0,296,156612,0
Converting to forward existential form...Done !
original formula: AG(AF(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...286
(forward)formula 0,0,3.11284,94784,1,0,141,359666,149,57,2027,373610,148
FORMULA DBSingleClientW-PT-d0m08-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-21 18:58:15] [INFO ] Flatten gal took : 4 ms
[2024-05-21 18:58:15] [INFO ] Flatten gal took : 4 ms
Total runtime 33160 ms.
BK_STOP 1716317895518
--------------------
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-d0m08"
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-d0m08, 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-171624189300465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m08.tgz
mv DBSingleClientW-PT-d0m08 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 ;