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.r027-smll-174853774300046.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 BridgeAndVehicles-PT-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 422K 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 9.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 141K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 578K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 434K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748547534209

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:38:56] [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-05-29 19:38:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:38:57] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2025-05-29 19:38:57] [INFO ] Transformed 68 places.
[2025-05-29 19:38:57] [INFO ] Transformed 548 transitions.
[2025-05-29 19:38:57] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Reduction of identical properties reduced properties to check from 16 to 12
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[20, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[20, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 19:38:57] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2025-05-29 19:38:57] [INFO ] Computed 7 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 0, 0, 0, 0, 20, 0, 0, 0, 0, 0] Max Struct:[20, 2, 20, 20, 20, 20, 1, 20, 1, 1, 1]
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (56 resets) in 192 ms. (51 steps per ms)
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20000 steps (41 resets) in 130 ms. (152 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 10] Max Struct:[2, 20]
[2025-05-29 19:38:58] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
[2025-05-29 19:38:58] [INFO ] Invariant cache hit.
[2025-05-29 19:38:58] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned unsat
[2025-05-29 19:38:58] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-29 19:38:58] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-05-29 19:38:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 19:38:58] [INFO ] [Real]Added 22 Read/Feed constraints in 37 ms returned sat
[2025-05-29 19:38:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:38:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 19:38:58] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-05-29 19:38:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 24 ms returned sat
[2025-05-29 19:38:59] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 65 ms.
[2025-05-29 19:38:59] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 16 ms to minimize.
[2025-05-29 19:38:59] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 3 ms to minimize.
[2025-05-29 19:38:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
[2025-05-29 19:38:59] [INFO ] Added : 11 causal constraints over 3 iterations in 589 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 10] Max Struct:[1, 20]
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 106 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
Running 544 sub problems to find dead transitions.
[2025-05-29 19:39:00] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2025-05-29 19:39:00] [INFO ] Computed 5 invariants in 4 ms
[2025-05-29 19:39:00] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2025-05-29 19:39:04] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2025-05-29 19:39:06] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 524 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 22 solved, 522 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 22 solved, 522 unsolved
[2025-05-29 19:39:13] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD276 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/194 variables, and 95 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/73 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 502/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 20)
(s23 0)
(s24 20)
(s25 0)timeout

(s26 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/194 variables, and 597 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 502/544 constraints, Known Traps: 3/3 constraints]
After SMT, in 41764ms problems are : Problem set: 42 solved, 502 unsolved
Search for dead transitions found 42 dead transitions in 41802ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/68 places, 505/548 transitions.
Applied a total of 0 rules in 50 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41987 ms. Remains : 65/68 places, 505/548 transitions.
[2025-05-29 19:39:42] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2025-05-29 19:39:42] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (6489 resets) in 3552 ms. (281 steps per ms)
BEST_FIRST walk for 1000001 steps (2544 resets) in 1464 ms. (682 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 19:39:47] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:39:47] [INFO ] Invariant cache hit.
[2025-05-29 19:39:47] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:39:47] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:39:47] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-29 19:39:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:39:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:39:47] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:39:47] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-29 19:39:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:39:47] [INFO ] [Nat]Added 20 Read/Feed constraints in 10 ms returned sat
[2025-05-29 19:39:47] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 30 ms.
[2025-05-29 19:39:47] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2025-05-29 19:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2025-05-29 19:39:47] [INFO ] Added : 11 causal constraints over 3 iterations in 266 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 27 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 65/65 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-29 19:39:47] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:39:47] [INFO ] Invariant cache hit.
[2025-05-29 19:39:47] [INFO ] Implicit Places using invariants in 204 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 208 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 505/505 transitions.
Applied a total of 0 rules in 17 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 247 ms. Remains : 63/65 places, 505/505 transitions.
[2025-05-29 19:39:47] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 63 cols
[2025-05-29 19:39:47] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (6489 resets) in 3029 ms. (330 steps per ms)
BEST_FIRST walk for 1000001 steps (2551 resets) in 1256 ms. (795 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 19:39:52] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:39:52] [INFO ] Invariant cache hit.
[2025-05-29 19:39:52] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:39:52] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-05-29 19:39:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:39:52] [INFO ] [Real]Added 20 Read/Feed constraints in 13 ms returned sat
[2025-05-29 19:39:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:39:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:39:52] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-05-29 19:39:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 10 ms returned sat
[2025-05-29 19:39:52] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 42 ms.
[2025-05-29 19:39:52] [INFO ] Added : 11 causal constraints over 3 iterations in 109 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 23 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 26 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-29 19:39:52] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:39:52] [INFO ] Invariant cache hit.
[2025-05-29 19:39:53] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-29 19:39:53] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:39:53] [INFO ] Invariant cache hit.
[2025-05-29 19:39:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:39:53] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2025-05-29 19:39:53] [INFO ] Redundant transitions in 45 ms returned []
Running 502 sub problems to find dead transitions.
[2025-05-29 19:39:53] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:39:53] [INFO ] Invariant cache hit.
[2025-05-29 19:39:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:39:56] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 19769 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:40:23] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:40:37] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 50899ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 50909ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51491 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40000 steps (256 resets) in 1318 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (100 resets) in 515 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 406 ms. (98 steps per ms) remains 2/2 properties
[2025-05-29 19:40:45] [INFO ] Flatten gal took : 249 ms
[2025-05-29 19:40:45] [INFO ] Flatten gal took : 92 ms
[2025-05-29 19:40:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17403380600178786944.gal : 57 ms
[2025-05-29 19:40:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9995124745251953932.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17403380600178786944.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9995124745251953932.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/ReachabilityCardinality9995124745251953932.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 100
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :100 after 233
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 1750
Interrupted probabilistic random walk after 464069 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 2
Probabilistic random walk after 464069 steps, saw 116943 distinct states, run finished after 3006 ms. (steps per millisecond=154 ) properties seen :0
[2025-05-29 19:40:48] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:40:48] [INFO ] Invariant cache hit.
[2025-05-29 19:40:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:40:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 41/187 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4992 after 5154
Parikh walk visited 0 properties in 204 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2025-05-29 19:40:48] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:40:48] [INFO ] Invariant cache hit.
[2025-05-29 19:40:48] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5154 after 5311
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5311 after 5622
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:40:51] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5622 after 6071
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 16187 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:41:15] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :42030 after 57236
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 592 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
After SMT, in 37134ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 37142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37161 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40000 steps (257 resets) in 561 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 472064 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 2
Probabilistic random walk after 472064 steps, saw 118678 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2025-05-29 19:41:29] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:41:29] [INFO ] Invariant cache hit.
[2025-05-29 19:41:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:41:29] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 41/187 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 574ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 180 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 15 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-29 19:41:30] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:41:30] [INFO ] Invariant cache hit.
[2025-05-29 19:41:30] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-29 19:41:30] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:41:30] [INFO ] Invariant cache hit.
[2025-05-29 19:41:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:41:30] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2025-05-29 19:41:30] [INFO ] Redundant transitions in 11 ms returned []
Running 502 sub problems to find dead transitions.
[2025-05-29 19:41:30] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:41:30] [INFO ] Invariant cache hit.
[2025-05-29 19:41:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:41:33] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Detected timeout of ITS tools.
[2025-05-29 19:41:35] [INFO ] Flatten gal took : 45 ms
[2025-05-29 19:41:35] [INFO ] Applying decomposition
[2025-05-29 19:41:35] [INFO ] Flatten gal took : 42 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/graph1800642100934882179.txt' '-o' '/tmp/graph1800642100934882179.bin' '-w' '/tmp/graph1800642100934882179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1800642100934882179.bin' '-l' '-1' '-v' '-w' '/tmp/graph1800642100934882179.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:41:36] [INFO ] Decomposing Gal with order
[2025-05-29 19:41:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:41:36] [INFO ] Removed a total of 1025 redundant transitions.
[2025-05-29 19:41:36] [INFO ] Flatten gal took : 237 ms
[2025-05-29 19:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 18 ms.
[2025-05-29 19:41:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12448580139629272276.gal : 5 ms
[2025-05-29 19:41:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality206667885486785503.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12448580139629272276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality206667885486785503.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality206667885486785503.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 34
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :34 after 70
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :70 after 382
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :382 after 788
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :788 after 2168
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2168 after 6220
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6220 after 10790
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10790 after 20442
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :54254 after 85494
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :530233 after 531985
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 16719 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:41:57] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.89121e+06 after 3.0473e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:42:09] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 47612ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 47618ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48059 ms. Remains : 63/63 places, 505/505 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 63 transition count 125
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 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 384 place count 61 transition count 123
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 386 place count 61 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 388 place count 59 transition count 121
Applied a total of 388 rules in 15 ms. Remains 59 /63 variables (removed 4) and now considering 121/505 (removed 384) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 59 cols
[2025-05-29 19:42:18] [INFO ] Computed 5 invariants in 1 ms
[2025-05-29 19:42:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-29 19:42:18] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2025-05-29 19:42:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:42:18] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-05-29 19:42:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-29 19:42:18] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-05-29 19:42:18] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-29 19:42:18] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-29 19:42:18] [INFO ] Flatten gal took : 9 ms
[2025-05-29 19:42:18] [INFO ] Flatten gal took : 8 ms
[2025-05-29 19:42:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality531290652837862800.gal : 3 ms
[2025-05-29 19:42:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3857612993685376059.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality531290652837862800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3857612993685376059.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 ...327
Loading property file /tmp/ReachabilityCardinality3857612993685376059.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :32 after 96
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :96 after 224
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :224 after 879
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6988 after 9155
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :26298 after 33169
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :225300 after 246049
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.56805e+06 after 1.64075e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.24436e+07,0.417832,13928,2,6076,20,41850,8,0,360,36052,0
Total reachable state count : 12443600

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,7625,0.418933,13928,2,736,20,41850,8,0,362,36052,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,7625,0.41975,14188,2,736,20,41850,8,0,362,36052,0
Over-approximation ignoring read arcs solved 0 properties in 782 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:[10] Max Struct:[20]
Starting property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
[2025-05-29 19:42:19] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 63 cols
[2025-05-29 19:42:19] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (64 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (25 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 19:42:19] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:42:19] [INFO ] Invariant cache hit.
[2025-05-29 19:42:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:42:19] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-29 19:42:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:42:19] [INFO ] [Real]Added 20 Read/Feed constraints in 7 ms returned sat
[2025-05-29 19:42:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:42:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:42:19] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-05-29 19:42:19] [INFO ] [Nat]Added 20 Read/Feed constraints in 7 ms returned sat
[2025-05-29 19:42:19] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 20 ms.
[2025-05-29 19:42:19] [INFO ] Added : 11 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2025-05-29 19:42:19] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:42:19] [INFO ] Invariant cache hit.
[2025-05-29 19:42:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:42:22] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:42:52] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 592 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
After SMT, in 40886ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40909 ms. Remains : 63/63 places, 505/505 transitions.
[2025-05-29 19:43:00] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:43:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (6490 resets) in 3162 ms. (316 steps per ms)
BEST_FIRST walk for 1000001 steps (2551 resets) in 1211 ms. (825 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 19:43:04] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:43:04] [INFO ] Invariant cache hit.
[2025-05-29 19:43:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:43:04] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-29 19:43:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:43:04] [INFO ] [Real]Added 20 Read/Feed constraints in 8 ms returned sat
[2025-05-29 19:43:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:43:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:43:05] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-05-29 19:43:05] [INFO ] [Nat]Added 20 Read/Feed constraints in 12 ms returned sat
[2025-05-29 19:43:05] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 31 ms.
[2025-05-29 19:43:05] [INFO ] Added : 11 causal constraints over 3 iterations in 108 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 23 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 21 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-29 19:43:05] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:43:05] [INFO ] Invariant cache hit.
[2025-05-29 19:43:05] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-29 19:43:05] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:43:05] [INFO ] Invariant cache hit.
[2025-05-29 19:43:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:43:06] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2025-05-29 19:43:06] [INFO ] Redundant transitions in 8 ms returned []
Running 502 sub problems to find dead transitions.
[2025-05-29 19:43:06] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:43:06] [INFO ] Invariant cache hit.
[2025-05-29 19:43:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:43:09] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 23628 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:43:43] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:43:59] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 54799ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 54814ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55514 ms. Remains : 63/63 places, 505/505 transitions.
[2025-05-29 19:44:01] [INFO ] Flatten gal took : 47 ms
[2025-05-29 19:44:01] [INFO ] Flatten gal took : 43 ms
[2025-05-29 19:44:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2237587537297965428.gal : 15 ms
[2025-05-29 19:44:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13393052995583200650.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2237587537297965428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13393052995583200650.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (257 resets) in 302 ms. (132 steps per ms) remains 2/2 properties

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
BEST_FIRST walk for 40008 steps (100 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (99 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13393052995583200650.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 100
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :100 after 233
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 1750
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4992 after 5154
Interrupted probabilistic random walk after 516000 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 2
Probabilistic random walk after 516000 steps, saw 129833 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2025-05-29 19:44:04] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:44:04] [INFO ] Invariant cache hit.
[2025-05-29 19:44:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:44:04] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 41/187 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5154 after 5311
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 550ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 195 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 22 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2025-05-29 19:44:04] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:44:04] [INFO ] Invariant cache hit.
[2025-05-29 19:44:04] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5311 after 5622
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:44:07] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5622 after 6071
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:44:37] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 592 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
After SMT, in 41202ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 41213ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41237 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40004 steps (256 resets) in 324 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (100 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
BEST_FIRST walk for 40001 steps (99 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
SDD size :42030 after 57236
Interrupted probabilistic random walk after 527960 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 2
Probabilistic random walk after 527960 steps, saw 133060 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2025-05-29 19:44:49] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:44:49] [INFO ] Invariant cache hit.
[2025-05-29 19:44:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:44:49] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 41/187 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 163 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 22 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 21 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2025-05-29 19:44:50] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:44:50] [INFO ] Invariant cache hit.
[2025-05-29 19:44:50] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-29 19:44:50] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:44:50] [INFO ] Invariant cache hit.
[2025-05-29 19:44:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:44:50] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2025-05-29 19:44:50] [INFO ] Redundant transitions in 5 ms returned []
Running 502 sub problems to find dead transitions.
[2025-05-29 19:44:50] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2025-05-29 19:44:50] [INFO ] Invariant cache hit.
[2025-05-29 19:44:50] [INFO ] State equation strengthened by 20 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 19:44:51] [INFO ] Flatten gal took : 25 ms
[2025-05-29 19:44:51] [INFO ] Applying decomposition
[2025-05-29 19:44:51] [INFO ] Flatten gal took : 25 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/graph14132167323586398924.txt' '-o' '/tmp/graph14132167323586398924.bin' '-w' '/tmp/graph14132167323586398924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14132167323586398924.bin' '-l' '-1' '-v' '-w' '/tmp/graph14132167323586398924.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:44:51] [INFO ] Decomposing Gal with order
[2025-05-29 19:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:44:51] [INFO ] Removed a total of 1017 redundant transitions.
[2025-05-29 19:44:51] [INFO ] Flatten gal took : 109 ms
[2025-05-29 19:44:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 8 ms.
[2025-05-29 19:44:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5425879685378858649.gal : 3 ms
[2025-05-29 19:44:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13988824796637348565.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5425879685378858649.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13988824796637348565.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality13988824796637348565.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :21 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 140
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :140 after 288
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :288 after 1382
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1382 after 5080
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10369 after 19702
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :59921 after 96734
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:44:53] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :727233 after 911696
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.28754e+06 after 3.42131e+06
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.05339e+06,16.8255,292692,1684,3604,139979,145288,159,634884,223,3.20198e+06,0
Total reachable state count : 4053390

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,16.827,292692,1,0,139979,145288,159,634884,224,3.20198e+06,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,16.8283,292692,1,0,139979,145288,162,634884,225,3.20198e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 19709 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:45:22] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2025-05-29 19:45:36] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 20)
(s24 0)
(s25 1)
(s26 1)
(s27 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 593 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 50743ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 50753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51352 ms. Remains : 63/63 places, 505/505 transitions.
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-07 10 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-07 in 202350 ms.
[2025-05-29 19:45:41] [INFO ] Flatten gal took : 34 ms
Total runtime 404578 ms.

BK_STOP 1748547941611

--------------------
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="BridgeAndVehicles-PT-V20P20N10"
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 BridgeAndVehicles-PT-V20P20N10, 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 r027-smll-174853774300046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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