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.r378-smll-171683810800105.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 SieveSingleMsgMbox-PT-d2m06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810800105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716929915099

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 20:58:37] [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-28 20:58:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:58:38] [INFO ] Load time of PNML (sax parser for PT used): 422 ms
[2024-05-28 20:58:38] [INFO ] Transformed 2398 places.
[2024-05-28 20:58:38] [INFO ] Transformed 1954 transitions.
[2024-05-28 20:58:38] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 608 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Deduced a syphon composed of 1984 places in 25 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 792 transitions
Reduce isomorphic transitions removed 792 transitions.
Iterating post reduction 0 with 816 rules applied. Total rules applied 816 place count 390 transition count 1162
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 933 place count 273 transition count 411
Iterating global reduction 1 with 117 rules applied. Total rules applied 1050 place count 273 transition count 411
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1060 place count 273 transition count 401
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1151 place count 182 transition count 310
Iterating global reduction 2 with 91 rules applied. Total rules applied 1242 place count 182 transition count 310
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1277 place count 182 transition count 275
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1312 place count 147 transition count 228
Iterating global reduction 3 with 35 rules applied. Total rules applied 1347 place count 147 transition count 228
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 1375 place count 147 transition count 200
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1383 place count 139 transition count 187
Iterating global reduction 4 with 8 rules applied. Total rules applied 1391 place count 139 transition count 187
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1399 place count 131 transition count 179
Iterating global reduction 4 with 8 rules applied. Total rules applied 1407 place count 131 transition count 179
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1412 place count 126 transition count 173
Iterating global reduction 4 with 5 rules applied. Total rules applied 1417 place count 126 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1420 place count 126 transition count 170
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1424 place count 122 transition count 166
Iterating global reduction 5 with 4 rules applied. Total rules applied 1428 place count 122 transition count 166
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1431 place count 119 transition count 163
Iterating global reduction 5 with 3 rules applied. Total rules applied 1434 place count 119 transition count 163
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1435 place count 118 transition count 162
Iterating global reduction 5 with 1 rules applied. Total rules applied 1436 place count 118 transition count 162
Applied a total of 1436 rules in 155 ms. Remains 118 /414 variables (removed 296) and now considering 162/1954 (removed 1792) transitions.
// Phase 1: matrix 162 rows 118 cols
[2024-05-28 20:58:38] [INFO ] Computed 5 invariants in 28 ms
[2024-05-28 20:58:38] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-28 20:58:38] [INFO ] Invariant cache hit.
[2024-05-28 20:58:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-28 20:58:39] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-28 20:58:39] [INFO ] Invariant cache hit.
[2024-05-28 20:58:39] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-28 20:58:42] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 19 ms to minimize.
[2024-05-28 20:58:42] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-28 20:58:44] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 20:58:44] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 20:58:44] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-05-28 20:58:44] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-28 20:58:44] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:58:44] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-28 20:58:46] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 162/279 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 78/209 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-28 20:58:48] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 2 ms to minimize.
[2024-05-28 20:58:48] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 2/211 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 13 (OVERLAPS) 1/280 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/212 constraints. Problems are: Problem set: 3 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 212 constraints, problems are : Problem set: 3 solved, 158 unsolved in 20121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 118/118 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 3 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 4/117 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 6/16 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 162/279 variables, 117/133 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 78/211 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 119/330 constraints. Problems are: Problem set: 3 solved, 158 unsolved
[2024-05-28 20:59:05] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 1/331 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/331 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 12 (OVERLAPS) 1/280 variables, 1/332 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 39/371 constraints. Problems are: Problem set: 3 solved, 158 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 371 constraints, problems are : Problem set: 3 solved, 158 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 118/118 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 158/161 constraints, Known Traps: 12/12 constraints]
After SMT, in 50907ms problems are : Problem set: 3 solved, 158 unsolved
Search for dead transitions found 3 dead transitions in 50939ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 118/414 places, 159/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 159
Applied a total of 3 rules in 12 ms. Remains 115 /118 variables (removed 3) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 115 cols
[2024-05-28 20:59:30] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 20:59:30] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-28 20:59:30] [INFO ] Invariant cache hit.
[2024-05-28 20:59:30] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-28 20:59:31] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 115/414 places, 159/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52860 ms. Remains : 115/414 places, 159/1954 transitions.
Support contains 5 out of 115 places after structural reductions.
[2024-05-28 20:59:31] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-28 20:59:31] [INFO ] Flatten gal took : 57 ms
[2024-05-28 20:59:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:59:31] [INFO ] Flatten gal took : 25 ms
[2024-05-28 20:59:31] [INFO ] Input system was already deterministic with 159 transitions.
Support contains 1 out of 115 places (down from 5) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8961 resets) in 1893 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4090 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
Probably explored full state space saw : 144161 states, properties seen :0
Probabilistic random walk after 376803 steps, saw 144161 distinct states, run finished after 577 ms. (steps per millisecond=653 ) properties seen :0
Explored full state space saw : 144161 states, properties seen :0
Exhaustive walk after 376803 steps, saw 144161 distinct states, run finished after 453 ms. (steps per millisecond=831 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:59:33] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:59:33] [INFO ] Flatten gal took : 15 ms
[2024-05-28 20:59:33] [INFO ] Input system was already deterministic with 159 transitions.
Computed a total of 24 stabilizing places and 32 stable transitions
Graph (complete) has 390 edges and 115 vertex of which 113 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 159/159 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 110 transition count 129
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 110 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 110 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 107 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 107 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 107 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 24 place count 104 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 104 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 104 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 32 place count 101 transition count 111
Iterating global reduction 4 with 3 rules applied. Total rules applied 35 place count 101 transition count 111
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 38 place count 98 transition count 108
Iterating global reduction 4 with 3 rules applied. Total rules applied 41 place count 98 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 43 place count 96 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 96 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 47 place count 95 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 95 transition count 104
Applied a total of 48 rules in 19 ms. Remains 95 /115 variables (removed 20) and now considering 104/159 (removed 55) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-28 20:59:33] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 20:59:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 20:59:33] [INFO ] Invariant cache hit.
[2024-05-28 20:59:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 20:59:33] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-28 20:59:33] [INFO ] Invariant cache hit.
[2024-05-28 20:59:33] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-28 20:59:35] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 6 (OVERLAPS) 104/199 variables, 95/100 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 40/140 constraints. Problems are: Problem set: 3 solved, 100 unsolved
[2024-05-28 20:59:37] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 141 constraints, problems are : Problem set: 3 solved, 100 unsolved in 7309 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 2/94 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 104/198 variables, 94/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 16/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 1/199 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 84/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 3 solved, 100 unsolved in 12397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 19914ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 19917ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 95/115 places, 101/159 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 3 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2024-05-28 20:59:53] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 20:59:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-28 20:59:53] [INFO ] Invariant cache hit.
[2024-05-28 20:59:53] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 20:59:54] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/115 places, 101/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20741 ms. Remains : 92/115 places, 101/159 transitions.
[2024-05-28 20:59:54] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:59:54] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:59:54] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-28 20:59:54] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:59:54] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:59:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality3733351464748979568.gal : 5 ms
[2024-05-28 20:59:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2334912189915614772.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/CTLCardinality3733351464748979568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2334912189915614772.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,75566,0.642352,22336,2,2668,5,61987,6,0,469,35045,0


Converting to forward existential form...Done !
original formula: AX(AX(FALSE))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(FALSE))] = FALSE
(forward)formula 0,0,0.646063,22336,1,0,7,61987,7,1,644,35045,2
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 159/159 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 114 transition count 156
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 110 transition count 129
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 110 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 110 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 107 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 107 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 107 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 24 place count 104 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 104 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 104 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 32 place count 101 transition count 111
Iterating global reduction 4 with 3 rules applied. Total rules applied 35 place count 101 transition count 111
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 38 place count 98 transition count 108
Iterating global reduction 4 with 3 rules applied. Total rules applied 41 place count 98 transition count 108
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 43 place count 96 transition count 106
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 96 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 47 place count 95 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 48 place count 95 transition count 104
Applied a total of 48 rules in 18 ms. Remains 95 /115 variables (removed 20) and now considering 104/159 (removed 55) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-28 20:59:54] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 20:59:55] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 20:59:55] [INFO ] Invariant cache hit.
[2024-05-28 20:59:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 20:59:55] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-28 20:59:55] [INFO ] Invariant cache hit.
[2024-05-28 20:59:55] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-28 20:59:57] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 6 (OVERLAPS) 104/199 variables, 95/100 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 40/140 constraints. Problems are: Problem set: 3 solved, 100 unsolved
[2024-05-28 20:59:59] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 1/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 141 constraints, problems are : Problem set: 3 solved, 100 unsolved in 7717 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 2/94 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 104/198 variables, 94/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 16/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 1/199 variables, 1/156 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 84/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 3 solved, 100 unsolved in 11605 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 19442ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 19444ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 95/115 places, 101/159 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 2 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2024-05-28 21:00:14] [INFO ] Computed 4 invariants in 5 ms
[2024-05-28 21:00:14] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 21:00:14] [INFO ] Invariant cache hit.
[2024-05-28 21:00:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 21:00:15] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/115 places, 101/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20206 ms. Remains : 92/115 places, 101/159 transitions.
[2024-05-28 21:00:15] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:00:15] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:00:15] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-28 21:00:15] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:00:15] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:00:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality16463707304833242667.gal : 5 ms
[2024-05-28 21:00:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality12799033599419730953.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/CTLCardinality16463707304833242667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12799033599419730953.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,75566,0.889767,22140,2,2668,5,61987,6,0,469,35045,0


Converting to forward existential form...Done !
original formula: AG(AF(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t38, t41, t69, t76, t77, t78, t79, t80, t81, t82, t83, t84, t88, t89, t92, t93, t95,...281
(forward)formula 0,0,1.69798,36100,1,0,223,120547,223,92,3119,84735,258
FORMULA SieveSingleMsgMbox-PT-d2m06-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-28 21:00:16] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:00:16] [INFO ] Flatten gal took : 10 ms
Total runtime 99459 ms.

BK_STOP 1716930017011

--------------------
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="SieveSingleMsgMbox-PT-d2m06"
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 SieveSingleMsgMbox-PT-d2m06, 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 r378-smll-171683810800105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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