Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812400350.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 PaceMaker-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812400350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 5.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 158K 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 PaceMaker-PT-none-ReachabilityCardinality-2024-03
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-04
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-07
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2024-10
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-00
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-01
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-02
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-05
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-06
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-08
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-09
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-11
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-12
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-13
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-14
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748878582979

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PaceMaker-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 15:36:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 15:36:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 15:36:24] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2025-06-02 15:36:24] [INFO ] Transformed 70 places.
[2025-06-02 15:36:24] [INFO ] Transformed 164 transitions.
[2025-06-02 15:36:24] [INFO ] Parsed PT model containing 70 places and 164 transitions and 954 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 15:36:24] [INFO ] Flatten gal took : 93 ms
[2025-06-02 15:36:24] [INFO ] Flatten gal took : 23 ms
[2025-06-02 15:36:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17517743715360760552.gal : 31 ms
[2025-06-02 15:36:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9306723006177084525.prop : 12 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/ReachabilityCardinality17517743715360760552.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9306723006177084525.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9306723006177084525.prop.
RANDOM walk for 40000 steps (8 resets) in 1957 ms. (20 steps per ms) remains 15/16 properties
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 42
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :42 after 96
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :96 after 222
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :222 after 4040
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 15/15 properties
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :4040 after 5540
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :5540 after 74544
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 132303 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 15
Probabilistic random walk after 132303 steps, saw 103314 distinct states, run finished after 3009 ms. (steps per millisecond=43 ) properties seen :0
[2025-06-02 15:36:28] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2025-06-02 15:36:28] [INFO ] Computed 35 invariants in 6 ms
[2025-06-02 15:36:28] [INFO ] State equation strengthened by 131 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-00 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-13 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 34/34 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-02 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1/70 variables, 1/35 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 158/228 variables, 70/105 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 131/236 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/236 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 236 constraints, problems are : Problem set: 3 solved, 12 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 70/70 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 15/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 32/32 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-15 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 7/39 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/41 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:29] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 2 ms to minimize.
Problem PaceMaker-PT-none-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-12 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 4/45 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/45 constraints. Problems are: Problem set: 6 solved, 9 unsolved
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-01 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 3/70 variables, 3/48 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/48 constraints. Problems are: Problem set: 7 solved, 8 unsolved
Reachability property PaceMaker-PT-none-ReachabilityCardinality-2025-06 is true.
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-09 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 158/228 variables, 70/118 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 131/249 constraints. Problems are: Problem set: 9 solved, 6 unsolved
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-05 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 6/255 constraints. Problems are: Problem set: 10 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:32] [INFO ] Deduced a trap composed of 1 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:36:32] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 2/257 constraints. Problems are: Problem set: 10 solved, 5 unsolved
SDD proceeding with computation,15 properties remain. new max is 256
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/257 constraints. Problems are: Problem set: 10 solved, 5 unsolved
SDD size :74544 after 2.27224e+08
At refinement iteration 12 (OVERLAPS) 0/228 variables, 0/257 constraints. Problems are: Problem set: 10 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 257 constraints, problems are : Problem set: 10 solved, 5 unsolved in 4708 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 70/70 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5623ms problems are : Problem set: 10 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 36017 ms.
Support contains 30 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 164/164 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 162
Applied a total of 6 rules in 21 ms. Remains 66 /70 variables (removed 4) and now considering 162/164 (removed 2) transitions.
Running 151 sub problems to find dead transitions.
[2025-06-02 15:37:09] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
Normalized transition count is 90 out of 156 initially.
// Phase 1: matrix 90 rows 66 cols
[2025-06-02 15:37:09] [INFO ] Computed 33 invariants in 1 ms
[2025-06-02 15:37:09] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 156/222 variables, 66/99 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 131/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 0/222 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 230 constraints, problems are : Problem set: 0 solved, 151 unsolved in 4195 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 66/66 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 156/222 variables, 66/99 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 131/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/222 variables, and 381 constraints, problems are : Problem set: 0 solved, 151 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 66/66 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24287ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 24288ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24321 ms. Remains : 66/70 places, 162/164 transitions.
RANDOM walk for 40000 steps (8 resets) in 523 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 221095 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 5
Probabilistic random walk after 221095 steps, saw 164391 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2025-06-02 15:37:37] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
[2025-06-02 15:37:37] [INFO ] Invariant cache hit.
[2025-06-02 15:37:37] [INFO ] State equation strengthened by 131 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/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 16/46 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 114/160 variables, 46/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 74/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 50/210 variables, 16/159 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 49/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/213 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 9/222 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/222 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 230 constraints, problems are : Problem set: 0 solved, 5 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 66/66 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:37] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:37] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:37] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:38] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:38] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:38] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:38] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:38] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem PaceMaker-PT-none-ReachabilityCardinality-2025-11 is UNSAT
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 16/46 variables, 16/31 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:38] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 114/160 variables, 46/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 74/152 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 50/210 variables, 16/168 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 8/176 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 49/225 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 2/227 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:39] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/213 variables, 4/232 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/213 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 9/222 variables, 4/236 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 2/238 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/222 variables, 4/242 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/222 variables, 2/244 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:37:48] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/222 variables, 1/245 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:18] [INFO ] Deduced a trap composed of 1 places in 32 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/222 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/222 variables, and 246 constraints, problems are : Problem set: 1 solved, 4 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 66/66 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45328ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 162/162 transitions.
Applied a total of 0 rules in 27 ms. Remains 66 /66 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 66/66 places, 162/162 transitions.
RANDOM walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 240065 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 4
Probabilistic random walk after 240065 steps, saw 179043 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2025-06-02 15:38:26] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
[2025-06-02 15:38:26] [INFO ] Invariant cache hit.
[2025-06-02 15:38:26] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 15/42 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 107/149 variables, 42/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 64/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 61/210 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 59/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/213 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 9/222 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/222 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 66/66 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:26] [INFO ] Deduced a trap composed of 1 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:26] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:26] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:26] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:26] [INFO ] Deduced a trap composed of 1 places in 16 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:26] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/42 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:26] [INFO ] Deduced a trap composed of 1 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:26] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 107/149 variables, 42/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 64/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 61/210 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 10/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 59/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:38:27] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/210 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/210 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/213 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/213 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 9/222 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/222 variables, 4/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/222 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/222 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/222 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 243 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1326 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 66/66 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1639ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 27 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 162/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 66/66 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2025-06-02 15:38:57] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
[2025-06-02 15:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:38:57] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 15:38:57] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
[2025-06-02 15:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:38:57] [INFO ] State equation strengthened by 131 read => feed constraints.
[2025-06-02 15:38:58] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 15:38:58] [INFO ] Redundant transitions in 4 ms returned []
Running 151 sub problems to find dead transitions.
[2025-06-02 15:38:58] [INFO ] Flow matrix only has 156 transitions (discarded 6 similar events)
[2025-06-02 15:38:58] [INFO ] Invariant cache hit.
[2025-06-02 15:38:58] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 156/222 variables, 66/99 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 131/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 0/222 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 230 constraints, problems are : Problem set: 0 solved, 151 unsolved in 4102 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 66/66 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 156/222 variables, 66/99 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 131/230 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/222 variables, and 381 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, State Equation: 66/66 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34174ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 34175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34404 ms. Remains : 66/66 places, 162/162 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 236 edges and 66 vertex of which 62 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 62 transition count 149
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 14 place count 56 transition count 146
Applied a total of 14 rules in 21 ms. Remains 56 /66 variables (removed 10) and now considering 146/162 (removed 16) transitions.
Running SMT prover for 4 properties.
[2025-06-02 15:39:32] [INFO ] Flow matrix only has 144 transitions (discarded 2 similar events)
Normalized transition count is 79 out of 144 initially.
// Phase 1: matrix 79 rows 56 cols
[2025-06-02 15:39:32] [INFO ] Computed 28 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 15:39:32] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 15:39:32] [INFO ] [Nat]Absence check using 28 positive place invariants in 3 ms returned sat
[2025-06-02 15:39:39] [INFO ] After 7556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2025-06-02 15:39:39] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-02 15:39:41] [INFO ] After 1294ms SMT Verify possible using 111 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:42] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:42] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:42] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 1 ms to minimize.
[2025-06-02 15:39:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 112 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:42] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2025-06-02 15:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:43] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 2 ms to minimize.
[2025-06-02 15:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:43] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
[2025-06-02 15:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 3
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:43] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 2 ms to minimize.
[2025-06-02 15:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:43] [INFO ] Deduced a trap composed of 1 places in 23 ms of which 2 ms to minimize.
[2025-06-02 15:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:43] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 2 ms to minimize.
[2025-06-02 15:39:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
TRAPS : Iteration 4
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:44] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 1 ms to minimize.
[2025-06-02 15:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 5
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:44] [INFO ] Deduced a trap composed of 1 places in 24 ms of which 2 ms to minimize.
[2025-06-02 15:39:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
TRAPS : Iteration 6
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 15:39:45] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 1 ms to minimize.
[2025-06-02 15:39:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 7
[2025-06-02 15:39:45] [INFO ] After 6095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-02 15:39:46] [INFO ] After 13808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-02 15:39:46] [INFO ] Flatten gal took : 24 ms
[2025-06-02 15:39:46] [INFO ] Flatten gal took : 12 ms
[2025-06-02 15:39:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2125941012518459094.gal : 7 ms
[2025-06-02 15:39:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10590778258866619099.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/ReachabilityCardinality2125941012518459094.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10590778258866619099.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10590778258866619099.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 36
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :36 after 7200
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :7200 after 45492
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :45492 after 856632
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :856632 after 3.9168e+06
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :2.27224e+08 after 9.02493e+09
Detected timeout of ITS tools.
[2025-06-02 15:40:01] [INFO ] Flatten gal took : 9 ms
[2025-06-02 15:40:01] [INFO ] Applying decomposition
[2025-06-02 15:40:01] [INFO ] Flatten gal took : 8 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/graph12130471804138811616.txt' '-o' '/tmp/graph12130471804138811616.bin' '-w' '/tmp/graph12130471804138811616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12130471804138811616.bin' '-l' '-1' '-v' '-w' '/tmp/graph12130471804138811616.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:40:01] [INFO ] Decomposing Gal with order
[2025-06-02 15:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:40:01] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-02 15:40:01] [INFO ] Flatten gal took : 68 ms
[2025-06-02 15:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2025-06-02 15:40:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6293129806103496830.gal : 7 ms
[2025-06-02 15:40:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11615235333635701215.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/ReachabilityCardinality6293129806103496830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11615235333635701215.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11615235333635701215.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 36
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :36 after 144
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :144 after 4608
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :4608 after 6.77837e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 44240 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 15:40:16] [INFO ] Flatten gal took : 11 ms
[2025-06-02 15:40:16] [INFO ] Applying decomposition
[2025-06-02 15:40:16] [INFO ] Flatten gal took : 10 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/graph17636248887019622026.txt' '-o' '/tmp/graph17636248887019622026.bin' '-w' '/tmp/graph17636248887019622026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17636248887019622026.bin' '-l' '-1' '-v' '-w' '/tmp/graph17636248887019622026.weights' '-q' '0' '-e' '0.001'
[2025-06-02 15:40:16] [INFO ] Decomposing Gal with order
[2025-06-02 15:40:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 15:40:16] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-02 15:40:16] [INFO ] Flatten gal took : 24 ms
[2025-06-02 15:40:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2025-06-02 15:40:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14289221950894835004.gal : 3 ms
[2025-06-02 15:40:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12208760817834042314.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14289221950894835004.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12208760817834042314.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12208760817834042314.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 25
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :25 after 168
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :168 after 2130
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2130 after 23040
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :23040 after 209664
Detected timeout of ITS tools.
[2025-06-02 16:10:16] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2442326672444428030
[2025-06-02 16:10:16] [INFO ] Applying decomposition
[2025-06-02 16:10:16] [INFO ] Flatten gal took : 7 ms
[2025-06-02 16:10:16] [INFO ] Computing symmetric may disable matrix : 162 transitions.
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/graph4890416846809364119.txt' '-o' '/tmp/graph4890416846809364119.bin' '-w' '/tmp/graph4890416846809364119.weights'
[2025-06-02 16:10:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:10:16] [INFO ] Computing symmetric may enable matrix : 162 transitions.
[2025-06-02 16:10:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4890416846809364119.bin' '-l' '-1' '-v' '-w' '/tmp/graph4890416846809364119.weights' '-q' '0' '-e' '0.001'
[2025-06-02 16:10:16] [INFO ] Decomposing Gal with order
[2025-06-02 16:10:16] [INFO ] Computing Do-Not-Accords matrix : 162 transitions.
[2025-06-02 16:10:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 16:10:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 16:10:16] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2442326672444428030
[2025-06-02 16:10:16] [INFO ] Removed a total of 109 redundant transitions.
Running compilation step : cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 16:10:16] [INFO ] Flatten gal took : 37 ms
[2025-06-02 16:10:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-02 16:10:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18154449267933844440.gal : 2 ms
[2025-06-02 16:10:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15439388719343766511.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18154449267933844440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15439388719343766511.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15439388719343766511.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 1632
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1632 after 42240
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :42240 after 244992
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :244992 after 1.37626e+08
Compilation finished in 679 ms.
Running link step : cd /tmp/ltsmin2442326672444428030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202404==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202404==true'
Running LTSmin : cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202410==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202410==true'
Running LTSmin : cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202514==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202514==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Initializing POR dependencies: labels 166, guards 162
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.126: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 0.129: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.128: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.129: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.129: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.128: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.129: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.129: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.134: "PaceMakerPTnoneReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.134: There are 166 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.134: State length is 66, there are 162 groups
pins2lts-mc-linux64( 0/ 8), 0.134: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.134: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.134: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.134: Visible groups: 0 / 162, labels: 1 / 166
pins2lts-mc-linux64( 0/ 8), 0.134: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.134: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.197: ~2 levels ~960 states ~10088 transitions
pins2lts-mc-linux64( 2/ 8), 0.235: ~2 levels ~1920 states ~19912 transitions
pins2lts-mc-linux64( 2/ 8), 0.333: ~2 levels ~3840 states ~39080 transitions
pins2lts-mc-linux64( 2/ 8), 0.557: ~3 levels ~7680 states ~79152 transitions
pins2lts-mc-linux64( 2/ 8), 0.915: ~4 levels ~15360 states ~163264 transitions
pins2lts-mc-linux64( 2/ 8), 1.587: ~5 levels ~30720 states ~325904 transitions
pins2lts-mc-linux64( 7/ 8), 2.819: ~8 levels ~61440 states ~669960 transitions
pins2lts-mc-linux64( 2/ 8), 4.990: ~7 levels ~122880 states ~1236632 transitions
pins2lts-mc-linux64( 3/ 8), 8.747: ~7 levels ~245760 states ~2463128 transitions
pins2lts-mc-linux64( 3/ 8), 16.652: ~8 levels ~491520 states ~5190408 transitions
pins2lts-mc-linux64( 3/ 8), 31.562: ~9 levels ~983040 states ~10560456 transitions
pins2lts-mc-linux64( 3/ 8), 62.323: ~10 levels ~1966080 states ~21421432 transitions
pins2lts-mc-linux64( 3/ 8), 126.730: ~11 levels ~3932160 states ~44165480 transitions
pins2lts-mc-linux64( 3/ 8), 257.294: ~12 levels ~7864320 states ~90619592 transitions
pins2lts-mc-linux64( 2/ 8), 354.383: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 354.434:
pins2lts-mc-linux64( 0/ 8), 354.434: mean standard work distribution: 4.6% (states) 1.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 354.435:
pins2lts-mc-linux64( 0/ 8), 354.435: Explored 9696438 states 122709018 transitions, fanout: 12.655
pins2lts-mc-linux64( 0/ 8), 354.435: Total exploration time 354.290 sec (354.250 sec minimum, 354.271 sec on average)
pins2lts-mc-linux64( 0/ 8), 354.435: States per second: 27369, Transitions per second: 346352
pins2lts-mc-linux64( 0/ 8), 354.435: Ignoring proviso: 3026248
pins2lts-mc-linux64( 0/ 8), 354.435:
pins2lts-mc-linux64( 0/ 8), 354.435: Queue width: 8B, total height: 11480160, memory: 87.59MB
pins2lts-mc-linux64( 0/ 8), 354.435: Tree memory: 417.5MB, 20.7 B/state, compr.: 7.8%
pins2lts-mc-linux64( 0/ 8), 354.435: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 354.435: Stored 168 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 354.435: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 354.435: Est. total memory use: 505.1MB (~1111.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2442326672444428030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'PaceMakerPTnoneReachabilityCardinality202403==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:1583)

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="PaceMaker-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
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 PaceMaker-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812400350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PaceMaker-PT-none.tgz
mv PaceMaker-PT-none execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;