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-171624189500553.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-d2m05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189500553
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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 1.6M 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-d2m05-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d2m05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716326137185

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-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 21:15:38] [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 21:15:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:15:38] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2024-05-21 21:15:38] [INFO ] Transformed 4763 places.
[2024-05-21 21:15:38] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:15:38] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 3580 places in 22 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1138 transition count 2283
Discarding 384 places :
Symmetric choice reduction at 1 with 384 rule applications. Total rules 624 place count 754 transition count 1231
Iterating global reduction 1 with 384 rules applied. Total rules applied 1008 place count 754 transition count 1231
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1017 place count 754 transition count 1222
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 1321 place count 450 transition count 918
Iterating global reduction 2 with 304 rules applied. Total rules applied 1625 place count 450 transition count 918
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1636 place count 450 transition count 907
Discarding 228 places :
Symmetric choice reduction at 3 with 228 rule applications. Total rules 1864 place count 222 transition count 595
Iterating global reduction 3 with 228 rules applied. Total rules applied 2092 place count 222 transition count 595
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Iterating post reduction 3 with 203 rules applied. Total rules applied 2295 place count 222 transition count 392
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2316 place count 201 transition count 351
Iterating global reduction 4 with 21 rules applied. Total rules applied 2337 place count 201 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 2342 place count 201 transition count 346
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 2354 place count 189 transition count 334
Iterating global reduction 5 with 12 rules applied. Total rules applied 2366 place count 189 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2367 place count 189 transition count 333
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2378 place count 178 transition count 322
Iterating global reduction 6 with 11 rules applied. Total rules applied 2389 place count 178 transition count 322
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2396 place count 178 transition count 315
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2399 place count 175 transition count 306
Iterating global reduction 7 with 3 rules applied. Total rules applied 2402 place count 175 transition count 306
Applied a total of 2402 rules in 183 ms. Remains 175 /1183 variables (removed 1008) and now considering 306/2478 (removed 2172) transitions.
// Phase 1: matrix 306 rows 175 cols
[2024-05-21 21:15:39] [INFO ] Computed 2 invariants in 22 ms
[2024-05-21 21:15:39] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-21 21:15:39] [INFO ] Invariant cache hit.
[2024-05-21 21:15:39] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 21:15:40] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-05-21 21:15:40] [INFO ] Invariant cache hit.
[2024-05-21 21:15:40] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 306/480 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 130/306 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/481 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 305 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/481 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 307 constraints, problems are : Problem set: 0 solved, 305 unsolved in 23834 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 306/480 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 130/306 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 277/583 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/481 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 28/612 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 612 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints]
After SMT, in 54735ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 54751ms
Starting structural reductions in LTL mode, iteration 1 : 175/1183 places, 306/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55986 ms. Remains : 175/1183 places, 306/2478 transitions.
Support contains 17 out of 175 places after structural reductions.
[2024-05-21 21:16:35] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-21 21:16:35] [INFO ] Flatten gal took : 78 ms
[2024-05-21 21:16:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:16:35] [INFO ] Flatten gal took : 32 ms
[2024-05-21 21:16:35] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 11 out of 175 places (down from 17) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9161 resets) in 2528 ms. (15 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40001 steps (3791 resets) in 332 ms. (120 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (3792 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3786 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3767 resets) in 242 ms. (164 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (3784 resets) in 200 ms. (199 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3821 resets) in 108 ms. (366 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3696 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3826 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
[2024-05-21 21:16:36] [INFO ] Invariant cache hit.
[2024-05-21 21:16:36] [INFO ] State equation strengthened by 130 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/73 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 46/119 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 208/327 variables, 119/121 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 32/153 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 146/473 variables, 52/205 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 94/299 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/481 variables, 4/303 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 4/307 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 21:16:37] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 27 ms to minimize.
Problem AtomicPropp6 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/481 variables, 1/308 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/481 variables, 0/308 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/481 variables, 0/308 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 308 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 68/72 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/118 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-21 21:16:37] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 2 ms to minimize.
[2024-05-21 21:16:38] [INFO ] Deduced a trap composed of 65 places in 560 ms of which 14 ms to minimize.
[2024-05-21 21:16:38] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 207/325 variables, 118/123 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 31/154 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 2/156 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 148/473 variables, 53/209 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 95/304 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/473 variables, 1/305 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/473 variables, 1/306 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 0/306 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/481 variables, 4/310 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/481 variables, 4/314 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/481 variables, 0/314 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/481 variables, 0/314 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 314 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 2329ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 514 ms.
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 306/306 transitions.
Graph (complete) has 621 edges and 175 vertex of which 174 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 174 transition count 302
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 17 place count 162 transition count 283
Iterating global reduction 1 with 12 rules applied. Total rules applied 29 place count 162 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 162 transition count 282
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 40 place count 152 transition count 262
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 152 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 152 transition count 259
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 61 place count 144 transition count 245
Iterating global reduction 3 with 8 rules applied. Total rules applied 69 place count 144 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 73 place count 144 transition count 241
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 79 place count 138 transition count 228
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 138 transition count 228
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 90 place count 138 transition count 223
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 92 place count 136 transition count 221
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 136 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 136 transition count 220
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 96 place count 135 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 97 place count 135 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 100 place count 135 transition count 216
Applied a total of 100 rules in 65 ms. Remains 135 /175 variables (removed 40) and now considering 216/306 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 135/175 places, 216/306 transitions.
RANDOM walk for 40000 steps (9160 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (3875 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3853 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3745 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
Probably explored full state space saw : 232916 states, properties seen :2
Probabilistic random walk after 604917 steps, saw 232916 distinct states, run finished after 1075 ms. (steps per millisecond=562 ) properties seen :2
Explored full state space saw : 234383 states, properties seen :0
Exhaustive walk after 607513 steps, saw 234383 distinct states, run finished after 632 ms. (steps per millisecond=961 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:16:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 21:16:41] [INFO ] Flatten gal took : 17 ms
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:16:41] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:16:41] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 5 out of 175 places (down from 7) after GAL structural reductions.
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 667 edges and 175 vertex of which 173 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 306/306 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 303
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 15 place count 163 transition count 284
Iterating global reduction 1 with 11 rules applied. Total rules applied 26 place count 163 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 163 transition count 282
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 37 place count 154 transition count 268
Iterating global reduction 2 with 9 rules applied. Total rules applied 46 place count 154 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 154 transition count 265
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 56 place count 147 transition count 252
Iterating global reduction 3 with 7 rules applied. Total rules applied 63 place count 147 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 67 place count 147 transition count 248
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 73 place count 141 transition count 228
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 141 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 82 place count 141 transition count 225
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 84 place count 139 transition count 223
Iterating global reduction 5 with 2 rules applied. Total rules applied 86 place count 139 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 139 transition count 222
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 88 place count 138 transition count 221
Iterating global reduction 6 with 1 rules applied. Total rules applied 89 place count 138 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 92 place count 138 transition count 218
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 94 place count 136 transition count 205
Iterating global reduction 7 with 2 rules applied. Total rules applied 96 place count 136 transition count 205
Applied a total of 96 rules in 35 ms. Remains 136 /175 variables (removed 39) and now considering 205/306 (removed 101) transitions.
// Phase 1: matrix 205 rows 136 cols
[2024-05-21 21:16:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:16:42] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-21 21:16:42] [INFO ] Invariant cache hit.
[2024-05-21 21:16:42] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:16:42] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-05-21 21:16:42] [INFO ] Invariant cache hit.
[2024-05-21 21:16:42] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/341 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 208 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5854 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/341 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 70/208 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 204/412 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 204 unsolved in 15375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 21613ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 21618ms
Starting structural reductions in LTL mode, iteration 1 : 136/175 places, 205/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22571 ms. Remains : 136/175 places, 205/306 transitions.
[2024-05-21 21:17:04] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:17:04] [INFO ] Flatten gal took : 25 ms
[2024-05-21 21:17:04] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-21 21:17:04] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:17:04] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:17:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality5410922038668002855.gal : 8 ms
[2024-05-21 21:17:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality1897528325193128382.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/CTLCardinality5410922038668002855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1897528325193128382.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,333592,6.45229,176996,2,17670,5,439901,6,0,749,661353,0


Converting to forward existential form...Done !
original formula: AF(((EX(EG((p373<=0))) * AX((p109<=0))) * (AX(FALSE) + ((AF((p430<=0)) * EX(TRUE)) * (AX(FALSE) + (l36>1))))))
=> equivalent forward existential formula: [FwdG(Init,!(((EX(EG((p373<=0))) * !(EX(!((p109<=0))))) * (!(EX(!(FALSE))) + ((!(EG(!((p430<=0)))) * EX(TRUE)) *...197
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t69, t70, t71, t72, t73, t74, t75, t76, t84,...746
(forward)formula 0,0,28.9785,727032,1,0,652,3.04438e+06,445,313,5295,2.51196e+06,681
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 306/306 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 174 transition count 303
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 19 place count 159 transition count 274
Iterating global reduction 1 with 15 rules applied. Total rules applied 34 place count 159 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 159 transition count 272
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 48 place count 147 transition count 250
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 147 transition count 250
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 65 place count 147 transition count 245
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 74 place count 138 transition count 230
Iterating global reduction 3 with 9 rules applied. Total rules applied 83 place count 138 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 87 place count 138 transition count 226
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 95 place count 130 transition count 204
Iterating global reduction 4 with 8 rules applied. Total rules applied 103 place count 130 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 109 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 111 place count 128 transition count 196
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 128 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 114 place count 128 transition count 195
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 115 place count 127 transition count 194
Iterating global reduction 6 with 1 rules applied. Total rules applied 116 place count 127 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 119 place count 127 transition count 191
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 122 place count 124 transition count 171
Iterating global reduction 7 with 3 rules applied. Total rules applied 125 place count 124 transition count 171
Applied a total of 125 rules in 19 ms. Remains 124 /175 variables (removed 51) and now considering 171/306 (removed 135) transitions.
// Phase 1: matrix 171 rows 124 cols
[2024-05-21 21:17:33] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:17:33] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-21 21:17:33] [INFO ] Invariant cache hit.
[2024-05-21 21:17:34] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 21:17:34] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-21 21:17:34] [INFO ] Invariant cache hit.
[2024-05-21 21:17:34] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 178 constraints, problems are : Problem set: 0 solved, 170 unsolved in 4047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 170/348 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 348 constraints, problems are : Problem set: 0 solved, 170 unsolved in 10662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints]
After SMT, in 14954ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 14955ms
Starting structural reductions in LTL mode, iteration 1 : 124/175 places, 171/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15530 ms. Remains : 124/175 places, 171/306 transitions.
[2024-05-21 21:17:49] [INFO ] Flatten gal took : 15 ms
[2024-05-21 21:17:49] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:17:49] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-21 21:17:49] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:17:49] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:17:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality8656550007018405910.gal : 9 ms
[2024-05-21 21:17:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality12723306042457458822.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/CTLCardinality8656550007018405910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12723306042457458822.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,186662,2.53481,83140,2,11027,5,218165,6,0,667,265361,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,2.53927,83140,1,0,6,218165,7,1,903,265361,1
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2023-12 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 : 175/175 places, 306/306 transitions.
Graph (complete) has 667 edges and 175 vertex of which 174 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 174 transition count 303
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 18 place count 160 transition count 275
Iterating global reduction 1 with 14 rules applied. Total rules applied 32 place count 160 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 160 transition count 273
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 45 place count 149 transition count 256
Iterating global reduction 2 with 11 rules applied. Total rules applied 56 place count 149 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 61 place count 149 transition count 251
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 69 place count 141 transition count 237
Iterating global reduction 3 with 8 rules applied. Total rules applied 77 place count 141 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 81 place count 141 transition count 233
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 88 place count 134 transition count 212
Iterating global reduction 4 with 7 rules applied. Total rules applied 95 place count 134 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 99 place count 134 transition count 208
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 101 place count 132 transition count 206
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 132 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 104 place count 132 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 105 place count 131 transition count 204
Iterating global reduction 6 with 1 rules applied. Total rules applied 106 place count 131 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 109 place count 131 transition count 201
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 112 place count 128 transition count 181
Iterating global reduction 7 with 3 rules applied. Total rules applied 115 place count 128 transition count 181
Applied a total of 115 rules in 37 ms. Remains 128 /175 variables (removed 47) and now considering 181/306 (removed 125) transitions.
// Phase 1: matrix 181 rows 128 cols
[2024-05-21 21:17:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:17:52] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 21:17:52] [INFO ] Invariant cache hit.
[2024-05-21 21:17:52] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 21:17:52] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-21 21:17:52] [INFO ] Redundant transitions in 4 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-21 21:17:52] [INFO ] Invariant cache hit.
[2024-05-21 21:17:52] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/309 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 53/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 183 constraints, problems are : Problem set: 0 solved, 180 unsolved in 4656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/309 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 53/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 180/363 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 363 constraints, problems are : Problem set: 0 solved, 180 unsolved in 11872 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints]
After SMT, in 16800ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 16802ms
Starting structural reductions in SI_CTL mode, iteration 1 : 128/175 places, 181/306 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17309 ms. Remains : 128/175 places, 181/306 transitions.
[2024-05-21 21:18:09] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:18:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:18:09] [INFO ] Input system was already deterministic with 181 transitions.
[2024-05-21 21:18:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:18:09] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:18:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality13350482717202976756.gal : 3 ms
[2024-05-21 21:18:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality17569369614547412155.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/CTLCardinality13350482717202976756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17569369614547412155.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,244774,4.38843,115152,2,12859,5,311793,6,0,693,364544,0


Converting to forward existential form...Done !
original formula: AF(AG((p443>0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p443>0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t102, t104, t113...605
(forward)formula 0,0,14.2282,348328,1,0,501,1.24819e+06,390,254,4958,1.18435e+06,513
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-21 21:18:23] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:18:23] [INFO ] Flatten gal took : 10 ms
Total runtime 165362 ms.

BK_STOP 1716326303728

--------------------
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-d2m05"
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-d2m05, 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-171624189500553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;