Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774300039.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-V80P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 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 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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 4.0K 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 45K 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-V80P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748546802046

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-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-05-29 19:26:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 19:26:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:26:44] [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 19:26:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-29 19:26:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1011 ms
[2025-05-29 19:26:45] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 33 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 10
[2025-05-29 19:26:45] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2025-05-29 19:26:45] [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 19:26:45] [INFO ] Computed 4 invariants in 12 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 80, 0, 1, 1, 0, 1, 0, 0] Max Struct:[50, 80, 80, 50, 1, 1, 80, 1, 1, 80]
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-02 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-05-29 19:26:45] [INFO ] Invariant cache hit.
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-29 19:26:46] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 16 ms.
[2025-05-29 19:26:46] [INFO ] Added : 1 causal constraints over 1 iterations in 39 ms. Result :sat
Minimization took 97 ms.
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-05-29 19:26:46] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 19:26:46] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-05-29 19:26:46] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-29 19:26:46] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-05-29 19:26:46] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 19:26:46] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-29 19:26:46] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 19:26:46] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 19:26:46] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-29 19:26:46] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-29 19:26:46] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 50, 80, 1, 80]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] 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 19:26:46] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 259 ms.
[2025-05-29 19:26:46] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[50, 80, 50, 80, 1, 80]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 50, 80, 1, 80]
[2025-05-29 19:26:46] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2025-05-29 19:26:47] [INFO ] Computed 7 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[50, 80, 50, 80, 1, 80]
RANDOM walk for 10000 steps (14 resets) in 461 ms. (21 steps per ms)
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-09 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N20-UpperBounds-14 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (16 resets) in 226 ms. (132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2025-05-29 19:26:47] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:26:47] [INFO ] Invariant cache hit.
[2025-05-29 19:26:47] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 19:26:48] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-05-29 19:26:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 19:26:48] [INFO ] [Real]Added 42 Read/Feed constraints in 52 ms returned sat
[2025-05-29 19:26:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:26:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 19:26:48] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-05-29 19:26:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 118 ms returned sat
[2025-05-29 19:26:49] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 242 ms.
[2025-05-29 19:26:50] [INFO ] Deduced a trap composed of 5 places in 694 ms of which 30 ms to minimize.
[2025-05-29 19:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 783 ms
[2025-05-29 19:26:50] [INFO ] Added : 3 causal constraints over 3 iterations in 1499 ms. Result :sat
Minimization took 319 ms.
[2025-05-29 19:26:50] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 19:26:50] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2025-05-29 19:26:50] [INFO ] [Real]Added 42 Read/Feed constraints in 48 ms returned sat
[2025-05-29 19:26:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:26:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 19:26:51] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-29 19:26:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 63 ms returned sat
[2025-05-29 19:26:51] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 523 ms.
[2025-05-29 19:26:52] [INFO ] Added : 21 causal constraints over 5 iterations in 901 ms. Result :sat
Minimization took 506 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1063 ms. Remains 196 /198 variables (removed 2) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2025-05-29 19:26:54] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 196 cols
[2025-05-29 19:26:54] [INFO ] Computed 5 invariants in 10 ms
[2025-05-29 19:26:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/606 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2025-05-29 19:28:25] [INFO ] Deduced a trap composed of 5 places in 634 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/606 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20208 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/196 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 97574ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 97735ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98858 ms. Remains : 196/198 places, 3728/3728 transitions.
[2025-05-29 19:28:31] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:28:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1455 resets) in 18821 ms. (53 steps per ms)
BEST_FIRST walk for 1516731 steps (784 resets) in 10002 ms. (151 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2025-05-29 19:29:00] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:29:00] [INFO ] Invariant cache hit.
[2025-05-29 19:29:00] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:29:00] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-05-29 19:29:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:29:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:29:00] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2025-05-29 19:29:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 19:29:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 67 ms returned sat
[2025-05-29 19:29:01] [INFO ] Deduced a trap composed of 5 places in 768 ms of which 3 ms to minimize.
[2025-05-29 19:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 837 ms
[2025-05-29 19:29:01] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 139 ms.
[2025-05-29 19:29:02] [INFO ] Added : 8 causal constraints over 6 iterations in 492 ms. Result :sat
Minimization took 703 ms.
[2025-05-29 19:29:03] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-29 19:29:03] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2025-05-29 19:29:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:29:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-29 19:29:03] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2025-05-29 19:29:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 91 ms returned sat
[2025-05-29 19:29:03] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 215 ms.
[2025-05-29 19:29:04] [INFO ] Added : 21 causal constraints over 5 iterations in 762 ms. Result :sat
Minimization took 590 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 632 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 632 ms. Remains : 196/196 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 573 ms. Remains 196 /196 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2025-05-29 19:29:08] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:29:08] [INFO ] Invariant cache hit.
[2025-05-29 19:29:09] [INFO ] Implicit Places using invariants in 854 ms returned []
[2025-05-29 19:29:09] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:29:09] [INFO ] Invariant cache hit.
[2025-05-29 19:29:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 19:29:13] [INFO ] Implicit Places using invariants and state equation in 4199 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5070 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 194/196 places, 3728/3728 transitions.
Applied a total of 0 rules in 662 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6307 ms. Remains : 194/196 places, 3728/3728 transitions.
[2025-05-29 19:29:14] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 194 cols
[2025-05-29 19:29:14] [INFO ] Computed 5 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1455 resets) in 16770 ms. (59 steps per ms)
BEST_FIRST walk for 1688375 steps (875 resets) in 10002 ms. (168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2025-05-29 19:29:40] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:29:40] [INFO ] Invariant cache hit.
[2025-05-29 19:29:40] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:29:41] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-05-29 19:29:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 19:29:41] [INFO ] [Real]Added 42 Read/Feed constraints in 45 ms returned sat
[2025-05-29 19:29:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:29:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:29:41] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-05-29 19:29:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 118 ms returned sat
[2025-05-29 19:29:41] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 171 ms.
[2025-05-29 19:29:42] [INFO ] Added : 5 causal constraints over 4 iterations in 600 ms. Result :sat
Minimization took 387 ms.
[2025-05-29 19:29:42] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-29 19:29:42] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-05-29 19:29:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:29:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-29 19:29:43] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-05-29 19:29:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 74 ms returned sat
[2025-05-29 19:29:43] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 171 ms.
[2025-05-29 19:29:43] [INFO ] Added : 20 causal constraints over 5 iterations in 591 ms. Result :sat
Minimization took 781 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 680 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 194/194 places, 3728/3728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 667 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
[2025-05-29 19:29:47] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:29:47] [INFO ] Invariant cache hit.
[2025-05-29 19:29:48] [INFO ] Implicit Places using invariants in 868 ms returned []
[2025-05-29 19:29:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:29:48] [INFO ] Invariant cache hit.
[2025-05-29 19:29:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 19:29:53] [INFO ] Implicit Places using invariants and state equation in 5002 ms returned []
Implicit Place search using SMT with State Equation took 5874 ms to find 0 implicit places.
[2025-05-29 19:29:54] [INFO ] Redundant transitions in 528 ms returned []
Running 3725 sub problems to find dead transitions.
[2025-05-29 19:29:54] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:29:54] [INFO ] Invariant cache hit.
[2025-05-29 19:29:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2025-05-29 19:31:35] [INFO ] Deduced a trap composed of 5 places in 748 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 30145 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 114520ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 114609ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121703 ms. Remains : 194/194 places, 3728/3728 transitions.
RANDOM walk for 40000 steps (56 resets) in 2190 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (16 resets) in 713 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40020 steps (17 resets) in 678 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 623 ms. (64 steps per ms) remains 4/4 properties
[2025-05-29 19:31:50] [INFO ] Flatten gal took : 941 ms
BEST_FIRST walk for 40004 steps (20 resets) in 616 ms. (64 steps per ms) remains 4/4 properties
[2025-05-29 19:31:50] [INFO ] Flatten gal took : 458 ms
[2025-05-29 19:31:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5499317812237063136.gal : 160 ms
[2025-05-29 19:31:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13043623261756784215.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/ReachabilityCardinality5499317812237063136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13043623261756784215.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13043623261756784215.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 16
Interrupted probabilistic random walk after 81252 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 4
Probabilistic random walk after 81252 steps, saw 23372 distinct states, run finished after 3011 ms. (steps per millisecond=26 ) properties seen :0
[2025-05-29 19:31:53] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:31:53] [INFO ] Invariant cache hit.
[2025-05-29 19:31:53] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 34
At refinement iteration 5 (OVERLAPS) 414/579 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 42/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/581 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :34 after 68
[2025-05-29 19:31:54] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 23/604 variables, 23/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/604 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 242 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 414/579 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :68 after 134
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 42/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/581 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/581 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/581 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 23/604 variables, 23/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/604 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/604 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :134 after 325
At refinement iteration 17 (OVERLAPS) 0/604 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 246 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3912 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 5631ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2745 ms.
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 transitions.
Applied a total of 0 rules in 527 ms. Remains 194 /194 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2025-05-29 19:32:02] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:32:02] [INFO ] Invariant cache hit.
[2025-05-29 19:32:02] [INFO ] State equation strengthened by 42 read => feed constraints.
Detected timeout of ITS tools.
[2025-05-29 19:32:41] [INFO ] Flatten gal took : 240 ms
[2025-05-29 19:32:41] [INFO ] Applying decomposition
[2025-05-29 19:32:41] [INFO ] Flatten gal took : 257 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/graph7249150317296759663.txt' '-o' '/tmp/graph7249150317296759663.bin' '-w' '/tmp/graph7249150317296759663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7249150317296759663.bin' '-l' '-1' '-v' '-w' '/tmp/graph7249150317296759663.weights' '-q' '0' '-e' '0.001'
[2025-05-29 19:32:42] [INFO ] Decomposing Gal with order
[2025-05-29 19:32:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 19:32:45] [INFO ] Removed a total of 6953 redundant transitions.
[2025-05-29 19:32:45] [INFO ] Flatten gal took : 2456 ms
[2025-05-29 19:32:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 127 ms.
[2025-05-29 19:32:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality942536052983954172.gal : 22 ms
[2025-05-29 19:32:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9016600031133977388.prop : 18 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/ReachabilityCardinality942536052983954172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9016600031133977388.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 ...306
Loading property file /tmp/ReachabilityCardinality9016600031133977388.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :17 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 31
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :31 after 48
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :48 after 81
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :81 after 131
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :131 after 520
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :520 after 13045
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :13045 after 19922
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :19922 after 77920
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :77920 after 156068
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :156068 after 353554
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 194/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20101 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.69774e+07 after 2.31288e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Detected timeout of ITS tools.
[2025-05-29 19:33:41] [INFO ] Deduced a trap composed of 5 places in 883 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20205 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/194 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 103298ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 103380ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103932 ms. Remains : 194/194 places, 3728/3728 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[20, 20] Max Struct:[50, 50]
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N20-UpperBounds-00
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2025-05-29 19:33:45] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:33:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (14 resets) in 217 ms. (45 steps per ms)
BEST_FIRST walk for 10001 steps (4 resets) in 56 ms. (175 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[50]
[2025-05-29 19:33:45] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2025-05-29 19:33:45] [INFO ] Invariant cache hit.
[2025-05-29 19:33:45] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-29 19:33:45] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-29 19:33:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-29 19:33:46] [INFO ] [Real]Added 42 Read/Feed constraints in 43 ms returned sat
[2025-05-29 19:33:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:33:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:33:46] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-05-29 19:33:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 79 ms returned sat
[2025-05-29 19:33:46] [INFO ] Computed and/alt/rep : 180/358/180 causal constraints (skipped 227 transitions) in 174 ms.
[2025-05-29 19:33:47] [INFO ] Added : 5 causal constraints over 4 iterations in 720 ms. Result :sat
Minimization took 310 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[50]
Support contains 1 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 3728/3728 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 2 place count 193 transition count 3727
Applied a total of 2 rules in 706 ms. Remains 193 /194 variables (removed 1) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2025-05-29 19:33:48] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2025-05-29 19:33:48] [INFO ] Computed 5 invariants in 3 ms
[2025-05-29 19:33:48] [INFO ] State equation strengthened by 42 read => feed constraints.

BK_STOP 1748547247558

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

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