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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 23:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 12 23:37 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-d1m020-CTLCardinality-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716795394235

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-d1m020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-27 07:36:35] [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:36:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:36:35] [INFO ] Load time of PNML (sax parser for PT used): 434 ms
[2024-05-27 07:36:35] [INFO ] Transformed 6690 places.
[2024-05-27 07:36:35] [INFO ] Transformed 11934 transitions.
[2024-05-27 07:36:35] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 605 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 4305 places in 55 ms
Reduce places removed 4305 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 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 1102 places :
Symmetric choice reduction at 1 with 1102 rule applications. Total rules 1221 place count 1266 transition count 2698
Iterating global reduction 1 with 1102 rules applied. Total rules applied 2323 place count 1266 transition count 2698
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 2407 place count 1266 transition count 2614
Discarding 927 places :
Symmetric choice reduction at 2 with 927 rule applications. Total rules 3334 place count 339 transition count 1687
Iterating global reduction 2 with 927 rules applied. Total rules applied 4261 place count 339 transition count 1687
Ensure Unique test removed 1103 transitions
Reduce isomorphic transitions removed 1103 transitions.
Iterating post reduction 2 with 1103 rules applied. Total rules applied 5364 place count 339 transition count 584
Discarding 126 places :
Symmetric choice reduction at 3 with 126 rule applications. Total rules 5490 place count 213 transition count 458
Iterating global reduction 3 with 126 rules applied. Total rules applied 5616 place count 213 transition count 458
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 3 with 118 rules applied. Total rules applied 5734 place count 213 transition count 340
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 5742 place count 205 transition count 332
Iterating global reduction 4 with 8 rules applied. Total rules applied 5750 place count 205 transition count 332
Applied a total of 5750 rules in 507 ms. Remains 205 /2385 variables (removed 2180) and now considering 332/11934 (removed 11602) transitions.
// Phase 1: matrix 332 rows 205 cols
[2024-05-27 07:36:36] [INFO ] Computed 3 invariants in 26 ms
[2024-05-27 07:36:37] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-27 07:36:37] [INFO ] Invariant cache hit.
[2024-05-27 07:36:37] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-05-27 07:36:37] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-05-27 07:36:37] [INFO ] Invariant cache hit.
[2024-05-27 07:36:37] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 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
At refinement iteration 4 (OVERLAPS) 332/537 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 139/347 constraints. Problems are: Problem set: 24 solved, 307 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 0/347 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/537 variables, 0/347 constraints. Problems are: Problem set: 24 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 347 constraints, problems are : Problem set: 24 solved, 307 unsolved in 13844 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 17/197 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 8/205 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 332/537 variables, 205/208 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 139/347 constraints. Problems are: Problem set: 24 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 307/654 constraints. Problems are: Problem set: 24 solved, 307 unsolved
[2024-05-27 07:37:01] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 15 ms to minimize.
[2024-05-27 07:37:02] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
[2024-05-27 07:37:03] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
[2024-05-27 07:37:03] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
[2024-05-27 07:37:07] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2024-05-27 07:37:07] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 6/660 constraints. Problems are: Problem set: 46 solved, 285 unsolved
[2024-05-27 07:37:18] [INFO ] Deduced a trap composed of 101 places in 62 ms of which 1 ms to minimize.
[2024-05-27 07:37:18] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 2/662 constraints. Problems are: Problem set: 46 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/537 variables, and 662 constraints, problems are : Problem set: 46 solved, 285 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 205/205 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 307/331 constraints, Known Traps: 8/8 constraints]
After SMT, in 44780ms problems are : Problem set: 46 solved, 285 unsolved
Search for dead transitions found 46 dead transitions in 44796ms
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 : 205/2385 places, 286/11934 transitions.
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 164 transition count 269
Applied a total of 58 rules in 6 ms. Remains 164 /205 variables (removed 41) and now considering 269/286 (removed 17) transitions.
// Phase 1: matrix 269 rows 164 cols
[2024-05-27 07:37:22] [INFO ] Computed 2 invariants in 5 ms
[2024-05-27 07:37:22] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-27 07:37:22] [INFO ] Invariant cache hit.
[2024-05-27 07:37:22] [INFO ] State equation strengthened by 131 read => feed constraints.
[2024-05-27 07:37:23] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/2385 places, 269/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46844 ms. Remains : 164/2385 places, 269/11934 transitions.
Support contains 17 out of 164 places after structural reductions.
[2024-05-27 07:37:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-27 07:37:23] [INFO ] Flatten gal took : 43 ms
[2024-05-27 07:37:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:37:23] [INFO ] Flatten gal took : 39 ms
[2024-05-27 07:37:23] [INFO ] Input system was already deterministic with 269 transitions.
Support contains 12 out of 164 places (down from 17) after GAL structural reductions.
RANDOM walk for 40000 steps (7118 resets) in 2359 ms. (16 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40003 steps (1657 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1966 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1731 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1752 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
[2024-05-27 07:37:24] [INFO ] Invariant cache hit.
[2024-05-27 07:37:24] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 200/218 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 61/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 56/274 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 27/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 4/278 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 433/433 variables, and 227 constraints, problems are : Problem set: 5 solved, 0 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 61/131 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 211ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:37:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 07:37:24] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:37:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:37:24] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:37:24] [INFO ] Input system was already deterministic with 269 transitions.
Support contains 4 out of 164 places (down from 5) after GAL structural reductions.
Computed a total of 22 stabilizing places and 91 stable transitions
Graph (complete) has 604 edges and 164 vertex of which 162 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 269/269 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 163 transition count 268
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 148 transition count 239
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 148 transition count 239
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 42 place count 148 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 143 transition count 224
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 143 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 143 transition count 220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 138 transition count 203
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 138 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 70 place count 138 transition count 199
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 137 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 136 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 136 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 136 transition count 184
Applied a total of 75 rules in 20 ms. Remains 136 /164 variables (removed 28) and now considering 184/269 (removed 85) transitions.
// Phase 1: matrix 184 rows 136 cols
[2024-05-27 07:37:24] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 07:37:24] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 07:37:24] [INFO ] Invariant cache hit.
[2024-05-27 07:37:24] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:37:24] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-27 07:37:24] [INFO ] Invariant cache hit.
[2024-05-27 07:37:24] [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
All remaining problems are real, not stopping.
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 4964 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
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 392 constraints, problems are : Problem set: 0 solved, 183 unsolved in 9926 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]
After SMT, in 15163ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 15167ms
Starting structural reductions in LTL mode, iteration 1 : 136/164 places, 184/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15482 ms. Remains : 136/164 places, 184/269 transitions.
[2024-05-27 07:37:40] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:37:40] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:37:40] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-27 07:37:40] [INFO ] Flatten gal took : 16 ms
[2024-05-27 07:37:40] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:37:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8695895772076113175.gal : 10 ms
[2024-05-27 07:37:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality4443759370043881285.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/CTLCardinality8695895772076113175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4443759370043881285.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,2.02032e+11,2.14209,62168,2,16075,5,245475,6,0,728,222414,0


Converting to forward existential form...Done !
original formula: EX(EX((l2986<=0)))
=> equivalent forward existential formula: [(EY(EY(Init)) * (l2986<=0))] != FALSE
(forward)formula 0,1,2.15287,62168,1,0,9,245475,8,1,1007,222414,3
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 269/269 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 163 transition count 268
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 147 transition count 238
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 147 transition count 238
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 45 place count 147 transition count 227
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 142 transition count 222
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 142 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 142 transition count 218
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 136 transition count 188
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 136 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 75 place count 136 transition count 184
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 77 place count 134 transition count 170
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 134 transition count 170
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 84 place count 129 transition count 165
Iterating global reduction 4 with 5 rules applied. Total rules applied 89 place count 129 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 94 place count 129 transition count 160
Applied a total of 94 rules in 9 ms. Remains 129 /164 variables (removed 35) and now considering 160/269 (removed 109) transitions.
// Phase 1: matrix 160 rows 129 cols
[2024-05-27 07:37:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:37:42] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-27 07:37:42] [INFO ] Invariant cache hit.
[2024-05-27 07:37:42] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 07:37:42] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-27 07:37:42] [INFO ] Invariant cache hit.
[2024-05-27 07:37:42] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 3963 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 343 constraints, problems are : Problem set: 0 solved, 159 unsolved in 7816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 11979ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 11982ms
Starting structural reductions in LTL mode, iteration 1 : 129/164 places, 160/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12286 ms. Remains : 129/164 places, 160/269 transitions.
[2024-05-27 07:37:54] [INFO ] Flatten gal took : 12 ms
[2024-05-27 07:37:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:37:54] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-27 07:37:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:37:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:37:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality1234329635099790315.gal : 3 ms
[2024-05-27 07:37:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality6866352250665149392.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/CTLCardinality1234329635099790315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6866352250665149392.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.81002e+11,1.95952,56712,2,14937,5,235366,6,0,676,234210,0


Converting to forward existential form...Done !
original formula: AG(AX(FALSE))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(FALSE))] = FALSE
(forward)formula 0,0,2.30009,56712,1,0,6,235366,7,1,1431,234210,1
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 269/269 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 163 transition count 268
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 148 transition count 239
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 148 transition count 239
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 43 place count 148 transition count 228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 144 transition count 224
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 144 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 144 transition count 221
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 59 place count 139 transition count 204
Iterating global reduction 3 with 5 rules applied. Total rules applied 64 place count 139 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 68 place count 139 transition count 200
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 138 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 138 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 137 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 137 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 137 transition count 185
Applied a total of 73 rules in 8 ms. Remains 137 /164 variables (removed 27) and now considering 185/269 (removed 84) transitions.
// Phase 1: matrix 185 rows 137 cols
[2024-05-27 07:37:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:37:57] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 07:37:57] [INFO ] Invariant cache hit.
[2024-05-27 07:37:57] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-27 07:37:57] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2024-05-27 07:37:57] [INFO ] Invariant cache hit.
[2024-05-27 07:37:57] [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
All remaining problems are real, not stopping.
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 4843 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 10068 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 15129ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 15132ms
Starting structural reductions in LTL mode, iteration 1 : 137/164 places, 185/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15451 ms. Remains : 137/164 places, 185/269 transitions.
[2024-05-27 07:38:12] [INFO ] Flatten gal took : 11 ms
[2024-05-27 07:38:12] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:38:12] [INFO ] Input system was already deterministic with 185 transitions.
[2024-05-27 07:38:12] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:38:12] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:38:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality7141292071240234770.gal : 2 ms
[2024-05-27 07:38:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2372680026377995905.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/CTLCardinality7141292071240234770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2372680026377995905.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,2.02309e+11,2.21044,65252,2,15924,5,244903,6,0,733,213895,0


Converting to forward existential form...Done !
original formula: (EX(AG((p892<1))) * EX(TRUE))
=> equivalent forward existential formula: [(EY((Init * EX(!(E(TRUE U !((p892<1))))))) * TRUE)] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t16, t17, t18, t19, t33, t34, t35, t38, t47, t50, t56, t61, t68, t69, t71, t72, t73,...592
(forward)formula 0,0,12.696,305960,1,0,363,1.13846e+06,392,159,5217,840141,397
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 269/269 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 163 transition count 268
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 147 transition count 238
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 147 transition count 238
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 45 place count 147 transition count 227
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 142 transition count 222
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 142 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 142 transition count 218
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 136 transition count 188
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 136 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 75 place count 136 transition count 184
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 77 place count 134 transition count 170
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 134 transition count 170
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 84 place count 129 transition count 165
Iterating global reduction 4 with 5 rules applied. Total rules applied 89 place count 129 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 94 place count 129 transition count 160
Applied a total of 94 rules in 6 ms. Remains 129 /164 variables (removed 35) and now considering 160/269 (removed 109) transitions.
// Phase 1: matrix 160 rows 129 cols
[2024-05-27 07:38:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:38:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-27 07:38:25] [INFO ] Invariant cache hit.
[2024-05-27 07:38:25] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-27 07:38:25] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-27 07:38:25] [INFO ] Invariant cache hit.
[2024-05-27 07:38:25] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4125 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/289 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 343 constraints, problems are : Problem set: 0 solved, 159 unsolved in 7890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 0/0 constraints]
After SMT, in 12182ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 12185ms
Starting structural reductions in LTL mode, iteration 1 : 129/164 places, 160/269 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12436 ms. Remains : 129/164 places, 160/269 transitions.
[2024-05-27 07:38:37] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:38:37] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:38:37] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-27 07:38:37] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:38:37] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:38:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality209341312187623923.gal : 1 ms
[2024-05-27 07:38:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16560764625905028721.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/CTLCardinality209341312187623923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16560764625905028721.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.81002e+11,1.86798,56424,2,14937,5,235366,6,0,676,234210,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.87295,56424,1,0,6,235366,7,1,921,234210,1
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 269/269 transitions.
Graph (complete) has 604 edges and 164 vertex of which 163 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 268
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 149 transition count 240
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 149 transition count 240
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 39 place count 149 transition count 231
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 144 transition count 226
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 144 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 53 place count 144 transition count 222
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 59 place count 138 transition count 192
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 138 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 69 place count 138 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 137 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 137 transition count 187
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 75 place count 133 transition count 183
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 133 transition count 183
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 87 place count 133 transition count 175
Applied a total of 87 rules in 50 ms. Remains 133 /164 variables (removed 31) and now considering 175/269 (removed 94) transitions.
// Phase 1: matrix 175 rows 133 cols
[2024-05-27 07:38:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 07:38:39] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 07:38:39] [INFO ] Invariant cache hit.
[2024-05-27 07:38:39] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-27 07:38:40] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-27 07:38:40] [INFO ] Redundant transitions in 9 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-27 07:38:40] [INFO ] Invariant cache hit.
[2024-05-27 07:38:40] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/308 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 65/200 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 200 constraints, problems are : Problem set: 0 solved, 174 unsolved in 4861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/308 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 65/200 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 174/374 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 374 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 14078ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 14080ms
Starting structural reductions in SI_CTL mode, iteration 1 : 133/164 places, 175/269 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14450 ms. Remains : 133/164 places, 175/269 transitions.
[2024-05-27 07:38:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:38:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:38:54] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-27 07:38:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:38:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 07:38:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality11572385160258180066.gal : 2 ms
[2024-05-27 07:38:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality3378509384055084657.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/CTLCardinality11572385160258180066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3378509384055084657.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.81002e+11,6.19347,167480,2,26289,5,452056,6,0,707,398011,0


Converting to forward existential form...Done !
original formula: AF(!(A(AG((l2862<=0)) U (l2465<=0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((l2465<=0)) U (!(!(E(TRUE U !((l2862<=0))))) * !((l2465<=0)))) + EG(!((l2465<=0))))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t13, t14, t15, t16, t17, t18, t19, t24, t25, t26, t27, t28, t34, t38, t39, t40,...570
Detected timeout of ITS tools.
[2024-05-27 07:39:24] [INFO ] Flatten gal took : 5 ms
[2024-05-27 07:39:24] [INFO ] Applying decomposition
[2024-05-27 07:39:24] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3997680991581074231.txt' '-o' '/tmp/graph3997680991581074231.bin' '-w' '/tmp/graph3997680991581074231.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3997680991581074231.bin' '-l' '-1' '-v' '-w' '/tmp/graph3997680991581074231.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:39:24] [INFO ] Decomposing Gal with order
[2024-05-27 07:39:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:39:24] [INFO ] Removed a total of 181 redundant transitions.
[2024-05-27 07:39:24] [INFO ] Flatten gal took : 68 ms
[2024-05-27 07:39:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 27 ms.
[2024-05-27 07:39:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1757155680169126265.gal : 5 ms
[2024-05-27 07:39:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12190866968657038620.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/CTLCardinality1757155680169126265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12190866968657038620.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.81002e+11,26.5409,511740,3969,2876,286887,62432,462,4.66568e+06,140,1.4577e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-27 07:39:54] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:39:54] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:39:54] [INFO ] Applying decomposition
[2024-05-27 07:39:54] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14268438959228719979.txt' '-o' '/tmp/graph14268438959228719979.bin' '-w' '/tmp/graph14268438959228719979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14268438959228719979.bin' '-l' '-1' '-v' '-w' '/tmp/graph14268438959228719979.weights' '-q' '0' '-e' '0.001'
[2024-05-27 07:39:54] [INFO ] Decomposing Gal with order
[2024-05-27 07:39:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 07:39:54] [INFO ] Removed a total of 317 redundant transitions.
[2024-05-27 07:39:54] [INFO ] Flatten gal took : 52 ms
[2024-05-27 07:39:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 23 ms.
[2024-05-27 07:39:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality4212562659414950107.gal : 11 ms
[2024-05-27 07:39:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14854928034863518417.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/CTLCardinality4212562659414950107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14854928034863518417.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-27 07:48:01] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:48:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality4157098017698192883.gal : 2 ms
[2024-05-27 07:48:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality15042526727502787592.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/CTLCardinality4157098017698192883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15042526727502787592.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.2758e+11,15.2266,340308,2,33174,5,820350,6,0,922,547041,0


Converting to forward existential form...Done !
original formula: AF(!(A(AG((l2862<=0)) U (l2465<=0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!((l2465<=0)) U (!(!(E(TRUE U !((l2862<=0))))) * !((l2465<=0)))) + EG(!((l2465<=0))))))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t19, t20, t21, t22, t23, t24, t25, t27, t28, t29, t30, t31, t33, t34, t35, t36, t37,...964
(forward)formula 0,0,191.002,2240244,1,0,789,7.17608e+06,13,335,2917,8.35144e+06,126
FORMULA RingSingleMessageInMbox-PT-d1m020-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Total runtime 878398 ms.

BK_STOP 1716796273822

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

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