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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K 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-COL-V50P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748544979037

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-05-29 18:56:21] [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 18:56:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:56:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-05-29 18:56:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-29 18:56:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1325 ms
[2025-05-29 18:56:23] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 40 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2025-05-29 18:56:23] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2025-05-29 18:56:23] [INFO ] Skeletonized 10 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
// Phase 1: matrix 10 rows 12 cols
[2025-05-29 18:56:23] [INFO ] Computed 4 invariants in 11 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 1, 0, 50, 0, 1, 0] Max Struct:[50, 50, 20, 50, 1, 1, 50, 50, 1, 1]
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-05-29 18:56:23] [INFO ] Invariant cache hit.
[2025-05-29 18:56:23] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2025-05-29 18:56:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-29 18:56:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-29 18:56:23] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Minimization took 18 ms.
[2025-05-29 18:56:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:56:23] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-29 18:56:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-29 18:56:23] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-29 18:56:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 18:56:24] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-29 18:56:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 18:56:24] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-29 18:56:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 18:56:24] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-05-29 18:56:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-29 18:56:24] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:56:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-05-29 18:56:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-29 18:56:24] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 18:56:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:56:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 18:56:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-05-29 18:56:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-29 18:56:24] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 20, 50, 1, 50, 1]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2025-05-29 18:56:24] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 140 ms.
[2025-05-29 18:56:24] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 20, 50, 1, 50, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 20, 50, 1, 50, 1]
[2025-05-29 18:56:24] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2025-05-29 18:56:24] [INFO ] Computed 7 invariants in 48 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 20, 50, 1, 50, 1]
RANDOM walk for 10000 steps (22 resets) in 210 ms. (47 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (17 resets) in 196 ms. (101 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 18:56:25] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
[2025-05-29 18:56:25] [INFO ] Invariant cache hit.
[2025-05-29 18:56:25] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-29 18:56:25] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-05-29 18:56:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 18:56:25] [INFO ] [Real]Added 22 Read/Feed constraints in 28 ms returned sat
[2025-05-29 18:56:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:56:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-29 18:56:25] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-05-29 18:56:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 66 ms returned sat
[2025-05-29 18:56:25] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 135 ms.
[2025-05-29 18:56:26] [INFO ] Added : 10 causal constraints over 2 iterations in 271 ms. Result :sat
Minimization took 193 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 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 262 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
Running 1324 sub problems to find dead transitions.
[2025-05-29 18:56:26] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2025-05-29 18:56:26] [INFO ] Computed 5 invariants in 12 ms
[2025-05-29 18:56:26] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
[2025-05-29 18:56:42] [INFO ] Deduced a trap composed of 5 places in 514 ms of which 21 ms to minimize.
[2025-05-29 18:56:52] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 3 ms to minimize.
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 7 constraints, problems are : Problem set: 50 solved, 1274 unsolved in 20101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1324/1324 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 1274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 1274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 125/374 variables, and 7 constraints, problems are : Problem set: 50 solved, 1274 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1324 constraints, Known Traps: 2/2 constraints]
After SMT, in 47850ms problems are : Problem set: 50 solved, 1274 unsolved
Search for dead transitions found 50 dead transitions in 47921ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 50 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/128 places, 1277/1328 transitions.
Applied a total of 0 rules in 147 ms. Remains 125 /125 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48364 ms. Remains : 125/128 places, 1277/1328 transitions.
[2025-05-29 18:57:14] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
// Phase 1: matrix 248 rows 125 cols
[2025-05-29 18:57:14] [INFO ] Computed 5 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2622 resets) in 8033 ms. (124 steps per ms)
BEST_FIRST walk for 1000000 steps (1085 resets) in 3387 ms. (295 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 18:57:26] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
[2025-05-29 18:57:26] [INFO ] Invariant cache hit.
[2025-05-29 18:57:26] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 18:57:26] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-05-29 18:57:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 18:57:26] [INFO ] [Real]Added 21 Read/Feed constraints in 21 ms returned sat
[2025-05-29 18:57:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:57:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 18:57:26] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-29 18:57:26] [INFO ] [Nat]Added 21 Read/Feed constraints in 24 ms returned sat
[2025-05-29 18:57:26] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 135 transitions) in 49 ms.
[2025-05-29 18:57:26] [INFO ] Added : 10 causal constraints over 2 iterations in 134 ms. Result :sat
Minimization took 258 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 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1277/1277 transitions.
Applied a total of 0 rules in 67 ms. Remains 125 /125 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 125/125 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1277/1277 transitions.
Applied a total of 0 rules in 66 ms. Remains 125 /125 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2025-05-29 18:57:27] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
[2025-05-29 18:57:27] [INFO ] Invariant cache hit.
[2025-05-29 18:57:27] [INFO ] Implicit Places using invariants in 366 ms returned []
[2025-05-29 18:57:27] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
[2025-05-29 18:57:27] [INFO ] Invariant cache hit.
[2025-05-29 18:57:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 18:57:29] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2585 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1277/1277 transitions.
Applied a total of 0 rules in 94 ms. Remains 123 /123 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2745 ms. Remains : 123/125 places, 1277/1277 transitions.
[2025-05-29 18:57:30] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
// Phase 1: matrix 248 rows 123 cols
[2025-05-29 18:57:30] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2622 resets) in 7044 ms. (141 steps per ms)
BEST_FIRST walk for 1000000 steps (1086 resets) in 2783 ms. (359 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 18:57:39] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
[2025-05-29 18:57:39] [INFO ] Invariant cache hit.
[2025-05-29 18:57:39] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 18:57:40] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-05-29 18:57:40] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 18:57:40] [INFO ] [Real]Added 21 Read/Feed constraints in 16 ms returned sat
[2025-05-29 18:57:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:57:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 18:57:40] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-29 18:57:40] [INFO ] [Nat]Added 21 Read/Feed constraints in 20 ms returned sat
[2025-05-29 18:57:40] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 135 transitions) in 45 ms.
[2025-05-29 18:57:40] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2025-05-29 18:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2025-05-29 18:57:40] [INFO ] Added : 10 causal constraints over 2 iterations in 361 ms. Result :sat
Minimization took 373 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 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1277/1277 transitions.
Applied a total of 0 rules in 107 ms. Remains 123 /123 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 123/123 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1277/1277 transitions.
Applied a total of 0 rules in 106 ms. Remains 123 /123 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2025-05-29 18:57:41] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
[2025-05-29 18:57:41] [INFO ] Invariant cache hit.
[2025-05-29 18:57:42] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-05-29 18:57:42] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
[2025-05-29 18:57:42] [INFO ] Invariant cache hit.
[2025-05-29 18:57:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 18:57:43] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2025-05-29 18:57:43] [INFO ] Redundant transitions in 127 ms returned []
Running 1274 sub problems to find dead transitions.
[2025-05-29 18:57:43] [INFO ] Flow matrix only has 248 transitions (discarded 1029 similar events)
[2025-05-29 18:57:43] [INFO ] Invariant cache hit.
[2025-05-29 18:57:43] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1274 unsolved
[2025-05-29 18:57:59] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/371 variables, and 6 constraints, problems are : Problem set: 0 solved, 1274 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 1274/1274 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1274 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/371 variables, 123/129 constraints. Problems are: Problem set: 2 solved, 1272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 21/150 constraints. Problems are: Problem set: 2 solved, 1272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 1422 constraints, problems are : Problem set: 2 solved, 1272 unsolved in 30973 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1272/1274 constraints, Known Traps: 1/1 constraints]
After SMT, in 67969ms problems are : Problem set: 2 solved, 1272 unsolved
Search for dead transitions found 2 dead transitions in 67999ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 1275/1277 transitions.
Applied a total of 0 rules in 105 ms. Remains 123 /123 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
[2025-05-29 18:58:51] [INFO ] Redundant transitions in 69 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70025 ms. Remains : 123/123 places, 1275/1277 transitions.
[2025-05-29 18:58:51] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
// Phase 1: matrix 246 rows 123 cols
[2025-05-29 18:58:51] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2623 resets) in 7093 ms. (140 steps per ms)
BEST_FIRST walk for 1000000 steps (1084 resets) in 2819 ms. (354 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 18:59:01] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2025-05-29 18:59:01] [INFO ] Invariant cache hit.
[2025-05-29 18:59:01] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2025-05-29 18:59:01] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-05-29 18:59:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 18:59:01] [INFO ] [Real]Added 21 Read/Feed constraints in 36 ms returned sat
[2025-05-29 18:59:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 18:59:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-29 18:59:01] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2025-05-29 18:59:01] [INFO ] [Nat]Added 21 Read/Feed constraints in 21 ms returned sat
[2025-05-29 18:59:02] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 135 transitions) in 45 ms.
[2025-05-29 18:59:02] [INFO ] Added : 10 causal constraints over 2 iterations in 175 ms. Result :sat
Minimization took 394 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 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1275/1275 transitions.
Applied a total of 0 rules in 65 ms. Remains 123 /123 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 123/123 places, 1275/1275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1275/1275 transitions.
Applied a total of 0 rules in 76 ms. Remains 123 /123 variables (removed 0) and now considering 1275/1275 (removed 0) transitions.
[2025-05-29 18:59:02] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2025-05-29 18:59:02] [INFO ] Invariant cache hit.
[2025-05-29 18:59:03] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-05-29 18:59:03] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2025-05-29 18:59:03] [INFO ] Invariant cache hit.
[2025-05-29 18:59:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 18:59:03] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2025-05-29 18:59:04] [INFO ] Redundant transitions in 33 ms returned []
Running 1272 sub problems to find dead transitions.
[2025-05-29 18:59:04] [INFO ] Flow matrix only has 246 transitions (discarded 1029 similar events)
[2025-05-29 18:59:04] [INFO ] Invariant cache hit.
[2025-05-29 18:59:04] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
[2025-05-29 18:59:17] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:59:18] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 2 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/369 variables, and 7 constraints, problems are : Problem set: 50 solved, 1222 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/21 constraints, PredecessorRefiner: 1272/1272 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 246/369 variables, 123/130 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 21/151 constraints. Problems are: Problem set: 50 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1373 constraints, problems are : Problem set: 50 solved, 1222 unsolved in 30750 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1222/1272 constraints, Known Traps: 2/2 constraints]
After SMT, in 67279ms problems are : Problem set: 50 solved, 1222 unsolved
Search for dead transitions found 50 dead transitions in 67297ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 1225/1275 transitions.
Applied a total of 0 rules in 54 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:00:11] [INFO ] Redundant transitions in 18 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68588 ms. Remains : 123/123 places, 1225/1275 transitions.
[2025-05-29 19:00:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
// Phase 1: matrix 245 rows 123 cols
[2025-05-29 19:00:11] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2623 resets) in 6695 ms. (149 steps per ms)
BEST_FIRST walk for 1000001 steps (1086 resets) in 2822 ms. (354 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 19:00:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:00:20] [INFO ] Invariant cache hit.
[2025-05-29 19:00:20] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:00:21] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2025-05-29 19:00:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:00:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2025-05-29 19:00:21] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-05-29 19:00:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:00:21] [INFO ] [Nat]Added 20 Read/Feed constraints in 74 ms returned sat
[2025-05-29 19:00:21] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 74 ms.
[2025-05-29 19:00:21] [INFO ] Added : 10 causal constraints over 2 iterations in 277 ms. Result :sat
Minimization took 447 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 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:00:22] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:00:22] [INFO ] Invariant cache hit.
[2025-05-29 19:00:23] [INFO ] Implicit Places using invariants in 620 ms returned []
[2025-05-29 19:00:23] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:00:23] [INFO ] Invariant cache hit.
[2025-05-29 19:00:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:00:24] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
[2025-05-29 19:00:24] [INFO ] Redundant transitions in 30 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:00:24] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:00:24] [INFO ] Invariant cache hit.
[2025-05-29 19:00:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:00:36] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31622 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 67675ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67705ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69227 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 1264 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (40 resets) in 365 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40008 steps (42 resets) in 445 ms. (89 steps per ms) remains 2/2 properties
[2025-05-29 19:01:32] [INFO ] Flatten gal took : 416 ms
[2025-05-29 19:01:32] [INFO ] Flatten gal took : 215 ms
[2025-05-29 19:01:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11280599517413815391.gal : 68 ms
[2025-05-29 19:01:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10337751682150019595.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/ReachabilityCardinality11280599517413815391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10337751682150019595.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 ...330
Loading property file /tmp/ReachabilityCardinality10337751682150019595.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
Interrupted probabilistic random walk after 205119 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 205119 steps, saw 56894 distinct states, run finished after 3006 ms. (steps per millisecond=68 ) properties seen :0
[2025-05-29 19:01:35] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:01:35] [INFO ] Invariant cache hit.
[2025-05-29 19:01:35] [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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:01:35] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
[2025-05-29 19:01:36] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1954ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 1013
Parikh walk visited 0 properties in 499 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 92 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:01:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:01:38] [INFO ] Invariant cache hit.
[2025-05-29 19:01:38] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1013 after 3956
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:01:49] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :32724 after 32735
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :32735 after 33348
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :33348 after 34963
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
[2025-05-29 19:02:22] [INFO ] Flatten gal took : 85 ms
[2025-05-29 19:02:22] [INFO ] Applying decomposition
[2025-05-29 19:02:23] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16708575512251955735.txt' '-o' '/tmp/graph16708575512251955735.bin' '-w' '/tmp/graph16708575512251955735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16708575512251955735.bin' '-l' '-1' '-v' '-w' '/tmp/graph16708575512251955735.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:02:23] [INFO ] Decomposing Gal with order
[2025-05-29 19:02:23] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:02:24] [INFO ] Removed a total of 2633 redundant transitions.
[2025-05-29 19:02:24] [INFO ] Flatten gal took : 683 ms
[2025-05-29 19:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 57 ms.
[2025-05-29 19:02:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5214685081565843428.gal : 5 ms
[2025-05-29 19:02:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9228439765002127465.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/ReachabilityCardinality5214685081565843428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9228439765002127465.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/ReachabilityCardinality9228439765002127465.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 58
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :58 after 91
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :91 after 276
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :276 after 1054
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1054 after 10708
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21595 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 47298ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 47330ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47436 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 500 ms. (79 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10708 after 26305
BEST_FIRST walk for 40002 steps (42 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (42 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :26305 after 68991
Interrupted probabilistic random walk after 263014 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 2
Probabilistic random walk after 263014 steps, saw 72817 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2025-05-29 19:02:28] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:02:28] [INFO ] Invariant cache hit.
[2025-05-29 19:02:28] [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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :401363 after 649773
[2025-05-29 19:02:29] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 2 ms to minimize.
[2025-05-29 19:02:29] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2153ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 322 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 95 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 104 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:02:31] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:02:31] [INFO ] Invariant cache hit.
[2025-05-29 19:02:31] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-05-29 19:02:31] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:02:31] [INFO ] Invariant cache hit.
[2025-05-29 19:02:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:02:32] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2025-05-29 19:02:32] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:02:32] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:02:32] [INFO ] Invariant cache hit.
[2025-05-29 19:02:32] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.87902e+06 after 7.62785e+06
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:02:45] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.51482e+07 after 3.84985e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30973 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 67278ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68485 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-03
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:03:39] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:03:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (26 resets) in 70 ms. (140 steps per ms)
BEST_FIRST walk for 10001 steps (10 resets) in 30 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 19:03:39] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:03:39] [INFO ] Invariant cache hit.
[2025-05-29 19:03:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:03:40] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-29 19:03:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:03:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:03:40] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-29 19:03:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:03:40] [INFO ] [Nat]Added 20 Read/Feed constraints in 28 ms returned sat
[2025-05-29 19:03:40] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 36 ms.
[2025-05-29 19:03:40] [INFO ] Added : 10 causal constraints over 2 iterations in 126 ms. Result :sat
Minimization took 225 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 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 91 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:03:41] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:03:41] [INFO ] Invariant cache hit.
[2025-05-29 19:03:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:03:55] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 20.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 45917ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 45944ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46040 ms. Remains : 123/123 places, 1225/1225 transitions.
[2025-05-29 19:04:27] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:04:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2622 resets) in 6925 ms. (144 steps per ms)
BEST_FIRST walk for 1000001 steps (1086 resets) in 2718 ms. (367 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2025-05-29 19:04:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:04:36] [INFO ] Invariant cache hit.
[2025-05-29 19:04:36] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:04:36] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2025-05-29 19:04:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:04:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:04:37] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-05-29 19:04:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:04:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 44 ms returned sat
[2025-05-29 19:04:37] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 60 ms.
[2025-05-29 19:04:37] [INFO ] Added : 10 causal constraints over 2 iterations in 207 ms. Result :sat
Minimization took 328 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 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 56 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 52 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:04:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:04:38] [INFO ] Invariant cache hit.
[2025-05-29 19:04:38] [INFO ] Implicit Places using invariants in 285 ms returned []
[2025-05-29 19:04:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:04:38] [INFO ] Invariant cache hit.
[2025-05-29 19:04:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:04:39] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
[2025-05-29 19:04:39] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:04:39] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:04:39] [INFO ] Invariant cache hit.
[2025-05-29 19:04:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:04:53] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31908 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 67907ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69124 ms. Remains : 123/123 places, 1225/1225 transitions.
[2025-05-29 19:05:47] [INFO ] Flatten gal took : 103 ms
[2025-05-29 19:05:47] [INFO ] Flatten gal took : 54 ms
RANDOM walk for 40000 steps (104 resets) in 564 ms. (70 steps per ms) remains 2/2 properties
[2025-05-29 19:05:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17332360535505116397.gal : 62 ms
[2025-05-29 19:05:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10320782039755703947.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/ReachabilityCardinality17332360535505116397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10320782039755703947.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 ...330
BEST_FIRST walk for 40001 steps (41 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 271 ms. (147 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10320782039755703947.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
Interrupted probabilistic random walk after 235317 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 2
Probabilistic random walk after 235317 steps, saw 65389 distinct states, run finished after 3005 ms. (steps per millisecond=78 ) properties seen :0
[2025-05-29 19:05:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:05:50] [INFO ] Invariant cache hit.
[2025-05-29 19:05:50] [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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:05:51] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
[2025-05-29 19:05:51] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1903ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 344 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 55 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:05:52] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:05:52] [INFO ] Invariant cache hit.
[2025-05-29 19:05:52] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 1013
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1013 after 3956
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:06:05] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :32724 after 32735
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :32735 after 33348
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :33348 after 34963
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
[2025-05-29 19:06:37] [INFO ] Flatten gal took : 48 ms
[2025-05-29 19:06:37] [INFO ] Applying decomposition
[2025-05-29 19:06:37] [INFO ] Flatten gal took : 49 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/graph7006503130676234394.txt' '-o' '/tmp/graph7006503130676234394.bin' '-w' '/tmp/graph7006503130676234394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7006503130676234394.bin' '-l' '-1' '-v' '-w' '/tmp/graph7006503130676234394.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:06:37] [INFO ] Decomposing Gal with order
[2025-05-29 19:06:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:06:38] [INFO ] Removed a total of 2134 redundant transitions.
[2025-05-29 19:06:38] [INFO ] Flatten gal took : 285 ms
[2025-05-29 19:06:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 285 labels/synchronizations in 19 ms.
[2025-05-29 19:06:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2741133328200822862.gal : 4 ms
[2025-05-29 19:06:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9992609134777894096.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/ReachabilityCardinality2741133328200822862.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9992609134777894096.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/ReachabilityCardinality9992609134777894096.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 49
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :49 after 94
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :94 after 179
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :179 after 281
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :281 after 343
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :343 after 663
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :663 after 10502
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10502 after 35898
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :35898 after 73533
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21691 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 48116ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 48131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48189 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 406 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (42 resets) in 225 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (42 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 222227 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 222227 steps, saw 61884 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2025-05-29 19:06:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:06:44] [INFO ] Invariant cache hit.
[2025-05-29 19:06:44] [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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 19:06:44] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 2 ms to minimize.
[2025-05-29 19:06:44] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 14 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1694ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 333 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 56 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
SDD proceeding with computation,2 properties remain. new max is 4096
Applied a total of 0 rules in 56 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2025-05-29 19:06:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:06:46] [INFO ] Invariant cache hit.
SDD size :429083 after 691646
[2025-05-29 19:06:46] [INFO ] Implicit Places using invariants in 348 ms returned []
[2025-05-29 19:06:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:06:46] [INFO ] Invariant cache hit.
[2025-05-29 19:06:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 19:06:47] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
[2025-05-29 19:06:47] [INFO ] Redundant transitions in 18 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-29 19:06:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2025-05-29 19:06:47] [INFO ] Invariant cache hit.
[2025-05-29 19:06:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-05-29 19:06:59] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9.7261e+06 after 1.19285e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1371 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 31326 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 1/1 constraints]
After SMT, in 67549ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 67564ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68841 ms. Remains : 123/123 places, 1225/1225 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10] Max Struct:[20]
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-03 in 255434 ms.
[2025-05-29 19:07:55] [INFO ] Flatten gal took : 49 ms
[2025-05-29 19:07:55] [INFO ] Applying decomposition
[2025-05-29 19:07:55] [INFO ] Flatten gal took : 39 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/graph18384980301188969938.txt' '-o' '/tmp/graph18384980301188969938.bin' '-w' '/tmp/graph18384980301188969938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18384980301188969938.bin' '-l' '-1' '-v' '-w' '/tmp/graph18384980301188969938.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:07:55] [INFO ] Decomposing Gal with order
[2025-05-29 19:07:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:07:55] [INFO ] Removed a total of 2633 redundant transitions.
[2025-05-29 19:07:55] [INFO ] Flatten gal took : 246 ms
[2025-05-29 19:07:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 35 ms.
[2025-05-29 19:07:56] [INFO ] Time to serialize gal into /tmp/UpperBounds13431606129322114319.gal : 3 ms
[2025-05-29 19:07:56] [INFO ] Time to serialize properties into /tmp/UpperBounds11368490312585885319.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/UpperBounds13431606129322114319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11368490312585885319.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 ...285
Loading property file /tmp/UpperBounds11368490312585885319.prop.
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,2.04953e+08,425.684,2569268,1435,18601,423054,2.3035e+06,118,2.8962e+06,464,4.2889e+07,0
Total reachable state count : 204953172

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P20N10-UpperBounds-03 :0 <= i2.u0.SUR_PONT_A <= 10
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-03 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P20N10-UpperBounds-03,0,426.192,2569268,1,0,423054,2.3035e+06,155,2.8962e+06,534,4.2889e+07,238
Total runtime 1121252 ms.

BK_STOP 1748546103071

--------------------
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-COL-V50P20N10"
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-COL-V50P20N10, 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-174853774200029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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