Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700297.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 PolyORBLF-COL-S02J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T08-CTLCardinality-2025-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748916599813

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202505121319
[2025-06-03 02:10:01] [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-03 02:10:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:10:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 02:10:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 02:10:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 647 ms
[2025-06-03 02:10:01] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
[2025-06-03 02:10:01] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2025-06-03 02:10:01] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (21 resets) in 1943 ms. (20 steps per ms) remains 50/67 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 95 ms. (41 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (9 resets) in 34 ms. (114 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (9 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (9 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (9 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (9 resets) in 46 ms. (85 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
[2025-06-03 02:10:03] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 02:10:03] [INFO ] Computed 26 invariants in 9 ms
[2025-06-03 02:10:03] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp66 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 46 unsolved
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 44 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 3 (OVERLAPS) 18/68 variables, 9/12 constraints. Problems are: Problem set: 35 solved, 14 unsolved
Problem AtomicPropp43 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/13 constraints. Problems are: Problem set: 36 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 36 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 6 (OVERLAPS) 13/81 variables, 13/26 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 47 solved, 2 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 40/44 variables, 5/5 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/49 variables, 4/9 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 47 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:03] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 2/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/145 variables, 2/117 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/145 variables, 1/118 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 47 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 47 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 47 solved, 2 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/49 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1175ms problems are : Problem set: 47 solved, 2 unsolved
Parikh walk visited 0 properties in 512 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 19 place count 71 transition count 54
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 69 transition count 54
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 35 place count 63 transition count 48
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 63 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 61 transition count 46
Applied a total of 39 rules in 33 ms. Remains 61 /81 variables (removed 20) and now considering 46/65 (removed 19) transitions.
Running 45 sub problems to find dead transitions.
[2025-06-03 02:10:05] [INFO ] Flow matrix only has 45 transitions (discarded 1 similar events)
// Phase 1: matrix 45 rows 61 cols
[2025-06-03 02:10:05] [INFO ] Computed 25 invariants in 4 ms
[2025-06-03 02:10:05] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:05] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:05] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:05] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/29 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:05] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:05] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:05] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 3/32 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:06] [INFO ] Deduced a trap composed of 20 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-03 02:10:06] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 45/106 variables, 61/95 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 8/103 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 103 constraints, problems are : Problem set: 2 solved, 43 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 43 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 3/34 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 45/106 variables, 61/95 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 8/103 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 43/146 constraints. Problems are: Problem set: 2 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:08] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/147 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/106 variables, 0/147 constraints. Problems are: Problem set: 2 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 147 constraints, problems are : Problem set: 2 solved, 43 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/45 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4812ms problems are : Problem set: 2 solved, 43 unsolved
Search for dead transitions found 2 dead transitions in 4813ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/81 places, 44/65 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 42
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 59 /61 variables (removed 2) and now considering 40/44 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5028 ms. Remains : 59/81 places, 40/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 49 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 02:10:10] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2025-06-03 02:10:10] [INFO ] Flatten gal took : 27 ms
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 02:10:10] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 02:10:10] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 34 ms.
[2025-06-03 02:10:10] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 448 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 18 ms. Remains 690 /690 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Running 1304 sub problems to find dead transitions.
[2025-06-03 02:10:10] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2025-06-03 02:10:10] [INFO ] Computed 54 invariants in 60 ms
[2025-06-03 02:10:10] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/686 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/686 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:29] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:31] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 44 ms to minimize.
SMT process timed out in 21481ms, After SMT, problems are : Problem set: 0 solved, 1304 unsolved
Search for dead transitions found 0 dead transitions in 21488ms
[2025-06-03 02:10:31] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2025-06-03 02:10:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:10:32] [INFO ] Implicit Places using invariants in 379 ms returned [532, 533, 534, 535, 536, 537, 538, 539]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 387 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 682/690 places, 1306/1306 transitions.
Applied a total of 0 rules in 15 ms. Remains 682 /682 variables (removed 0) and now considering 1306/1306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21916 ms. Remains : 682/690 places, 1306/1306 transitions.
Support contains 448 out of 682 places after structural reductions.
[2025-06-03 02:10:32] [INFO ] Flatten gal took : 100 ms
[2025-06-03 02:10:32] [INFO ] Flatten gal took : 84 ms
[2025-06-03 02:10:32] [INFO ] Input system was already deterministic with 1306 transitions.
Support contains 430 out of 682 places (down from 448) after GAL structural reductions.
RANDOM walk for 40000 steps (11 resets) in 1172 ms. (34 steps per ms) remains 31/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 55 ms. (71 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 83 ms. (47 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
[2025-06-03 02:10:33] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 682 cols
[2025-06-03 02:10:33] [INFO ] Computed 46 invariants in 29 ms
[2025-06-03 02:10:33] [INFO ] State equation strengthened by 96 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
At refinement iteration 1 (OVERLAPS) 186/521 variables, 16/16 constraints. Problems are: Problem set: 10 solved, 21 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 3/19 constraints. Problems are: Problem set: 12 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 0/19 constraints. Problems are: Problem set: 12 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 4 (OVERLAPS) 160/681 variables, 26/45 constraints. Problems are: Problem set: 29 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/681 variables, 0/45 constraints. Problems are: Problem set: 29 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/682 variables, 1/46 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/682 variables, 0/46 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1290/1972 variables, 682/728 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1972 variables, 96/824 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1972 variables, 0/824 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1972 variables, 0/824 constraints. Problems are: Problem set: 30 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1972/1972 variables, and 824 constraints, problems are : Problem set: 30 solved, 1 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 682/682 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 31/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 249/273 variables, 4/4 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/4 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/306 variables, 8/12 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/12 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 367/673 variables, 26/38 constraints. Problems are: Problem set: 30 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:35] [INFO ] Deduced a trap composed of 74 places in 378 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:35] [INFO ] Deduced a trap composed of 74 places in 363 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:35] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:35] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:35] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 5/43 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 0/43 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/677 variables, 4/47 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/47 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/680 variables, 3/50 constraints. Problems are: Problem set: 30 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/680 variables, 0/50 constraints. Problems are: Problem set: 30 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1970/1972 variables, and 730 constraints, problems are : Problem set: 30 solved, 1 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 680/682 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/29 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3973ms problems are : Problem set: 30 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 680 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 608 transition count 1234
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 146 place count 608 transition count 1170
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 274 place count 544 transition count 1170
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 282 place count 536 transition count 1162
Iterating global reduction 2 with 8 rules applied. Total rules applied 290 place count 536 transition count 1162
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 418 place count 472 transition count 1098
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 434 place count 472 transition count 1082
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 450 place count 456 transition count 1082
Applied a total of 450 rules in 224 ms. Remains 456 /682 variables (removed 226) and now considering 1082/1306 (removed 224) transitions.
Running 1080 sub problems to find dead transitions.
[2025-06-03 02:10:37] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
// Phase 1: matrix 1066 rows 456 cols
[2025-06-03 02:10:37] [INFO ] Computed 44 invariants in 21 ms
[2025-06-03 02:10:37] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:47] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:47] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:47] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:47] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:47] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:47] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:47] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:48] [INFO ] Deduced a trap composed of 169 places in 300 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:48] [INFO ] Deduced a trap composed of 176 places in 282 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:50] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:50] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:10:58] [INFO ] Deduced a trap composed of 166 places in 274 ms of which 67 ms to minimize.
SMT process timed out in 20985ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 20987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21215 ms. Remains : 456/682 places, 1082/1306 transitions.
RANDOM walk for 40000 steps (18 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 363225 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 363225 steps, saw 196399 distinct states, run finished after 3005 ms. (steps per millisecond=120 ) properties seen :0
[2025-06-03 02:11:01] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 02:11:01] [INFO ] Invariant cache hit.
[2025-06-03 02:11:01] [INFO ] State equation strengthened by 96 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/205 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/441 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/450 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/454 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1066/1520 variables, 454/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1520 variables, 96/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1522 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1522 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1522 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1522/1522 variables, and 596 constraints, problems are : Problem set: 0 solved, 1 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 167/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/205 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 236/441 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:02] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:02] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:02] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:02] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:02] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:03] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/450 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/454 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1066/1520 variables, 454/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1520 variables, 96/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1520 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1520 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1522 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1522 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:04] [INFO ] Deduced a trap composed of 176 places in 297 ms of which 76 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1522 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1522 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1522 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1522/1522 variables, and 604 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2973 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 24 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 24 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 456/456 places, 1082/1082 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1082/1082 transitions.
Applied a total of 0 rules in 25 ms. Remains 456 /456 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2025-06-03 02:11:05] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 02:11:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:11:06] [INFO ] Implicit Places using invariants in 871 ms returned []
[2025-06-03 02:11:06] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 02:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:11:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:11:15] [INFO ] Implicit Places using invariants and state equation in 9201 ms returned []
Implicit Place search using SMT with State Equation took 10078 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:11:15] [INFO ] Redundant transitions in 58 ms returned []
Running 1080 sub problems to find dead transitions.
[2025-06-03 02:11:15] [INFO ] Flow matrix only has 1066 transitions (discarded 16 similar events)
[2025-06-03 02:11:15] [INFO ] Invariant cache hit.
[2025-06-03 02:11:15] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:25] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:25] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:25] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:25] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:25] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:25] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:25] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:26] [INFO ] Deduced a trap composed of 169 places in 295 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:26] [INFO ] Deduced a trap composed of 176 places in 283 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:28] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:36] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:36] [INFO ] Deduced a trap composed of 166 places in 276 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:36] [INFO ] Deduced a trap composed of 138 places in 266 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:37] [INFO ] Deduced a trap composed of 161 places in 282 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:11:38] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1522 variables, and 57 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:05] [INFO ] Deduced a trap composed of 268 places in 271 ms of which 89 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1522 variables, and 58 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/456 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61001ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 61003ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71183 ms. Remains : 456/456 places, 1082/1082 transitions.
Successfully simplified 30 atomic propositions for a total of 7 simplifications.
[2025-06-03 02:12:16] [INFO ] Flatten gal took : 68 ms
[2025-06-03 02:12:16] [INFO ] Flatten gal took : 64 ms
[2025-06-03 02:12:16] [INFO ] Input system was already deterministic with 1306 transitions.
Support contains 127 out of 682 places (down from 161) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 29 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:12:16] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2025-06-03 02:12:16] [INFO ] Computed 44 invariants in 26 ms
[2025-06-03 02:12:16] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:35] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:35] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:35] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 45 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:42] [INFO ] Deduced a trap composed of 72 places in 315 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:42] [INFO ] Deduced a trap composed of 72 places in 299 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:43] [INFO ] Deduced a trap composed of 72 places in 300 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:43] [INFO ] Deduced a trap composed of 72 places in 306 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:43] [INFO ] Deduced a trap composed of 114 places in 310 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:44] [INFO ] Deduced a trap composed of 159 places in 332 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:44] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:12:45] [INFO ] Deduced a trap composed of 354 places in 365 ms of which 124 ms to minimize.
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 Int declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40824ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 40827ms
[2025-06-03 02:12:57] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:12:58] [INFO ] Implicit Places using invariants in 792 ms returned []
[2025-06-03 02:12:58] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:12:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:12:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:13:08] [INFO ] Implicit Places using invariants and state equation in 9777 ms returned []
Implicit Place search using SMT with State Equation took 10574 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:13:08] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:13:08] [INFO ] Invariant cache hit.
[2025-06-03 02:13:08] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:26] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:28] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:28] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:28] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:29] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:29] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:29] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:29] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:29] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:35] [INFO ] Deduced a trap composed of 305 places in 401 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:35] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:41] [INFO ] Deduced a trap composed of 321 places in 511 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:42] [INFO ] Deduced a trap composed of 114 places in 322 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:42] [INFO ] Deduced a trap composed of 159 places in 331 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:43] [INFO ] Deduced a trap composed of 290 places in 376 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:43] [INFO ] Deduced a trap composed of 354 places in 386 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:13:45] [INFO ] Deduced a trap composed of 328 places in 464 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:14:01] [INFO ] Deduced a trap composed of 326 places in 377 ms of which 118 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60836ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60840ms
Starting structural reductions in LTL mode, iteration 1 : 664/682 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112278 ms. Remains : 664/682 places, 1290/1306 transitions.
[2025-06-03 02:14:09] [INFO ] Flatten gal took : 55 ms
[2025-06-03 02:14:09] [INFO ] Flatten gal took : 69 ms
[2025-06-03 02:14:09] [INFO ] Input system was already deterministic with 1290 transitions.
[2025-06-03 02:14:09] [INFO ] Flatten gal took : 67 ms
[2025-06-03 02:14:09] [INFO ] Flatten gal took : 47 ms
[2025-06-03 02:14:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality4107437450354081146.gal : 29 ms
[2025-06-03 02:14:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality12873482208557018092.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/CTLCardinality4107437450354081146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12873482208557018092.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-03 02:14:39] [INFO ] Flatten gal took : 42 ms
[2025-06-03 02:14:39] [INFO ] Applying decomposition
[2025-06-03 02:14:39] [INFO ] Flatten gal took : 75 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/graph13420108071576596564.txt' '-o' '/tmp/graph13420108071576596564.bin' '-w' '/tmp/graph13420108071576596564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13420108071576596564.bin' '-l' '-1' '-v' '-w' '/tmp/graph13420108071576596564.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:14:40] [INFO ] Decomposing Gal with order
[2025-06-03 02:14:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:14:40] [INFO ] Removed a total of 1162 redundant transitions.
[2025-06-03 02:14:40] [INFO ] Flatten gal took : 311 ms
[2025-06-03 02:14:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 495 labels/synchronizations in 124 ms.
[2025-06-03 02:14:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality12754666471259112758.gal : 28 ms
[2025-06-03 02:14:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7636025777532555594.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/CTLCardinality12754666471259112758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7636025777532555594.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 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 42 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:15:11] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:15:11] [INFO ] Invariant cache hit.
[2025-06-03 02:15:11] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:30] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 43 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:34] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:34] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:35] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:35] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:35] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:35] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:36] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:36] [INFO ] Deduced a trap composed of 159 places in 328 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:48] [INFO ] Deduced a trap composed of 305 places in 445 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:49] [INFO ] Deduced a trap composed of 19 places in 531 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:15:49] [INFO ] Deduced a trap composed of 328 places in 444 ms of which 157 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 54 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41010ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41013ms
[2025-06-03 02:15:52] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:15:53] [INFO ] Implicit Places using invariants in 908 ms returned []
[2025-06-03 02:15:53] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:15:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:15:53] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:16:03] [INFO ] Implicit Places using invariants and state equation in 9895 ms returned []
Implicit Place search using SMT with State Equation took 10822 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:16:03] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:16:03] [INFO ] Invariant cache hit.
[2025-06-03 02:16:03] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:22] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:24] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:24] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:25] [INFO ] Deduced a trap composed of 72 places in 232 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:25] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:25] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:25] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:25] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:25] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:31] [INFO ] Deduced a trap composed of 305 places in 395 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:31] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:37] [INFO ] Deduced a trap composed of 321 places in 513 ms of which 245 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:37] [INFO ] Deduced a trap composed of 114 places in 459 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:38] [INFO ] Deduced a trap composed of 159 places in 338 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:38] [INFO ] Deduced a trap composed of 290 places in 363 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:39] [INFO ] Deduced a trap composed of 354 places in 395 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:40] [INFO ] Deduced a trap composed of 328 places in 469 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:16:55] [INFO ] Deduced a trap composed of 326 places in 391 ms of which 120 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60862ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60865ms
Starting structural reductions in LTL mode, iteration 1 : 664/682 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112750 ms. Remains : 664/682 places, 1290/1306 transitions.
[2025-06-03 02:17:04] [INFO ] Flatten gal took : 99 ms
[2025-06-03 02:17:04] [INFO ] Flatten gal took : 103 ms
[2025-06-03 02:17:04] [INFO ] Input system was already deterministic with 1290 transitions.
[2025-06-03 02:17:04] [INFO ] Flatten gal took : 42 ms
[2025-06-03 02:17:04] [INFO ] Flatten gal took : 91 ms
[2025-06-03 02:17:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality9185550829642646654.gal : 6 ms
[2025-06-03 02:17:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality14096937422822563726.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/CTLCardinality9185550829642646654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14096937422822563726.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-03 02:17:34] [INFO ] Flatten gal took : 41 ms
[2025-06-03 02:17:34] [INFO ] Applying decomposition
[2025-06-03 02:17:34] [INFO ] Flatten gal took : 73 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/graph1659704712465282579.txt' '-o' '/tmp/graph1659704712465282579.bin' '-w' '/tmp/graph1659704712465282579.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1659704712465282579.bin' '-l' '-1' '-v' '-w' '/tmp/graph1659704712465282579.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:17:35] [INFO ] Decomposing Gal with order
[2025-06-03 02:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:17:35] [INFO ] Removed a total of 1212 redundant transitions.
[2025-06-03 02:17:35] [INFO ] Flatten gal took : 350 ms
[2025-06-03 02:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 165 labels/synchronizations in 35 ms.
[2025-06-03 02:17:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality8577866071812175581.gal : 27 ms
[2025-06-03 02:17:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13175513178772140087.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/CTLCardinality8577866071812175581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13175513178772140087.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 680 transition count 1258
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 632 transition count 1258
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 96 place count 632 transition count 1170
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 272 place count 544 transition count 1170
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 280 place count 536 transition count 1162
Iterating global reduction 2 with 8 rules applied. Total rules applied 288 place count 536 transition count 1162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 400 place count 480 transition count 1106
Applied a total of 400 rules in 115 ms. Remains 480 /682 variables (removed 202) and now considering 1106/1306 (removed 200) transitions.
Running 1104 sub problems to find dead transitions.
[2025-06-03 02:18:05] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 480 cols
[2025-06-03 02:18:05] [INFO ] Computed 44 invariants in 29 ms
[2025-06-03 02:18:05] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:17] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:17] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:17] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:17] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:17] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:17] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:17] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:18] [INFO ] Deduced a trap composed of 177 places in 294 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:18] [INFO ] Deduced a trap composed of 184 places in 297 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:18] [INFO ] Deduced a trap composed of 169 places in 317 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:19] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:19] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 54 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:39] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:18:42] [INFO ] Deduced a trap composed of 308 places in 274 ms of which 81 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 56 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40931ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 40933ms
[2025-06-03 02:18:46] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:18:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:18:47] [INFO ] Implicit Places using invariants in 710 ms returned []
[2025-06-03 02:18:47] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:18:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:18:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:18:54] [INFO ] Implicit Places using invariants and state equation in 6674 ms returned []
Implicit Place search using SMT with State Equation took 7420 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:18:54] [INFO ] Redundant transitions in 22 ms returned []
Running 1104 sub problems to find dead transitions.
[2025-06-03 02:18:54] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
[2025-06-03 02:18:54] [INFO ] Invariant cache hit.
[2025-06-03 02:18:54] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:05] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:05] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:05] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:05] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:06] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:06] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:06] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:06] [INFO ] Deduced a trap composed of 177 places in 270 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:06] [INFO ] Deduced a trap composed of 184 places in 286 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:07] [INFO ] Deduced a trap composed of 169 places in 306 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:07] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:08] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:19] [INFO ] Deduced a trap composed of 138 places in 283 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:20] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 7.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 9.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 (/ 1.0 3.0))
(s195 1.0)
(s196 1.0)
(s197 (/ 1.0 3.0))
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 (/ 2.0 3.0))
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 (/ 2.0 3.0))
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1570 variables, and 56 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:19:52] [INFO ] Deduced a trap composed of 87 places in 259 ms of which 51 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1570 variables, and 57 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/480 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60872ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 60873ms
Starting structural reductions in SI_CTL mode, iteration 1 : 480/682 places, 1106/1306 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 109390 ms. Remains : 480/682 places, 1106/1306 transitions.
[2025-06-03 02:19:55] [INFO ] Flatten gal took : 36 ms
[2025-06-03 02:19:55] [INFO ] Flatten gal took : 38 ms
[2025-06-03 02:19:55] [INFO ] Input system was already deterministic with 1106 transitions.
RANDOM walk for 274 steps (0 resets) in 6 ms. (39 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J06T08-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 02:19:55] [INFO ] Flatten gal took : 42 ms
[2025-06-03 02:19:55] [INFO ] Flatten gal took : 36 ms
[2025-06-03 02:19:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6146549205151231292.gal : 9 ms
[2025-06-03 02:19:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6282359401568945758.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6146549205151231292.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6282359401568945758.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 122 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:19:55] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
// Phase 1: matrix 1274 rows 664 cols
[2025-06-03 02:19:55] [INFO ] Computed 44 invariants in 46 ms
[2025-06-03 02:19:55] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:14] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:14] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:14] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 45 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:21] [INFO ] Deduced a trap composed of 72 places in 307 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:21] [INFO ] Deduced a trap composed of 72 places in 306 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:22] [INFO ] Deduced a trap composed of 72 places in 295 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:22] [INFO ] Deduced a trap composed of 72 places in 305 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:22] [INFO ] Deduced a trap composed of 114 places in 307 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:23] [INFO ] Deduced a trap composed of 159 places in 359 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:23] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:20:24] [INFO ] Deduced a trap composed of 354 places in 376 ms of which 122 ms to minimize.
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 Int declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 20050 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41063ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 41065ms
[2025-06-03 02:20:36] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:20:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:37] [INFO ] Implicit Places using invariants in 806 ms returned []
[2025-06-03 02:20:37] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:20:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:20:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:20:49] [INFO ] Implicit Places using invariants and state equation in 11744 ms returned []
Implicit Place search using SMT with State Equation took 12564 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:20:49] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:20:49] [INFO ] Invariant cache hit.
[2025-06-03 02:20:49] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:07] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:10] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:10] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:10] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:10] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:10] [INFO ] Deduced a trap composed of 72 places in 194 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:11] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:11] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:11] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:16] [INFO ] Deduced a trap composed of 305 places in 392 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:16] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:23] [INFO ] Deduced a trap composed of 321 places in 506 ms of which 243 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:23] [INFO ] Deduced a trap composed of 114 places in 317 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:24] [INFO ] Deduced a trap composed of 159 places in 342 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:24] [INFO ] Deduced a trap composed of 290 places in 372 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:25] [INFO ] Deduced a trap composed of 354 places in 396 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:26] [INFO ] Deduced a trap composed of 328 places in 454 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:21:41] [INFO ] Deduced a trap composed of 326 places in 379 ms of which 118 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60883ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60890ms
Starting structural reductions in LTL mode, iteration 1 : 664/682 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114660 ms. Remains : 664/682 places, 1290/1306 transitions.
[2025-06-03 02:21:50] [INFO ] Flatten gal took : 35 ms
[2025-06-03 02:21:50] [INFO ] Flatten gal took : 38 ms
[2025-06-03 02:21:50] [INFO ] Input system was already deterministic with 1290 transitions.
[2025-06-03 02:21:50] [INFO ] Flatten gal took : 38 ms
[2025-06-03 02:21:50] [INFO ] Flatten gal took : 38 ms
[2025-06-03 02:21:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16173044487763627188.gal : 6 ms
[2025-06-03 02:21:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality14708473774158543273.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/CTLCardinality16173044487763627188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14708473774158543273.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-03 02:22:20] [INFO ] Flatten gal took : 55 ms
[2025-06-03 02:22:20] [INFO ] Applying decomposition
[2025-06-03 02:22:20] [INFO ] Flatten gal took : 38 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/graph9118449044819057163.txt' '-o' '/tmp/graph9118449044819057163.bin' '-w' '/tmp/graph9118449044819057163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9118449044819057163.bin' '-l' '-1' '-v' '-w' '/tmp/graph9118449044819057163.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:22:20] [INFO ] Decomposing Gal with order
[2025-06-03 02:22:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:22:21] [INFO ] Removed a total of 1069 redundant transitions.
[2025-06-03 02:22:21] [INFO ] Flatten gal took : 224 ms
[2025-06-03 02:22:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 251 labels/synchronizations in 42 ms.
[2025-06-03 02:22:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality8586896586235050677.gal : 8 ms
[2025-06-03 02:22:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9822799517696838210.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/CTLCardinality8586896586235050677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9822799517696838210.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 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 27 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:22:51] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:22:51] [INFO ] Invariant cache hit.
[2025-06-03 02:22:51] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:09] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:11] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:12] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:12] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 42 ms to minimize.
SMT process timed out in 20849ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20852ms
[2025-06-03 02:23:12] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:23:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:23:13] [INFO ] Implicit Places using invariants in 782 ms returned []
[2025-06-03 02:23:13] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:23:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:23:22] [INFO ] Implicit Places using invariants and state equation in 9805 ms returned []
Implicit Place search using SMT with State Equation took 10599 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:23:23] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:23:23] [INFO ] Invariant cache hit.
[2025-06-03 02:23:23] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:40] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:43] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:43] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:43] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:43] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:44] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:44] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:44] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:44] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:49] [INFO ] Deduced a trap composed of 305 places in 369 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:50] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:56] [INFO ] Deduced a trap composed of 321 places in 504 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:57] [INFO ] Deduced a trap composed of 114 places in 324 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:57] [INFO ] Deduced a trap composed of 159 places in 331 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:58] [INFO ] Deduced a trap composed of 290 places in 366 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:23:58] [INFO ] Deduced a trap composed of 354 places in 382 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:00] [INFO ] Deduced a trap composed of 328 places in 468 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:24:16] [INFO ] Deduced a trap composed of 326 places in 368 ms of which 118 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60806ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60808ms
Starting structural reductions in LTL mode, iteration 1 : 664/682 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92291 ms. Remains : 664/682 places, 1290/1306 transitions.
[2025-06-03 02:24:23] [INFO ] Flatten gal took : 34 ms
[2025-06-03 02:24:23] [INFO ] Flatten gal took : 36 ms
[2025-06-03 02:24:24] [INFO ] Input system was already deterministic with 1290 transitions.
[2025-06-03 02:24:24] [INFO ] Flatten gal took : 35 ms
[2025-06-03 02:24:24] [INFO ] Flatten gal took : 36 ms
[2025-06-03 02:24:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality14069577109205061289.gal : 6 ms
[2025-06-03 02:24:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12085910546103484488.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/CTLCardinality14069577109205061289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12085910546103484488.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-03 02:24:54] [INFO ] Flatten gal took : 37 ms
[2025-06-03 02:24:54] [INFO ] Applying decomposition
[2025-06-03 02:24:54] [INFO ] Flatten gal took : 37 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/graph967781376943469945.txt' '-o' '/tmp/graph967781376943469945.bin' '-w' '/tmp/graph967781376943469945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph967781376943469945.bin' '-l' '-1' '-v' '-w' '/tmp/graph967781376943469945.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:24:54] [INFO ] Decomposing Gal with order
[2025-06-03 02:24:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:24:54] [INFO ] Removed a total of 1207 redundant transitions.
[2025-06-03 02:24:54] [INFO ] Flatten gal took : 174 ms
[2025-06-03 02:24:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 272 labels/synchronizations in 15 ms.
[2025-06-03 02:24:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17662484280311088591.gal : 15 ms
[2025-06-03 02:24:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality12306536115730157071.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/CTLCardinality17662484280311088591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12306536115730157071.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 37 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:25:24] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:25:24] [INFO ] Invariant cache hit.
[2025-06-03 02:25:24] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:43] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:25:45] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 43 ms to minimize.
SMT process timed out in 20758ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 20760ms
[2025-06-03 02:25:45] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:25:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:46] [INFO ] Implicit Places using invariants in 801 ms returned []
[2025-06-03 02:25:46] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:25:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:25:56] [INFO ] Implicit Places using invariants and state equation in 9854 ms returned []
Implicit Place search using SMT with State Equation took 10657 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:25:56] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:25:56] [INFO ] Invariant cache hit.
[2025-06-03 02:25:56] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:14] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:16] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:16] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:17] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:17] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:17] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:17] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:17] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:17] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:23] [INFO ] Deduced a trap composed of 305 places in 398 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:23] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:30] [INFO ] Deduced a trap composed of 321 places in 495 ms of which 247 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:30] [INFO ] Deduced a trap composed of 114 places in 313 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:30] [INFO ] Deduced a trap composed of 159 places in 330 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:31] [INFO ] Deduced a trap composed of 290 places in 359 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:32] [INFO ] Deduced a trap composed of 354 places in 374 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:33] [INFO ] Deduced a trap composed of 328 places in 467 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:26:49] [INFO ] Deduced a trap composed of 326 places in 375 ms of which 121 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60871ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60875ms
Starting structural reductions in LTL mode, iteration 1 : 664/682 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92338 ms. Remains : 664/682 places, 1290/1306 transitions.
[2025-06-03 02:26:57] [INFO ] Flatten gal took : 36 ms
[2025-06-03 02:26:57] [INFO ] Flatten gal took : 43 ms
[2025-06-03 02:26:57] [INFO ] Input system was already deterministic with 1290 transitions.
[2025-06-03 02:26:57] [INFO ] Flatten gal took : 36 ms
[2025-06-03 02:26:57] [INFO ] Flatten gal took : 37 ms
[2025-06-03 02:26:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality7055537526943769666.gal : 6 ms
[2025-06-03 02:26:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4105526354796576776.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/CTLCardinality7055537526943769666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4105526354796576776.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-03 02:27:27] [INFO ] Flatten gal took : 38 ms
[2025-06-03 02:27:27] [INFO ] Applying decomposition
[2025-06-03 02:27:27] [INFO ] Flatten gal took : 36 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/graph11883051753065252370.txt' '-o' '/tmp/graph11883051753065252370.bin' '-w' '/tmp/graph11883051753065252370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11883051753065252370.bin' '-l' '-1' '-v' '-w' '/tmp/graph11883051753065252370.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:27:27] [INFO ] Decomposing Gal with order
[2025-06-03 02:27:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:27:27] [INFO ] Removed a total of 1127 redundant transitions.
[2025-06-03 02:27:27] [INFO ] Flatten gal took : 117 ms
[2025-06-03 02:27:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 268 labels/synchronizations in 39 ms.
[2025-06-03 02:27:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality7396482267869306103.gal : 9 ms
[2025-06-03 02:27:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality4370279683509688228.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/CTLCardinality7396482267869306103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4370279683509688228.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 682/682 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1306
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 672 transition count 1298
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 672 transition count 1298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 664 transition count 1290
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 664 transition count 1290
Applied a total of 34 rules in 32 ms. Remains 664 /682 variables (removed 18) and now considering 1290/1306 (removed 16) transitions.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:27:57] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:27:57] [INFO ] Invariant cache hit.
[2025-06-03 02:27:57] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:15] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:18] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:18] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:18] [INFO ] Deduced a trap composed of 72 places in 215 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:18] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 43 ms to minimize.
SMT process timed out in 21058ms, After SMT, problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 21061ms
[2025-06-03 02:28:18] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:19] [INFO ] Implicit Places using invariants in 774 ms returned []
[2025-06-03 02:28:19] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:28:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:28:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 02:28:29] [INFO ] Implicit Places using invariants and state equation in 9945 ms returned []
Implicit Place search using SMT with State Equation took 10752 ms to find 0 implicit places.
Running 1288 sub problems to find dead transitions.
[2025-06-03 02:28:29] [INFO ] Flow matrix only has 1274 transitions (discarded 16 similar events)
[2025-06-03 02:28:29] [INFO ] Invariant cache hit.
[2025-06-03 02:28:29] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:48] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:50] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:51] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:57] [INFO ] Deduced a trap composed of 305 places in 396 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:28:57] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/1938 variables, and 53 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1288/1288 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/662 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/662 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/662 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:03] [INFO ] Deduced a trap composed of 321 places in 503 ms of which 242 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:04] [INFO ] Deduced a trap composed of 114 places in 374 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:04] [INFO ] Deduced a trap composed of 159 places in 312 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:05] [INFO ] Deduced a trap composed of 290 places in 373 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:05] [INFO ] Deduced a trap composed of 354 places in 385 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:06] [INFO ] Deduced a trap composed of 328 places in 486 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:29:22] [INFO ] Deduced a trap composed of 326 places in 379 ms of which 122 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/662 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/1938 variables, and 60 constraints, problems are : Problem set: 0 solved, 1288 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/664 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1288 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60862ms problems are : Problem set: 0 solved, 1288 unsolved
Search for dead transitions found 0 dead transitions in 60865ms
Starting structural reductions in LTL mode, iteration 1 : 664/682 places, 1290/1306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92721 ms. Remains : 664/682 places, 1290/1306 transitions.
[2025-06-03 02:29:30] [INFO ] Flatten gal took : 33 ms
[2025-06-03 02:29:30] [INFO ] Flatten gal took : 35 ms
[2025-06-03 02:29:30] [INFO ] Input system was already deterministic with 1290 transitions.
[2025-06-03 02:29:30] [INFO ] Flatten gal took : 35 ms
[2025-06-03 02:29:30] [INFO ] Flatten gal took : 35 ms
[2025-06-03 02:29:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality5279354001163403456.gal : 6 ms
[2025-06-03 02:29:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality926862966775447237.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/CTLCardinality5279354001163403456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality926862966775447237.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.
[2025-06-03 02:30:00] [INFO ] Flatten gal took : 35 ms
[2025-06-03 02:30:00] [INFO ] Applying decomposition
[2025-06-03 02:30:00] [INFO ] Flatten gal took : 35 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/graph15539791573480902497.txt' '-o' '/tmp/graph15539791573480902497.bin' '-w' '/tmp/graph15539791573480902497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15539791573480902497.bin' '-l' '-1' '-v' '-w' '/tmp/graph15539791573480902497.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:30:01] [INFO ] Decomposing Gal with order
[2025-06-03 02:30:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:30:01] [INFO ] Removed a total of 1026 redundant transitions.
[2025-06-03 02:30:01] [INFO ] Flatten gal took : 84 ms
[2025-06-03 02:30:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 329 labels/synchronizations in 13 ms.
[2025-06-03 02:30:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality17378009182083017677.gal : 10 ms
[2025-06-03 02:30:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality9916388312314959608.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/CTLCardinality17378009182083017677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9916388312314959608.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 02:30:31] [INFO ] Flatten gal took : 42 ms
[2025-06-03 02:30:31] [INFO ] Flatten gal took : 39 ms
[2025-06-03 02:30:31] [INFO ] Applying decomposition
[2025-06-03 02:30:31] [INFO ] Flatten gal took : 37 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/graph3715012265860796144.txt' '-o' '/tmp/graph3715012265860796144.bin' '-w' '/tmp/graph3715012265860796144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3715012265860796144.bin' '-l' '-1' '-v' '-w' '/tmp/graph3715012265860796144.weights' '-q' '0' '-e' '0.001'
[2025-06-03 02:30:31] [INFO ] Decomposing Gal with order
[2025-06-03 02:30:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:30:31] [INFO ] Removed a total of 1272 redundant transitions.
[2025-06-03 02:30:31] [INFO ] Flatten gal took : 94 ms
[2025-06-03 02:30:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 577 labels/synchronizations in 18 ms.
[2025-06-03 02:30:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15697510171436636113.gal : 9 ms
[2025-06-03 02:30:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality16871037409306824223.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/CTLCardinality15697510171436636113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16871037409306824223.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 6 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 02:57:25] [INFO ] Applying decomposition
[2025-06-03 02:57:25] [INFO ] Flatten gal took : 216 ms
[2025-06-03 02:57:25] [INFO ] Decomposing Gal with order
[2025-06-03 02:57:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 02:57:25] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[AwakeTasks_6, IdleTasks_6, NotifyEventJobQueuedE_6, QueueJobE_6, P_2321_6, TryAllocateOneTaskE_6, TryAllocateOneTaskB_6, P_2318_6, EnablePollingE_6, EnablePollingB_6, FetchJobB_6, ScheduleTaskE_Check_6, ScheduleTaskB_6, Abort_Check_Sources_E_6, Abort_Check_Sources_B_6, NotifyEventSourceAddedB_6, Insert_Source_E_6, NotifyEventSourceAddedE_6, P_1113_6, ProcessingEvt_6, P_1155_6, nyo_6, P_1158_6, P_1159_6, P_1160_6, NotifyEventEndOfCheckSourcesB_6, NotifyEventEndOfCheckSourcesE_6, Check_Sources_B_6, Check_Sources_E_6, NotifyEventJobCompletedE_6, NotifyEventJobCompletedB_6, RunE_6, RunB_6, Perform_Work_E_6, Try_Check_Sources_B_6, Try_Check_Sources_E_6, P_1617_6, ScheduleTaskE_Idle_6],[AwakeTasks_7, IdleTasks_7, NotifyEventJobQueuedE_7, QueueJobE_7, P_2321_7, TryAllocateOneTaskE_7, TryAllocateOneTaskB_7, P_2318_7, EnablePollingE_7, EnablePollingB_7, FetchJobB_7, ScheduleTaskE_Check_7, ScheduleTaskB_7, Abort_Check_Sources_E_7, Abort_Check_Sources_B_7, NotifyEventSourceAddedB_7, Insert_Source_E_7, NotifyEventSourceAddedE_7, P_1113_7, ProcessingEvt_7, P_1155_7, nyo_7, P_1158_7, P_1159_7, P_1160_7, NotifyEventEndOfCheckSourcesB_7, NotifyEventEndOfCheckSourcesE_7, Check_Sources_B_7, Check_Sources_E_7, NotifyEventJobCompletedE_7, NotifyEventJobCompletedB_7, RunE_7, RunB_7, Perform_Work_E_7, Try_Check_Sources_B_7, Try_Check_Sources_E_7, P_1617_7, ScheduleTaskE_Idle_7],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[NotifyEventJobQueuedB_42, QueueJobB_42, FetchJobE_42, ScheduleTaskE_Work_42],[NotifyEventJobQueuedB_43, QueueJobB_43, FetchJobE_43, ScheduleTaskE_Work_43],[NotifyEventJobQueuedB_44, QueueJobB_44, FetchJobE_44, ScheduleTaskE_Work_44],[NotifyEventJobQueuedB_45, QueueJobB_45, FetchJobE_45, ScheduleTaskE_Work_45],[NotifyEventJobQueuedB_46, QueueJobB_46, FetchJobE_46, ScheduleTaskE_Work_46],[NotifyEventJobQueuedB_47, QueueJobB_47, FetchJobE_47, ScheduleTaskE_Work_47],[NotifyEventJobQueuedB_48, QueueJobB_48, FetchJobE_48, ScheduleTaskE_Work_48],[NotifyEventJobQueuedB_49, QueueJobB_49, FetchJobE_49, ScheduleTaskE_Work_49],[NotifyEventJobQueuedB_50, QueueJobB_50, FetchJobE_50, ScheduleTaskE_Work_50],[NotifyEventJobQueuedB_51, QueueJobB_51, FetchJobE_51, ScheduleTaskE_Work_51],[NotifyEventJobQueuedB_52, QueueJobB_52, FetchJobE_52, ScheduleTaskE_Work_52],[NotifyEventJobQueuedB_53, QueueJobB_53, FetchJobE_53, ScheduleTaskE_Work_53],[NotifyEventJobQueuedB_54, QueueJobB_54, FetchJobE_54, ScheduleTaskE_Work_54],[NotifyEventJobQueuedB_55, QueueJobB_55, FetchJobE_55, ScheduleTaskE_Work_55],[DataOnSrc_0, PlaceSources_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, PlaceSources_1, ModifiedSrc_1, AbourtToModifySrc_1],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-03 02:57:25] [INFO ] Flatten gal took : 171 ms
[2025-06-03 02:57:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality9715029170587705343.gal : 87 ms
[2025-06-03 02:57:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8637707512838115063.ctl : 9 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/CTLCardinality9715029170587705343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8637707512838115063.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 6 CTL formulae.

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="PolyORBLF-COL-S02J06T08"
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 PolyORBLF-COL-S02J06T08, 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 r156-tall-174881253700297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;