Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994400481.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d2m64, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994400481
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.1M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2023-15
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1749188088790

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-d2m64
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-06 05:34:49] [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]
[2025-06-06 05:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 05:34:50] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-06 05:34:50] [INFO ] Transformed 2398 places.
[2025-06-06 05:34:50] [INFO ] Transformed 1954 transitions.
[2025-06-06 05:34:50] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 1984 places in 28 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 115 places :
Symmetric choice reduction at 1 with 115 rule applications. Total rules 968 place count 274 transition count 383
Iterating global reduction 1 with 115 rules applied. Total rules applied 1083 place count 274 transition count 383
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1093 place count 274 transition count 373
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 1180 place count 187 transition count 286
Iterating global reduction 2 with 87 rules applied. Total rules applied 1267 place count 187 transition count 286
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1305 place count 187 transition count 248
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1341 place count 151 transition count 198
Iterating global reduction 3 with 36 rules applied. Total rules applied 1377 place count 151 transition count 198
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1398 place count 151 transition count 177
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1407 place count 142 transition count 164
Iterating global reduction 4 with 9 rules applied. Total rules applied 1416 place count 142 transition count 164
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1425 place count 133 transition count 155
Iterating global reduction 4 with 9 rules applied. Total rules applied 1434 place count 133 transition count 155
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1439 place count 128 transition count 149
Iterating global reduction 4 with 5 rules applied. Total rules applied 1444 place count 128 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1446 place count 128 transition count 147
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1450 place count 124 transition count 143
Iterating global reduction 5 with 4 rules applied. Total rules applied 1454 place count 124 transition count 143
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1456 place count 122 transition count 141
Iterating global reduction 5 with 2 rules applied. Total rules applied 1458 place count 122 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1459 place count 121 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 1460 place count 121 transition count 140
Applied a total of 1460 rules in 104 ms. Remains 121 /414 variables (removed 293) and now considering 140/1954 (removed 1814) transitions.
// Phase 1: matrix 140 rows 121 cols
[2025-06-06 05:34:50] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:34:50] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-06-06 05:34:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:34:50] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-06 05:34:51] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-06 05:34:51] [INFO ] Invariant cache hit.
[2025-06-06 05:34:51] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:34:53] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:34:53] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 140/261 variables, 121/128 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:34:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 3 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:34:57] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 4 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD127 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:34:58] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:34:58] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 4/187 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/261 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 187 constraints, problems are : Problem set: 3 solved, 136 unsolved in 13969 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 121/121 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 4/121 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/11 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 140/261 variables, 121/132 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 55/187 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 136/323 constraints. Problems are: Problem set: 3 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:35:09] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/324 constraints. Problems are: Problem set: 3 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/324 constraints. Problems are: Problem set: 3 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/261 variables, and 324 constraints, problems are : Problem set: 3 solved, 136 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 121/121 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 136/139 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44176ms problems are : Problem set: 3 solved, 136 unsolved
Search for dead transitions found 3 dead transitions in 44185ms
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 : 121/414 places, 137/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 118 transition count 137
Applied a total of 3 rules in 2 ms. Remains 118 /121 variables (removed 3) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 118 cols
[2025-06-06 05:35:35] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:35:35] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-06 05:35:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:35:35] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-06 05:35:35] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 118/414 places, 137/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45383 ms. Remains : 118/414 places, 137/1954 transitions.
Support contains 6 out of 118 places after structural reductions.
[2025-06-06 05:35:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-06 05:35:35] [INFO ] Flatten gal took : 30 ms
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 05:35:35] [INFO ] Flatten gal took : 15 ms
[2025-06-06 05:35:35] [INFO ] Input system was already deterministic with 137 transitions.
Support contains 5 out of 118 places (down from 6) after GAL structural reductions.
RANDOM walk for 40000 steps (8993 resets) in 1438 ms. (27 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4094 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4164 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (4068 resets) in 117 ms. (338 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (4194 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3983 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 476410 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 5
Probabilistic random walk after 476410 steps, saw 224433 distinct states, run finished after 3005 ms. (steps per millisecond=158 ) properties seen :0
[2025-06-06 05:35:39] [INFO ] Invariant cache hit.
[2025-06-06 05:35:39] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 63/68 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/92 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 121/213 variables, 92/96 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 38/134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
At refinement iteration 8 (OVERLAPS) 42/255 variables, 26/160 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 16/176 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/176 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/176 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 176 constraints, problems are : Problem set: 4 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/66 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/90 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 119/209 variables, 90/94 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 36/130 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 1/131 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/131 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 46/255 variables, 28/159 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 18/177 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:35:39] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 1/178 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/178 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/255 variables, 0/178 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 178 constraints, problems are : Problem set: 4 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 137/137 transitions.
Graph (complete) has 339 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 117 transition count 135
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 112 transition count 129
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 112 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 112 transition count 128
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 108 transition count 124
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 108 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 23 place count 108 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 106 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 106 transition count 120
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 106 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 105 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 105 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 104 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 104 transition count 116
Applied a total of 33 rules in 30 ms. Remains 104 /118 variables (removed 14) and now considering 116/137 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 104/118 places, 116/137 transitions.
RANDOM walk for 40000 steps (9012 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4214 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2595536 steps, run timeout after 3001 ms. (steps per millisecond=864 ) properties seen :0 out of 1
Probabilistic random walk after 2595536 steps, saw 1211279 distinct states, run finished after 3001 ms. (steps per millisecond=864 ) properties seen :0
// Phase 1: matrix 116 rows 104 cols
[2025-06-06 05:35:43] [INFO ] Computed 3 invariants in 5 ms
[2025-06-06 05:35:43] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/63 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/140 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/181 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 27/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/220 variables, 23/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 16/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/220 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/63 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 77/140 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:35:43] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/181 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 27/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 39/220 variables, 23/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 16/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:35:43] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/220 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/220 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 116/116 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 104/104 places, 116/116 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2025-06-06 05:35:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:35:43] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 05:35:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:35:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-06 05:35:43] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 05:35:43] [INFO ] Redundant transitions in 4 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-06 05:35:43] [INFO ] Invariant cache hit.
[2025-06-06 05:35:43] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 4 (OVERLAPS) 116/220 variables, 104/107 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 43/150 constraints. Problems are: Problem set: 3 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 150 constraints, problems are : Problem set: 3 solved, 112 unsolved in 5675 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 115/216 variables, 101/104 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 42/146 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 14/160 constraints. Problems are: Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:35:51] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 1/161 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/161 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 4/220 variables, 3/164 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 98/263 constraints. Problems are: Problem set: 3 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:36:00] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 8 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:36:01] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 4 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 2/265 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 0/265 constraints. Problems are: Problem set: 12 solved, 103 unsolved
At refinement iteration 14 (OVERLAPS) 0/220 variables, 0/265 constraints. Problems are: Problem set: 12 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 265 constraints, problems are : Problem set: 12 solved, 103 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 104/104 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 112/115 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35761ms problems are : Problem set: 12 solved, 103 unsolved
Search for dead transitions found 12 dead transitions in 35762ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 104/116 transitions.
Graph (complete) has 269 edges and 104 vertex of which 1 are kept as prefixes of interest. Removing 103 places using SCC suffix rule.0 ms
Discarding 103 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 2 ms. Remains 1 /104 variables (removed 103) and now considering 0/104 (removed 104) transitions.
[2025-06-06 05:36:19] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:36:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-06 05:36:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:36:19] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/104 places, 0/116 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36116 ms. Remains : 1/104 places, 0/116 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 5 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 05:36:19] [INFO ] Flatten gal took : 8 ms
[2025-06-06 05:36:19] [INFO ] Flatten gal took : 8 ms
[2025-06-06 05:36:19] [INFO ] Input system was already deterministic with 137 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 46 stable transitions
Graph (complete) has 378 edges and 118 vertex of which 117 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 137/137 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 112 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 112 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 112 transition count 129
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 107 transition count 124
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 107 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 107 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 104 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 104 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 104 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 102 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 102 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 100 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 99 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 98 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 97 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 96 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 95 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 95 transition count 104
Applied a total of 51 rules in 29 ms. Remains 95 /118 variables (removed 23) and now considering 104/137 (removed 33) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 05:36:19] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:36:19] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-06 05:36:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:36:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 05:36:20] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 05:36:20] [INFO ] Invariant cache hit.
[2025-06-06 05:36:20] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 4016 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: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:36:26] [INFO ] Deduced a trap along path composed of 20 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/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, 0/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:36:41] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 17 (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 30040 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: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34113ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 34113ms
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/118 places, 101/137 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 1 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-06 05:36:54] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:36:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-06 05:36:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:36:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 05:36:54] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/118 places, 101/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34942 ms. Remains : 92/118 places, 101/137 transitions.
[2025-06-06 05:36:54] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:36:54] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:36:54] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 05:36:54] [INFO ] Flatten gal took : 7 ms
[2025-06-06 05:36:54] [INFO ] Flatten gal took : 6 ms
[2025-06-06 05:36:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17813931150217912532.gal : 2 ms
[2025-06-06 05:36:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11575782025782239671.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17813931150217912532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11575782025782239671.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 05:37:24] [INFO ] Flatten gal took : 11 ms
[2025-06-06 05:37:24] [INFO ] Applying decomposition
[2025-06-06 05:37: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.202505121319/bin/convert-linux64' '-i' '/tmp/graph9443824061314459267.txt' '-o' '/tmp/graph9443824061314459267.bin' '-w' '/tmp/graph9443824061314459267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9443824061314459267.bin' '-l' '-1' '-v' '-w' '/tmp/graph9443824061314459267.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:37:24] [INFO ] Decomposing Gal with order
[2025-06-06 05:37:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:37:24] [INFO ] Removed a total of 86 redundant transitions.
[2025-06-06 05:37:25] [INFO ] Flatten gal took : 51 ms
[2025-06-06 05:37:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 8 ms.
[2025-06-06 05:37:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality14593144544404088744.gal : 20 ms
[2025-06-06 05:37:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality2673274328808185637.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14593144544404088744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2673274328808185637.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 137/137 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 112 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 112 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 112 transition count 129
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 107 transition count 124
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 107 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 107 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 104 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 104 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 104 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 102 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 102 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 100 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 99 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 98 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 97 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 96 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 95 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 95 transition count 104
Applied a total of 51 rules in 12 ms. Remains 95 /118 variables (removed 23) and now considering 104/137 (removed 33) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 05:37:55] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:37:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-06 05:37:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:37:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 05:37:55] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 05:37:55] [INFO ] Invariant cache hit.
[2025-06-06 05:37:55] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 4037 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: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:38:02] [INFO ] Deduced a trap along path composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/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, 0/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:38:17] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 17 (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 30012 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: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34086ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 34089ms
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/118 places, 101/137 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 6 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-06 05:38:29] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:38:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-06 05:38:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:38:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 05:38:29] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/118 places, 101/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34808 ms. Remains : 92/118 places, 101/137 transitions.
[2025-06-06 05:38:29] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:38:29] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:38:29] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 05:38:29] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:38:29] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:38:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12805320529055794932.gal : 1 ms
[2025-06-06 05:38:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8073409212593597921.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12805320529055794932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8073409212593597921.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 05:39:00] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:39:00] [INFO ] Applying decomposition
[2025-06-06 05:39:00] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph15074466324906295383.txt' '-o' '/tmp/graph15074466324906295383.bin' '-w' '/tmp/graph15074466324906295383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15074466324906295383.bin' '-l' '-1' '-v' '-w' '/tmp/graph15074466324906295383.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:39:00] [INFO ] Decomposing Gal with order
[2025-06-06 05:39:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:39:00] [INFO ] Removed a total of 106 redundant transitions.
[2025-06-06 05:39:00] [INFO ] Flatten gal took : 32 ms
[2025-06-06 05:39:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 20 ms.
[2025-06-06 05:39:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality6839756375287836890.gal : 20 ms
[2025-06-06 05:39:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality3117489065978537805.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6839756375287836890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3117489065978537805.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 137/137 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 112 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 112 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 112 transition count 129
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 107 transition count 124
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 107 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 107 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 104 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 104 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 104 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 102 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 102 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 100 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 99 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 98 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 97 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 96 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 95 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 95 transition count 104
Applied a total of 51 rules in 8 ms. Remains 95 /118 variables (removed 23) and now considering 104/137 (removed 33) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 05:39:30] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:39:30] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-06 05:39:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:39:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 05:39:30] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 05:39:30] [INFO ] Invariant cache hit.
[2025-06-06 05:39:30] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 3903 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: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:39:37] [INFO ] Deduced a trap along path composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/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, 0/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:39:52] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 17 (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 30021 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: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33955ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 33956ms
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/118 places, 101/137 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 0 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2025-06-06 05:40:04] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:40:04] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-06 05:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:40:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 05:40:04] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/118 places, 101/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34548 ms. Remains : 92/118 places, 101/137 transitions.
[2025-06-06 05:40:04] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:40:04] [INFO ] Flatten gal took : 4 ms
[2025-06-06 05:40:04] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 05:40:04] [INFO ] Flatten gal took : 4 ms
[2025-06-06 05:40:04] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:40:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality18229307830899568542.gal : 1 ms
[2025-06-06 05:40:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9860681231661614534.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18229307830899568542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9860681231661614534.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 05:40:34] [INFO ] Flatten gal took : 10 ms
[2025-06-06 05:40:34] [INFO ] Applying decomposition
[2025-06-06 05:40:34] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1560550424879727782.txt' '-o' '/tmp/graph1560550424879727782.bin' '-w' '/tmp/graph1560550424879727782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1560550424879727782.bin' '-l' '-1' '-v' '-w' '/tmp/graph1560550424879727782.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:40:34] [INFO ] Decomposing Gal with order
[2025-06-06 05:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:40:34] [INFO ] Removed a total of 103 redundant transitions.
[2025-06-06 05:40:34] [INFO ] Flatten gal took : 13 ms
[2025-06-06 05:40:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 3 ms.
[2025-06-06 05:40:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5904280943407893632.gal : 2 ms
[2025-06-06 05:40:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality1350736755149461218.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5904280943407893632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1350736755149461218.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 137/137 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 112 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 112 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 112 transition count 129
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 107 transition count 124
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 107 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 107 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 104 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 104 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 104 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 102 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 102 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 100 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 99 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 98 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 97 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 96 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 95 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 95 transition count 104
Applied a total of 51 rules in 7 ms. Remains 95 /118 variables (removed 23) and now considering 104/137 (removed 33) transitions.
// Phase 1: matrix 104 rows 95 cols
[2025-06-06 05:41:05] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:41:05] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 05:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:41:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-06 05:41:05] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-06 05:41:05] [INFO ] Invariant cache hit.
[2025-06-06 05:41:05] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 3814 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: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:41:11] [INFO ] Deduced a trap along path composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/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, 0/240 constraints. Problems are: Problem set: 3 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 05:41:26] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/199 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 17 (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 30009 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: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33864ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 33864ms
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/118 places, 101/137 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
[2025-06-06 05:41:39] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:41:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-06 05:41:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 05:41:39] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-06 05:41:39] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/118 places, 101/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34521 ms. Remains : 92/118 places, 101/137 transitions.
[2025-06-06 05:41:39] [INFO ] Flatten gal took : 8 ms
[2025-06-06 05:41:39] [INFO ] Flatten gal took : 5 ms
[2025-06-06 05:41:39] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-06 05:41:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 05:41:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 05:41:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality17852687671312557293.gal : 1 ms
[2025-06-06 05:41:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality8608851311603386886.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17852687671312557293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8608851311603386886.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 05:42:09] [INFO ] Flatten gal took : 4 ms
[2025-06-06 05:42:09] [INFO ] Applying decomposition
[2025-06-06 05:42:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3529978558184186243.txt' '-o' '/tmp/graph3529978558184186243.bin' '-w' '/tmp/graph3529978558184186243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3529978558184186243.bin' '-l' '-1' '-v' '-w' '/tmp/graph3529978558184186243.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:42:09] [INFO ] Decomposing Gal with order
[2025-06-06 05:42:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:42:09] [INFO ] Removed a total of 104 redundant transitions.
[2025-06-06 05:42:09] [INFO ] Flatten gal took : 16 ms
[2025-06-06 05:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 3 ms.
[2025-06-06 05:42:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality5191331368205166388.gal : 8 ms
[2025-06-06 05:42:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality13635911882312828274.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5191331368205166388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13635911882312828274.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 05:42:39] [INFO ] Flatten gal took : 8 ms
[2025-06-06 05:42:39] [INFO ] Flatten gal took : 17 ms
[2025-06-06 05:42:39] [INFO ] Applying decomposition
[2025-06-06 05:42:39] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph313364042617437830.txt' '-o' '/tmp/graph313364042617437830.bin' '-w' '/tmp/graph313364042617437830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph313364042617437830.bin' '-l' '-1' '-v' '-w' '/tmp/graph313364042617437830.weights' '-q' '0' '-e' '0.001'
[2025-06-06 05:42:39] [INFO ] Decomposing Gal with order
[2025-06-06 05:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 05:42:39] [INFO ] Removed a total of 125 redundant transitions.
[2025-06-06 05:42:39] [INFO ] Flatten gal took : 11 ms
[2025-06-06 05:42:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 5 ms.
[2025-06-06 05:42:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16127831619092648819.gal : 1 ms
[2025-06-06 05:42:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality7783014863939080139.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16127831619092648819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7783014863939080139.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Detected timeout of ITS tools.
[2025-06-06 06:05:16] [INFO ] Flatten gal took : 5 ms
[2025-06-06 06:05:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7534854474932224198.gal : 1 ms
[2025-06-06 06:05:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality13184417291537576719.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7534854474932224198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13184417291537576719.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 4 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,6.18305e+16,281.347,4694968,2,82331,5,1.82704e+07,6,0,609,1.70354e+07,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,281.357,4694968,1,0,6,1.82704e+07,7,1,815,1.70354e+07,1
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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, t16, t22, t27, t60, t63, t66, t92, t102, t103, t104, t105, t106, t107, t108, t109, t112, ...327
(forward)formula 1,0,309.419,4694968,1,0,251,1.82704e+07,274,104,4529,1.70354e+07,310
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EF(AG(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(FALSE)))))))] != FALSE
(forward)formula 2,1,316.527,4694968,1,0,254,1.82704e+07,279,108,4617,1.70354e+07,316
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 3,1,316.528,4694968,1,0,254,1.82704e+07,279,108,4617,1.70354e+07,316
FORMULA SieveSingleMsgMbox-PT-d2m64-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Total runtime 2144329 ms.

BK_STOP 1749190234356

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-d2m64"
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-5832"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m64, 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 r212-tall-174901994400481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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