About the Execution of ITS-Tools for JoinFreeModules-PT-5000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?????FF????????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422800481.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 JoinFreeModules-PT-5000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422800481
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 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 JoinFreeModules-PT-5000-CTLCardinality-2023-12
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2023-13
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2023-14
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2023-15
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-00
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-01
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-02
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-03
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-04
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-05
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-06
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-07
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-08
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-09
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-10
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748852889464
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-5000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 08:28:11] [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-02 08:28:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:28:12] [INFO ] Load time of PNML (sax parser for PT used): 1019 ms
[2025-06-02 08:28:12] [INFO ] Transformed 25001 places.
[2025-06-02 08:28:12] [INFO ] Transformed 40001 transitions.
[2025-06-02 08:28:12] [INFO ] Parsed PT model containing 25001 places and 40001 transitions and 115002 arcs in 1263 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Initial state reduction rules removed 2 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-5000-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-CTLCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 188 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 7718 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2025-06-02 08:28:21] [INFO ] Computed 5000 invariants in 208 ms
[2025-06-02 08:28:21] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20523 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20530 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142519ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 142649ms
[2025-06-02 08:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:30:55] [INFO ] Implicit Places using invariants in 12014 ms returned []
Implicit Place search using SMT only with invariants took 12019 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 08:30:55] [INFO ] Invariant cache hit.
[2025-06-02 08:30:55] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30371 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30317 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 167892ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 167960ms
Finished structural reductions in LTL mode , in 1 iterations and 330570 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Support contains 188 out of 25000 places after structural reductions.
[2025-06-02 08:33:44] [INFO ] Flatten gal took : 1087 ms
[2025-06-02 08:33:45] [INFO ] Flatten gal took : 845 ms
[2025-06-02 08:33:47] [INFO ] Input system was already deterministic with 40001 transitions.
RANDOM walk for 45021 steps (8 resets) in 11943 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 132 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 133 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 138 ms. (2 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 121 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 107 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 137 ms. (2 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 117 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 106 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 119 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 113 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 101 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 548 ms. (0 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 116 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 136 ms. (2 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 109 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 121 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 114 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 122 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 119 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 121 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 121 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 124 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 112 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 108 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 120 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 113 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 109 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 109 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 139 ms. (2 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 114 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 132 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 109 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 108 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 125 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 113 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 122 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 109 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 129 ms. (3 steps per ms) remains 104/104 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 104/104 properties
Probabilistic random walk after 41007 steps, saw 41003 distinct states, run finished after 15215 ms. (steps per millisecond=2 ) properties seen :8
[2025-06-02 08:34:08] [INFO ] Invariant cache hit.
[2025-06-02 08:34:08] [INFO ] State equation strengthened by 5000 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/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 650/815 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/815 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1304/2119 variables, 815/978 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2119 variables, 163/1141 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2119/65001 variables, and 1141 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 163/5000 constraints, State Equation: 815/25000 constraints, ReadFeed: 163/5000 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 650/815 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:18] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:18] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:19] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:19] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/65001 variables, and 167 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 163/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/96 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10858ms problems are : Problem set: 0 solved, 96 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 165 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 815 are kept as prefixes of interest. Removing 24185 places using SCC suffix rule.49 ms
Discarding 24185 places :
Also discarding 38696 output transitions
Drop transitions (Output transitions of discarded places.) removed 38696 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 815 transition count 1304
Applied a total of 2 rules in 235 ms. Remains 815 /25000 variables (removed 24185) and now considering 1304/40001 (removed 38697) transitions.
Running 978 sub problems to find dead transitions.
// Phase 1: matrix 1304 rows 815 cols
[2025-06-02 08:34:19] [INFO ] Computed 163 invariants in 3 ms
[2025-06-02 08:34:19] [INFO ] State equation strengthened by 163 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/652 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 978 unsolved
SMT process timed out in 20154ms, After SMT, problems are : Problem set: 0 solved, 978 unsolved
Search for dead transitions found 0 dead transitions in 20156ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20393 ms. Remains : 815/25000 places, 1304/40001 transitions.
RANDOM walk for 40013 steps (4 resets) in 437 ms. (91 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 95/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 95/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 95/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 95/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 95/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 95/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 95/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 94/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 94/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 93/94 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 93/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 92/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 92/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 91/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 90/91 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 90/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 89/90 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 89/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 88/89 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 88/88 properties
Interrupted probabilistic random walk after 88515 steps, run timeout after 3003 ms. (steps per millisecond=29 ) properties seen :0 out of 88
Probabilistic random walk after 88515 steps, saw 88113 distinct states, run finished after 3006 ms. (steps per millisecond=29 ) properties seen :0
[2025-06-02 08:34:43] [INFO ] Invariant cache hit.
[2025-06-02 08:34:44] [INFO ] State equation strengthened by 163 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/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 582/730 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 1168/1898 variables, 730/876 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1898 variables, 146/1022 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1898 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/1898 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1898/2119 variables, and 1022 constraints, problems are : Problem set: 0 solved, 88 unsolved in 9050 ms.
Refiners :[Positive P Invariants (semi-flows): 146/163 constraints, State Equation: 730/815 constraints, ReadFeed: 146/163 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 582/730 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:53] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:54] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:55] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/730 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:56] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/730 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:57] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:58] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/730 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:34:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/730 variables, 11/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/730 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1168/1898 variables, 730/947 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1898 variables, 146/1093 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1898 variables, 88/1181 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:35:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1898 variables, 6/1187 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1898/2119 variables, and 1187 constraints, problems are : Problem set: 0 solved, 88 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 146/163 constraints, State Equation: 730/815 constraints, ReadFeed: 146/163 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54082ms problems are : Problem set: 0 solved, 88 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 148 out of 815 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 815/815 places, 1304/1304 transitions.
Graph (complete) has 1956 edges and 815 vertex of which 730 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.3 ms
Discarding 85 places :
Also discarding 136 output transitions
Drop transitions (Output transitions of discarded places.) removed 136 transitions
Applied a total of 1 rules in 27 ms. Remains 730 /815 variables (removed 85) and now considering 1168/1304 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 730/815 places, 1168/1304 transitions.
[2025-06-02 08:35:38] [INFO ] Flatten gal took : 687 ms
[2025-06-02 08:35:39] [INFO ] Flatten gal took : 707 ms
[2025-06-02 08:35:40] [INFO ] Input system was already deterministic with 40001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4624 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2025-06-02 08:35:52] [INFO ] Computed 5000 invariants in 108 ms
[2025-06-02 08:35:52] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20322 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20326 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 146150ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 146200ms
[2025-06-02 08:38:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:38:30] [INFO ] Implicit Places using invariants in 12033 ms returned []
Implicit Place search using SMT only with invariants took 12038 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 08:38:30] [INFO ] Invariant cache hit.
[2025-06-02 08:38:31] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30308 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30298 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 166732ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 166773ms
Finished structural reductions in LTL mode , in 1 iterations and 329913 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2025-06-02 08:41:18] [INFO ] Flatten gal took : 739 ms
[2025-06-02 08:41:19] [INFO ] Flatten gal took : 666 ms
[2025-06-02 08:41:20] [INFO ] Input system was already deterministic with 40001 transitions.
[2025-06-02 08:41:21] [INFO ] Flatten gal took : 672 ms
[2025-06-02 08:41:21] [INFO ] Flatten gal took : 686 ms
[2025-06-02 08:41:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality11688411980558932023.gal : 157 ms
[2025-06-02 08:41:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality14133981535181814381.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/CTLCardinality11688411980558932023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14133981535181814381.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-02 08:41:52] [INFO ] Flatten gal took : 650 ms
[2025-06-02 08:41:52] [INFO ] Applying decomposition
[2025-06-02 08:41:53] [INFO ] Flatten gal took : 676 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/graph8218241756016496309.txt' '-o' '/tmp/graph8218241756016496309.bin' '-w' '/tmp/graph8218241756016496309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8218241756016496309.bin' '-l' '-1' '-v' '-w' '/tmp/graph8218241756016496309.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:41:55] [INFO ] Decomposing Gal with order
[2025-06-02 08:42:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:43:17] [INFO ] Removed a total of 3 redundant transitions.
[2025-06-02 08:43:18] [INFO ] Flatten gal took : 974 ms
[2025-06-02 08:43:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4181 ms.
[2025-06-02 08:43:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality895004779964249030.gal : 171 ms
[2025-06-02 08:43:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality7201285376984090086.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/CTLCardinality895004779964249030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7201285376984090086.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4522 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 08:43:57] [INFO ] Invariant cache hit.
[2025-06-02 08:43:58] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20315 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20317 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 144319ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 144359ms
[2025-06-02 08:46:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:46:34] [INFO ] Implicit Places using invariants in 11994 ms returned []
Implicit Place search using SMT only with invariants took 11995 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 08:46:34] [INFO ] Invariant cache hit.
[2025-06-02 08:46:34] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30314 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30298 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 178289ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 178343ms
Finished structural reductions in LTL mode , in 1 iterations and 339301 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2025-06-02 08:49:33] [INFO ] Flatten gal took : 759 ms
[2025-06-02 08:49:34] [INFO ] Flatten gal took : 768 ms
[2025-06-02 08:49:35] [INFO ] Input system was already deterministic with 40001 transitions.
[2025-06-02 08:49:36] [INFO ] Flatten gal took : 732 ms
[2025-06-02 08:49:37] [INFO ] Flatten gal took : 754 ms
[2025-06-02 08:49:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality9697985804805345159.gal : 136 ms
[2025-06-02 08:49:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16111695983336366282.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/CTLCardinality9697985804805345159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16111695983336366282.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-02 08:50:08] [INFO ] Flatten gal took : 749 ms
[2025-06-02 08:50:08] [INFO ] Applying decomposition
[2025-06-02 08:50:08] [INFO ] Flatten gal took : 741 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/graph15908712610949194293.txt' '-o' '/tmp/graph15908712610949194293.bin' '-w' '/tmp/graph15908712610949194293.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15908712610949194293.bin' '-l' '-1' '-v' '-w' '/tmp/graph15908712610949194293.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:50:10] [INFO ] Decomposing Gal with order
[2025-06-02 08:50:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:51:16] [INFO ] Flatten gal took : 760 ms
[2025-06-02 08:51:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1809 ms.
[2025-06-02 08:51:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality8951467020898422606.gal : 135 ms
[2025-06-02 08:51:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality7371028318636946992.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/CTLCardinality8951467020898422606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7371028318636946992.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4480 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 08:51:53] [INFO ] Invariant cache hit.
[2025-06-02 08:51:53] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20318 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20335 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147030ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 147253ms
[2025-06-02 08:54:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:54:32] [INFO ] Implicit Places using invariants in 11802 ms returned []
Implicit Place search using SMT only with invariants took 11806 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 08:54:32] [INFO ] Invariant cache hit.
[2025-06-02 08:54:32] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30309 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30305 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 159801ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 159841ms
Finished structural reductions in LTL mode , in 1 iterations and 323446 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2025-06-02 08:57:13] [INFO ] Flatten gal took : 690 ms
[2025-06-02 08:57:14] [INFO ] Flatten gal took : 723 ms
[2025-06-02 08:57:15] [INFO ] Input system was already deterministic with 40001 transitions.
[2025-06-02 08:57:16] [INFO ] Flatten gal took : 708 ms
[2025-06-02 08:57:16] [INFO ] Flatten gal took : 700 ms
[2025-06-02 08:57:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality10918611642199542749.gal : 120 ms
[2025-06-02 08:57:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality7334764253914958778.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/CTLCardinality10918611642199542749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7334764253914958778.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-02 08:57:47] [INFO ] Flatten gal took : 686 ms
[2025-06-02 08:57:47] [INFO ] Applying decomposition
[2025-06-02 08:57:48] [INFO ] Flatten gal took : 717 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/graph3286925598838465334.txt' '-o' '/tmp/graph3286925598838465334.bin' '-w' '/tmp/graph3286925598838465334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3286925598838465334.bin' '-l' '-1' '-v' '-w' '/tmp/graph3286925598838465334.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:57:50] [INFO ] Decomposing Gal with order
[2025-06-02 08:57:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:58:55] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 08:58:56] [INFO ] Flatten gal took : 944 ms
[2025-06-02 08:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3843 ms.
[2025-06-02 08:59:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality15199303687306635353.gal : 129 ms
[2025-06-02 08:59:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality18038540258144223238.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/CTLCardinality15199303687306635353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18038540258144223238.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.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4471 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 08:59:35] [INFO ] Invariant cache hit.
[2025-06-02 08:59:35] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20327 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20326 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142120ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 142160ms
[2025-06-02 09:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:02:09] [INFO ] Implicit Places using invariants in 11704 ms returned []
Implicit Place search using SMT only with invariants took 11705 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:02:09] [INFO ] Invariant cache hit.
[2025-06-02 09:02:09] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30290 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30288 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162012ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 162051ms
Finished structural reductions in LTL mode , in 1 iterations and 320455 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2025-06-02 09:04:52] [INFO ] Flatten gal took : 707 ms
[2025-06-02 09:04:52] [INFO ] Flatten gal took : 735 ms
[2025-06-02 09:04:54] [INFO ] Input system was already deterministic with 40001 transitions.
[2025-06-02 09:04:54] [INFO ] Flatten gal took : 781 ms
[2025-06-02 09:04:55] [INFO ] Flatten gal took : 730 ms
[2025-06-02 09:04:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17561478894451967773.gal : 122 ms
[2025-06-02 09:04:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality9836124045926601156.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/CTLCardinality17561478894451967773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9836124045926601156.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-02 09:05:26] [INFO ] Flatten gal took : 702 ms
[2025-06-02 09:05:26] [INFO ] Applying decomposition
[2025-06-02 09:05:27] [INFO ] Flatten gal took : 740 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/graph7204106675193258940.txt' '-o' '/tmp/graph7204106675193258940.bin' '-w' '/tmp/graph7204106675193258940.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7204106675193258940.bin' '-l' '-1' '-v' '-w' '/tmp/graph7204106675193258940.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:05:28] [INFO ] Decomposing Gal with order
[2025-06-02 09:05:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:06:45] [INFO ] Removed a total of 5 redundant transitions.
[2025-06-02 09:06:45] [INFO ] Flatten gal took : 824 ms
[2025-06-02 09:06:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3918 ms.
[2025-06-02 09:06:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality6148492370986979940.gal : 131 ms
[2025-06-02 09:06:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality17426730065626684022.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/CTLCardinality6148492370986979940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17426730065626684022.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.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4606 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:07:25] [INFO ] Invariant cache hit.
[2025-06-02 09:07:25] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20306 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20310 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 148881ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 148920ms
[2025-06-02 09:09:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:10:05] [INFO ] Implicit Places using invariants in 11857 ms returned []
Implicit Place search using SMT only with invariants took 11858 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:10:05] [INFO ] Invariant cache hit.
[2025-06-02 09:10:06] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30308 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30292 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 168642ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 168682ms
Finished structural reductions in LTL mode , in 1 iterations and 334133 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2025-06-02 09:12:55] [INFO ] Flatten gal took : 683 ms
[2025-06-02 09:12:56] [INFO ] Flatten gal took : 724 ms
[2025-06-02 09:12:57] [INFO ] Input system was already deterministic with 40001 transitions.
[2025-06-02 09:12:58] [INFO ] Flatten gal took : 695 ms
[2025-06-02 09:12:58] [INFO ] Flatten gal took : 733 ms
[2025-06-02 09:12:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality6943499998797502690.gal : 120 ms
[2025-06-02 09:12:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5286059873586205292.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/CTLCardinality6943499998797502690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5286059873586205292.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 09:13:29] [INFO ] Flatten gal took : 791 ms
[2025-06-02 09:13:29] [INFO ] Applying decomposition
[2025-06-02 09:13:30] [INFO ] Flatten gal took : 717 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/graph8873475466337376045.txt' '-o' '/tmp/graph8873475466337376045.bin' '-w' '/tmp/graph8873475466337376045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8873475466337376045.bin' '-l' '-1' '-v' '-w' '/tmp/graph8873475466337376045.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:13:32] [INFO ] Decomposing Gal with order
[2025-06-02 09:13:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:14:38] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-02 09:14:38] [INFO ] Flatten gal took : 824 ms
[2025-06-02 09:14:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3640 ms.
[2025-06-02 09:14:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality17052158171042061402.gal : 127 ms
[2025-06-02 09:14:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality11285051221955919989.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/CTLCardinality17052158171042061402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11285051221955919989.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.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4340 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:15:17] [INFO ] Invariant cache hit.
[2025-06-02 09:15:17] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20319 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20321 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 146141ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 146181ms
[2025-06-02 09:17:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:17:55] [INFO ] Implicit Places using invariants in 12193 ms returned []
Implicit Place search using SMT only with invariants took 12194 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:17:55] [INFO ] Invariant cache hit.
[2025-06-02 09:17:56] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30300 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30291 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160569ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 160620ms
Finished structural reductions in LTL mode , in 1 iterations and 323411 ms. Remains : 25000/25000 places, 40001/40001 transitions.
[2025-06-02 09:20:37] [INFO ] Flatten gal took : 687 ms
[2025-06-02 09:20:38] [INFO ] Flatten gal took : 780 ms
[2025-06-02 09:20:39] [INFO ] Input system was already deterministic with 40001 transitions.
[2025-06-02 09:20:40] [INFO ] Flatten gal took : 688 ms
[2025-06-02 09:20:40] [INFO ] Flatten gal took : 721 ms
[2025-06-02 09:20:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality18332064233632323837.gal : 118 ms
[2025-06-02 09:20:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality11136762954971507626.ctl : 5 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/CTLCardinality18332064233632323837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11136762954971507626.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-02 09:21:11] [INFO ] Flatten gal took : 694 ms
[2025-06-02 09:21:11] [INFO ] Applying decomposition
[2025-06-02 09:21:12] [INFO ] Flatten gal took : 728 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/graph155569180380254357.txt' '-o' '/tmp/graph155569180380254357.bin' '-w' '/tmp/graph155569180380254357.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph155569180380254357.bin' '-l' '-1' '-v' '-w' '/tmp/graph155569180380254357.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:21:13] [INFO ] Decomposing Gal with order
[2025-06-02 09:21:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:22:27] [INFO ] Removed a total of 2 redundant transitions.
[2025-06-02 09:22:28] [INFO ] Flatten gal took : 787 ms
[2025-06-02 09:22:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4629 ms.
[2025-06-02 09:22:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality18370210037797294198.gal : 232 ms
[2025-06-02 09:22:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15393032751216295423.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/CTLCardinality18370210037797294198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15393032751216295423.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.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 4502 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:23:08] [INFO ] Invariant cache hit.
[2025-06-02 09:23:08] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20317 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 20318 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 0/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 141853ms problems are : Problem set: 0 solved, 30000 unsolved
Search for dead transitions found 0 dead transitions in 141893ms
[2025-06-02 09:25:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:42] [INFO ] Implicit Places using invariants in 12384 ms returned []
Implicit Place search using SMT only with invariants took 12385 ms to find 0 implicit places.
Running 30000 sub problems to find dead transitions.
[2025-06-02 09:25:42] [INFO ] Invariant cache hit.
[2025-06-02 09:25:42] [INFO ] State equation strengthened by 5000 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/65001 variables, and 0 constraints, problems are : Problem set: 0 solved, 30000 unsolved in 30337 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5000 constraints, State Equation: 0/25000 constraints, ReadFeed: 0/5000 constraints, PredecessorRefiner: 30000/30000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
BK_TIME_CONFINEMENT_REACHED
--------------------
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="JoinFreeModules-PT-5000"
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 JoinFreeModules-PT-5000, 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 r114-tall-174876422800481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-5000.tgz
mv JoinFreeModules-PT-5000 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 '
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 ;