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.r334-tall-171679079500065.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 RingSingleMessageInMbox-PT-d1m010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679079500065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 00:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 13 00:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 00:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 00:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716794994224

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-27 07:29:55] [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-27 07:29:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:29:55] [INFO ] Load time of PNML (sax parser for PT used): 461 ms
[2024-05-27 07:29:55] [INFO ] Transformed 6690 places.
[2024-05-27 07:29:55] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:29:55] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 629 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 4305 places in 42 ms
Reduce places removed 4305 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1098 places :
Symmetric choice reduction at 1 with 1098 rule applications. Total rules 1217 place count 1270 transition count 2430
Iterating global reduction 1 with 1098 rules applied. Total rules applied 2315 place count 1270 transition count 2430
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2387 place count 1270 transition count 2358
Discarding 916 places :
Symmetric choice reduction at 2 with 916 rule applications. Total rules 3303 place count 354 transition count 1442
Iterating global reduction 2 with 916 rules applied. Total rules applied 4219 place count 354 transition count 1442
Ensure Unique test removed 869 transitions
Reduce isomorphic transitions removed 869 transitions.
Iterating post reduction 2 with 869 rules applied. Total rules applied 5088 place count 354 transition count 573
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 5218 place count 224 transition count 443
Iterating global reduction 3 with 130 rules applied. Total rules applied 5348 place count 224 transition count 443
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5446 place count 224 transition count 345
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 5454 place count 216 transition count 337
Iterating global reduction 4 with 8 rules applied. Total rules applied 5462 place count 216 transition count 337
Applied a total of 5462 rules in 435 ms. Remains 216 /2385 variables (removed 2169) and now considering 337/11934 (removed 11597) transitions.
// Phase 1: matrix 337 rows 216 cols
[2024-05-27 07:29:56] [INFO ] Computed 3 invariants in 21 ms
[2024-05-27 07:29:56] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-27 07:29:56] [INFO ] Invariant cache hit.
[2024-05-27 07:29:57] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-27 07:29:57] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-05-27 07:29:57] [INFO ] Invariant cache hit.
[2024-05-27 07:29:57] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/216 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 4 (OVERLAPS) 337/553 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 132/351 constraints. Problems are: Problem set: 24 solved, 312 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/351 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/351 constraints. Problems are: Problem set: 24 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 351 constraints, problems are : Problem set: 24 solved, 312 unsolved in 14502 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 17/208 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 8/216 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 337/553 variables, 216/219 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 132/351 constraints. Problems are: Problem set: 24 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 312/663 constraints. Problems are: Problem set: 24 solved, 312 unsolved
[2024-05-27 07:30:22] [INFO ] Deduced a trap composed of 111 places in 89 ms of which 15 ms to minimize.
[2024-05-27 07:30:22] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 2 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-27 07:30:23] [INFO ] Deduced a trap composed of 97 places in 42 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-05-27 07:30:24] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
[2024-05-27 07:30:28] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
[2024-05-27 07:30:28] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
[2024-05-27 07:30:28] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-05-27 07:30:29] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-27 07:30:29] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 9/672 constraints. Problems are: Problem set: 46 solved, 290 unsolved
[2024-05-27 07:30:40] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 2 ms to minimize.
[2024-05-27 07:30:41] [INFO ] Deduced a trap composed of 126 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 2/674 constraints. Problems are: Problem set: 46 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 674 constraints, problems are : Problem set: 46 solved, 290 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 312/336 constraints, Known Traps: 11/11 constraints]
After SMT, in 45559ms problems are : Problem set: 46 solved, 290 unsolved
Search for dead transitions found 46 dead transitions in 45583ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/2385 places, 291/11934 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 176 transition count 275
Applied a total of 56 rules in 4 ms. Remains 176 /216 variables (removed 40) and now considering 275/291 (removed 16) transitions.
// Phase 1: matrix 275 rows 176 cols
[2024-05-27 07:30:43] [INFO ] Computed 2 invariants in 7 ms
[2024-05-27 07:30:43] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-27 07:30:43] [INFO ] Invariant cache hit.
[2024-05-27 07:30:43] [INFO ] State equation strengthened by 124 read => feed constraints.
[2024-05-27 07:30:43] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 176/2385 places, 275/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47465 ms. Remains : 176/2385 places, 275/11934 transitions.
Support contains 33 out of 176 places after structural reductions.
[2024-05-27 07:30:43] [INFO ] Flatten gal took : 56 ms
[2024-05-27 07:30:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:30:43] [INFO ] Flatten gal took : 25 ms
[2024-05-27 07:30:43] [INFO ] Input system was already deterministic with 275 transitions.
Support contains 19 out of 176 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (6958 resets) in 2538 ms. (15 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (1516 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1697 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1646 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1690 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1559 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1633 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1716 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (6664 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1586 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1691 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
[2024-05-27 07:30:45] [INFO ] Invariant cache hit.
[2024-05-27 07:30:45] [INFO ] State equation strengthened by 124 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/23 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/73 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 174/247 variables, 73/75 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 23/98 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 8 (OVERLAPS) 200/447 variables, 99/197 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 101/298 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/298 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/451 variables, 4/302 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/451 variables, 0/302 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/451 variables, 0/302 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 302 constraints, problems are : Problem set: 9 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 154/156 variables, 3/4 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/5 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/215 variables, 1/7 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 27/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/219 variables, 1/35 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 1/36 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 228/447 variables, 140/176 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 123/299 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/299 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/451 variables, 4/303 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 0/303 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/451 variables, 0/303 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 303 constraints, problems are : Problem set: 9 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 9 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:30:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-27 07:30:45] [INFO ] Flatten gal took : 15 ms
[2024-05-27 07:30:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:30:45] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:30:45] [INFO ] Input system was already deterministic with 275 transitions.
Support contains 8 out of 176 places (down from 10) after GAL structural reductions.
Computed a total of 24 stabilizing places and 79 stable transitions
Graph (complete) has 634 edges and 176 vertex of which 173 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 275/275 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 174 transition count 273
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 29 place count 149 transition count 248
Iterating global reduction 1 with 25 rules applied. Total rules applied 54 place count 149 transition count 248
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 71 place count 149 transition count 231
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 141 transition count 223
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 141 transition count 223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 141 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 140 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 140 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 139 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 139 transition count 201
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 135 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 135 transition count 197
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 119 place count 135 transition count 185
Applied a total of 119 rules in 15 ms. Remains 135 /176 variables (removed 41) and now considering 185/275 (removed 90) transitions.
// Phase 1: matrix 185 rows 135 cols
[2024-05-27 07:30:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:30:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 07:30:45] [INFO ] Invariant cache hit.
[2024-05-27 07:30:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-27 07:30:45] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-27 07:30:45] [INFO ] Invariant cache hit.
[2024-05-27 07:30:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/320 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 74/211 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 211 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5396 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/320 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 74/211 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 184/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 395 constraints, problems are : Problem set: 0 solved, 184 unsolved in 9898 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 15524ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 15528ms
Starting structural reductions in LTL mode, iteration 1 : 135/176 places, 185/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15816 ms. Remains : 135/176 places, 185/275 transitions.
[2024-05-27 07:31:01] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:31:01] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:31:01] [INFO ] Input system was already deterministic with 185 transitions.
[2024-05-27 07:31:01] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:31:01] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:31:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality5793140482515345573.gal : 5 ms
[2024-05-27 07:31:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality2258857294900121037.ctl : 3 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/CTLCardinality5793140482515345573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2258857294900121037.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28116e+08,0.603519,25612,2,7714,5,67379,6,0,725,62614,0


Converting to forward existential form...Done !
original formula: EG(AX((l2932<=p297)))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((l2932<=p297)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t22, t23, t24, t25, t26, t27, t28,...635
(forward)formula 0,1,11.188,327920,1,0,617,1.29696e+06,393,297,5035,1.41678e+06,576
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 275/275 transitions.
Graph (complete) has 634 edges and 176 vertex of which 174 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 174 transition count 273
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 148 transition count 247
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 148 transition count 247
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 73 place count 148 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 140 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 140 transition count 221
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 140 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 138 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 137 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 137 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 137 transition count 185
Applied a total of 104 rules in 31 ms. Remains 137 /176 variables (removed 39) and now considering 185/275 (removed 90) transitions.
// Phase 1: matrix 185 rows 137 cols
[2024-05-27 07:31:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:31:12] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-27 07:31:12] [INFO ] Invariant cache hit.
[2024-05-27 07:31:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:31:13] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-27 07:31:13] [INFO ] Redundant transitions in 7 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-27 07:31:13] [INFO ] Invariant cache hit.
[2024-05-27 07:31:13] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 210 constraints, problems are : Problem set: 0 solved, 184 unsolved in 4910 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/322 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 71/210 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 184/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 394 constraints, problems are : Problem set: 0 solved, 184 unsolved in 9392 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 14528ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14529ms
Starting structural reductions in SI_CTL mode, iteration 1 : 137/176 places, 185/275 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14854 ms. Remains : 137/176 places, 185/275 transitions.
[2024-05-27 07:31:27] [INFO ] Flatten gal took : 16 ms
[2024-05-27 07:31:27] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:31:27] [INFO ] Input system was already deterministic with 185 transitions.
[2024-05-27 07:31:27] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:31:27] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:31:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3754420353889176719.gal : 2 ms
[2024-05-27 07:31:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7320731418847584329.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/CTLCardinality3754420353889176719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7320731418847584329.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47604e+08,0.755638,30144,2,7705,5,86965,6,0,733,68672,0


Converting to forward existential form...Done !
original formula: EG(EF((p243<=0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p243<=0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t33, t34, t35, t38, t47, t50, t56, t61, t69, t70, t71, t72, t73,...592
(forward)formula 0,1,12.5088,340924,1,0,584,1.3467e+06,397,296,5190,1.41131e+06,582
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 275/275 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 174 transition count 273
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 29 place count 149 transition count 248
Iterating global reduction 1 with 25 rules applied. Total rules applied 54 place count 149 transition count 248
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 71 place count 149 transition count 231
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 141 transition count 223
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 141 transition count 223
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 141 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 140 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 140 transition count 202
Applied a total of 97 rules in 6 ms. Remains 140 /176 variables (removed 36) and now considering 202/275 (removed 73) transitions.
// Phase 1: matrix 202 rows 140 cols
[2024-05-27 07:31:40] [INFO ] Computed 2 invariants in 6 ms
[2024-05-27 07:31:40] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 07:31:40] [INFO ] Invariant cache hit.
[2024-05-27 07:31:40] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-27 07:31:40] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-27 07:31:40] [INFO ] Invariant cache hit.
[2024-05-27 07:31:40] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/342 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 86/228 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 0/342 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 228 constraints, problems are : Problem set: 0 solved, 201 unsolved in 5752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/342 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 86/228 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 201/429 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-27 07:31:52] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 430 constraints, problems are : Problem set: 0 solved, 201 unsolved in 16948 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 1/1 constraints]
After SMT, in 22955ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 22958ms
Starting structural reductions in LTL mode, iteration 1 : 140/176 places, 202/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23311 ms. Remains : 140/176 places, 202/275 transitions.
[2024-05-27 07:32:03] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:32:03] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:32:03] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-27 07:32:03] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:32:03] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:32:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality10792210707700375056.gal : 7 ms
[2024-05-27 07:32:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15044521241083339016.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/CTLCardinality10792210707700375056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15044521241083339016.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47252e+08,2.45457,77224,2,15373,5,162736,6,0,762,156725,0


Converting to forward existential form...Done !
original formula: (AG(AX((p921<=l3435))) * AX(FALSE))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !((p921<=l3435)))] = FALSE * [(EY(Init) * !(FALSE))] = FALSE)
(forward)formula 0,0,2.46183,77224,1,0,6,162736,7,1,1048,156725,1
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 275/275 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 174 transition count 273
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 30 place count 148 transition count 247
Iterating global reduction 1 with 26 rules applied. Total rules applied 56 place count 148 transition count 247
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 73 place count 148 transition count 230
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 139 transition count 221
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 139 transition count 221
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 100 place count 139 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 137 transition count 186
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 136 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 136 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 136 transition count 184
Applied a total of 107 rules in 6 ms. Remains 136 /176 variables (removed 40) and now considering 184/275 (removed 91) transitions.
// Phase 1: matrix 184 rows 136 cols
[2024-05-27 07:32:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 07:32:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-27 07:32:06] [INFO ] Invariant cache hit.
[2024-05-27 07:32:06] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:32:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-27 07:32:06] [INFO ] Invariant cache hit.
[2024-05-27 07:32:06] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/320 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 71/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 209 constraints, problems are : Problem set: 0 solved, 183 unsolved in 5451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/320 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 71/209 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 183/392 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-27 07:32:16] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/320 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 393 constraints, problems are : Problem set: 0 solved, 183 unsolved in 13132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 1/1 constraints]
After SMT, in 18781ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 18783ms
Starting structural reductions in LTL mode, iteration 1 : 136/176 places, 184/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19078 ms. Remains : 136/176 places, 184/275 transitions.
[2024-05-27 07:32:25] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:32:25] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:32:25] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-27 07:32:25] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:32:25] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:32:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality7622497116777022488.gal : 2 ms
[2024-05-27 07:32:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13029913832148904837.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/CTLCardinality7622497116777022488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13029913832148904837.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47252e+08,0.756262,29604,2,7588,5,86533,6,0,728,67071,0


Converting to forward existential form...Done !
original formula: EG(AX(AF((l2827<=0))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!((l2827<=0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t32, t33, t34, t35, t38, t47, t50, t56, t61, t69, t70, t71, t72,...591
(forward)formula 0,1,13.8827,372728,1,0,710,1.54572e+06,395,339,5052,1.58242e+06,709
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 275/275 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 175 transition count 274
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 149 transition count 248
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 149 transition count 248
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 71 place count 149 transition count 231
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 140 transition count 222
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 140 transition count 222
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 98 place count 140 transition count 213
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 138 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 137 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 137 transition count 186
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 133 transition count 182
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 133 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 120 place count 133 transition count 174
Applied a total of 120 rules in 21 ms. Remains 133 /176 variables (removed 43) and now considering 174/275 (removed 101) transitions.
// Phase 1: matrix 174 rows 133 cols
[2024-05-27 07:32:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:32:39] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:32:39] [INFO ] Invariant cache hit.
[2024-05-27 07:32:39] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-27 07:32:39] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-27 07:32:39] [INFO ] Invariant cache hit.
[2024-05-27 07:32:39] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/306 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 1/307 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 199 constraints, problems are : Problem set: 0 solved, 173 unsolved in 7952 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/306 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 39/237 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 1/307 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 134/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (OVERLAPS) 0/307 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 372 constraints, problems are : Problem set: 0 solved, 173 unsolved in 12177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 20317ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 20321ms
Starting structural reductions in LTL mode, iteration 1 : 133/176 places, 174/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20633 ms. Remains : 133/176 places, 174/275 transitions.
[2024-05-27 07:33:00] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:33:00] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:33:00] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-27 07:33:00] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:33:00] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:33:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13489068064790127117.gal : 1 ms
[2024-05-27 07:33:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13363769192390467550.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/CTLCardinality13489068064790127117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13363769192390467550.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28825e+08,1.17325,41460,2,11457,5,104792,6,0,703,99576,0


Converting to forward existential form...Done !
original formula: AF(((p1078>=1) * EX((l2883<=0))))
=> equivalent forward existential formula: [FwdG(Init,!(((p1078>=1) * EX((l2883<=0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t11, t12, t13, t14, t15, t16, t17, t18, t23, t24, t25, t26, t27, t36, t37, t38, t39,...565
(forward)formula 0,0,10.3349,294068,1,0,391,934274,369,149,5027,900274,414
FORMULA RingSingleMessageInMbox-PT-d1m010-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-27 07:33:10] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:33:10] [INFO ] Flatten gal took : 8 ms
Total runtime 195210 ms.

BK_STOP 1716795190624

--------------------
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="RingSingleMessageInMbox-PT-d1m010"
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 RingSingleMessageInMbox-PT-d1m010, 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 r334-tall-171679079500065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m010.tgz
mv RingSingleMessageInMbox-PT-d1m010 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 ;