Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r237-smll-174903502700069.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 gold2024
Input is Sudoku-PT-AN09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502700069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 224K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 585K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 205K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 706K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 287K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 476K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 672K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.2M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 46K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 114K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 416K May 29 14:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749115079061

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 09:18:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 09:18:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 09:18:01] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2025-06-05 09:18:01] [INFO ] Transformed 972 places.
[2025-06-05 09:18:01] [INFO ] Transformed 729 transitions.
[2025-06-05 09:18:01] [INFO ] Found NUPN structural information;
[2025-06-05 09:18:01] [INFO ] Parsed PT model containing 972 places and 729 transitions and 2916 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 34 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[81, 81, 0, 1, 1, 1, 1, 1, 0, 1, 0] Max Struct:[81, 81, 729, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Sudoku-PT-AN09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-06 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-07 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-UpperBounds-00 81 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[729, 1, 1]
// Phase 1: matrix 729 rows 972 cols
[2025-06-05 09:18:01] [INFO ] Computed 243 invariants in 41 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[729, 1, 1]
RANDOM walk for 10000 steps (141 resets) in 729 ms. (13 steps per ms)
FORMULA Sudoku-PT-AN09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Sudoku-PT-AN09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 247 ms. (40 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[729]
[2025-06-05 09:18:02] [INFO ] Invariant cache hit.
[2025-06-05 09:18:03] [INFO ] [Real]Absence check using 243 positive place invariants in 313 ms returned sat
[2025-06-05 09:18:04] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2025-06-05 09:18:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 70 ms.
[2025-06-05 09:18:04] [INFO ] Added : 0 causal constraints over 0 iterations in 194 ms. Result :sat
Minimization took 569 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[74] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[74] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 91 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 09:18:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[729]
RANDOM walk for 482954 steps (6852 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 210560 steps (13 resets) in 5016 ms. (41 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[729]
[2025-06-05 09:18:40] [INFO ] Invariant cache hit.
[2025-06-05 09:18:41] [INFO ] [Real]Absence check using 243 positive place invariants in 312 ms returned sat
[2025-06-05 09:18:41] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2025-06-05 09:18:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 51 ms.
[2025-06-05 09:18:42] [INFO ] Added : 0 causal constraints over 0 iterations in 157 ms. Result :sat
Minimization took 5760 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 35 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 38 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 09:18:47] [INFO ] Invariant cache hit.
[2025-06-05 09:18:49] [INFO ] Implicit Places using invariants in 1969 ms returned []
[2025-06-05 09:18:49] [INFO ] Invariant cache hit.
[2025-06-05 09:18:52] [INFO ] Implicit Places using invariants and state equation in 2194 ms returned []
Implicit Place search using SMT with State Equation took 4167 ms to find 0 implicit places.
[2025-06-05 09:18:52] [INFO ] Redundant transitions in 69 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4295 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 09:18:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[76] Max Struct:[729]
RANDOM walk for 483681 steps (6866 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 210981 steps (13 resets) in 5015 ms. (42 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[729]
[2025-06-05 09:19:27] [INFO ] Invariant cache hit.
[2025-06-05 09:19:27] [INFO ] [Real]Absence check using 243 positive place invariants in 364 ms returned sat
[2025-06-05 09:19:28] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2025-06-05 09:19:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-05 09:19:28] [INFO ] Added : 0 causal constraints over 0 iterations in 170 ms. Result :sat
Minimization took 5832 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 25 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 09:19:34] [INFO ] Invariant cache hit.
[2025-06-05 09:19:36] [INFO ] Implicit Places using invariants in 1907 ms returned []
[2025-06-05 09:19:36] [INFO ] Invariant cache hit.
[2025-06-05 09:19:38] [INFO ] Implicit Places using invariants and state equation in 2214 ms returned []
Implicit Place search using SMT with State Equation took 4134 ms to find 0 implicit places.
[2025-06-05 09:19:39] [INFO ] Redundant transitions in 11 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4180 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 09:19:40] [INFO ] Flatten gal took : 336 ms
[2025-06-05 09:19:40] [INFO ] Flatten gal took : 197 ms
[2025-06-05 09:19:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13004873448804826643.gal : 60 ms
[2025-06-05 09:19:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3344418070448035933.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13004873448804826643.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3344418070448035933.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3344418070448035933.prop.
RANDOM walk for 40000 steps (564 resets) in 6391 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1350 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1675 ms. (23 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 73
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :73 after 748
Interrupted probabilistic random walk after 242742 steps, run timeout after 6001 ms. (steps per millisecond=40 ) properties seen :0 out of 2
Probabilistic random walk after 242742 steps, saw 72044 distinct states, run finished after 6008 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-05 09:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1787 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2188 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2643 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5146ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 3266 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1296 ms. (30 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 211642 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 211642 steps, saw 66475 distinct states, run finished after 3005 ms. (steps per millisecond=70 ) properties seen :0
[2025-06-05 09:19:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1710 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1701 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1701 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14208 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 16091ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 14 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[76] Max Struct:[729]
Starting property specific reduction for Sudoku-PT-AN09-UpperBounds-02
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[729]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[729]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[729]
[2025-06-05 09:20:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[729]
RANDOM walk for 10000 steps (141 resets) in 616 ms. (16 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 239 ms. (41 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[74] Max Struct:[729]
[2025-06-05 09:20:14] [INFO ] Invariant cache hit.
[2025-06-05 09:20:14] [INFO ] [Real]Absence check using 243 positive place invariants in 368 ms returned sat
[2025-06-05 09:20:15] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2025-06-05 09:20:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-05 09:20:15] [INFO ] Added : 0 causal constraints over 0 iterations in 122 ms. Result :sat
Minimization took 560 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[74] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[74] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 09:20:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[74] Max Struct:[729]
RANDOM walk for 481117 steps (6831 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 196607 steps (12 resets) in 5007 ms. (39 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[729]
[2025-06-05 09:20:51] [INFO ] Invariant cache hit.
[2025-06-05 09:20:52] [INFO ] [Real]Absence check using 243 positive place invariants in 375 ms returned sat
[2025-06-05 09:20:52] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2025-06-05 09:20:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 39 ms.
[2025-06-05 09:20:53] [INFO ] Added : 0 causal constraints over 0 iterations in 121 ms. Result :sat
Minimization took 6008 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 09:20:59] [INFO ] Invariant cache hit.
[2025-06-05 09:21:01] [INFO ] Implicit Places using invariants in 1891 ms returned []
[2025-06-05 09:21:01] [INFO ] Invariant cache hit.
[2025-06-05 09:21:03] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 3973 ms to find 0 implicit places.
[2025-06-05 09:21:03] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4001 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 09:21:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[76] Max Struct:[729]
RANDOM walk for 494760 steps (7020 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 210859 steps (13 resets) in 5001 ms. (42 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[729]
[2025-06-05 09:21:38] [INFO ] Invariant cache hit.
[2025-06-05 09:21:38] [INFO ] [Real]Absence check using 243 positive place invariants in 286 ms returned sat
[2025-06-05 09:21:39] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2025-06-05 09:21:39] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 44 ms.
[2025-06-05 09:21:39] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Minimization took 5764 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[729]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[729]
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 18 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 972/972 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 09:21:45] [INFO ] Invariant cache hit.
[2025-06-05 09:21:47] [INFO ] Implicit Places using invariants in 2149 ms returned []
[2025-06-05 09:21:47] [INFO ] Invariant cache hit.
[2025-06-05 09:21:49] [INFO ] Implicit Places using invariants and state equation in 2273 ms returned []
Implicit Place search using SMT with State Equation took 4426 ms to find 0 implicit places.
[2025-06-05 09:21:49] [INFO ] Redundant transitions in 6 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4453 ms. Remains : 972/972 places, 729/729 transitions.
[2025-06-05 09:21:50] [INFO ] Flatten gal took : 239 ms
[2025-06-05 09:21:50] [INFO ] Flatten gal took : 212 ms
[2025-06-05 09:21:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14807101969594732498.gal : 45 ms
[2025-06-05 09:21:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9744158112752432674.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14807101969594732498.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9744158112752432674.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9744158112752432674.prop.
RANDOM walk for 40000 steps (566 resets) in 5408 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1135 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1094 ms. (36 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 73
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :73 after 748
Interrupted probabilistic random walk after 231001 steps, run timeout after 6001 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 231001 steps, saw 70012 distinct states, run finished after 6001 ms. (steps per millisecond=38 ) properties seen :0
[2025-06-05 09:21:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1358 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2188 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3077 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4848ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 972/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 3759 ms. (10 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1327 ms. (30 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189427 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189427 steps, saw 63056 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-06-05 09:22:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1452 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/729 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 243/972 variables, 243/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/972 variables, 243/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1701 variables, 1/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1701 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1701 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14374 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 15997ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 77 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 6 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[76] Max Struct:[729]
Ending property specific reduction for Sudoku-PT-AN09-UpperBounds-02 in 130151 ms.
[2025-06-05 09:22:23] [INFO ] Flatten gal took : 45 ms
[2025-06-05 09:22:23] [INFO ] Applying decomposition
[2025-06-05 09:22:23] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18150007799570399856.txt' '-o' '/tmp/graph18150007799570399856.bin' '-w' '/tmp/graph18150007799570399856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18150007799570399856.bin' '-l' '-1' '-v' '-w' '/tmp/graph18150007799570399856.weights' '-q' '0' '-e' '0.001'
[2025-06-05 09:22:24] [INFO ] Decomposing Gal with order
[2025-06-05 09:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 09:22:24] [INFO ] Removed a total of 1215 redundant transitions.
[2025-06-05 09:22:24] [INFO ] Flatten gal took : 190 ms
[2025-06-05 09:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2025-06-05 09:22:24] [INFO ] Time to serialize gal into /tmp/UpperBounds12714316344876228865.gal : 20 ms
[2025-06-05 09:22:24] [INFO ] Time to serialize properties into /tmp/UpperBounds3395023384144898882.prop : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12714316344876228865.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3395023384144898882.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds3395023384144898882.prop.
ITS-tools command line returned an error code 137
[2025-06-05 09:34:00] [INFO ] Applying decomposition
[2025-06-05 09:34:00] [INFO ] Flatten gal took : 56 ms
[2025-06-05 09:34:00] [INFO ] Decomposing Gal with order
[2025-06-05 09:34:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 09:34:00] [INFO ] Removed a total of 1274 redundant transitions.
[2025-06-05 09:34:00] [INFO ] Flatten gal took : 123 ms
[2025-06-05 09:34:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2025-06-05 09:34:00] [INFO ] Time to serialize gal into /tmp/UpperBounds16337045584239225614.gal : 20 ms
[2025-06-05 09:34:00] [INFO ] Time to serialize properties into /tmp/UpperBounds7262984835469886945.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16337045584239225614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7262984835469886945.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds7262984835469886945.prop.
ITS-tools command line returned an error code 137
[2025-06-05 09:45:12] [INFO ] Flatten gal took : 69 ms
[2025-06-05 09:45:12] [INFO ] Input system was already deterministic with 729 transitions.
[2025-06-05 09:45:12] [INFO ] Transformed 972 places.
[2025-06-05 09:45:12] [INFO ] Transformed 729 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-05 09:45:13] [INFO ] Time to serialize gal into /tmp/UpperBounds10764438900148885424.gal : 12 ms
[2025-06-05 09:45:13] [INFO ] Time to serialize properties into /tmp/UpperBounds16249583114839518149.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10764438900148885424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16249583114839518149.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16249583114839518149.prop.
ITS-tools command line returned an error code 137
Total runtime 2338738 ms.

BK_STOP 1749117419706

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="Sudoku-PT-AN09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is Sudoku-PT-AN09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r237-smll-174903502700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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