MCC'2024- Execution of r065-tajo-171620414500171

About the Execution of 2023-gold for BridgeAndVehicles-PT-V80P20N10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16217.212	3600000.00	3618789.00	40787.00	80 1 20 80 ? 80 80 1 1 1 80 80 1 1 20 80	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414500171.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BridgeAndVehicles-PT-V80P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414500171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1716635603864

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 11:13:25] [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]
[2024-05-25 11:13:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:13:25] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-25 11:13:25] [INFO ] Transformed 188 places.
[2024-05-25 11:13:25] [INFO ] Transformed 2108 transitions.
[2024-05-25 11:13:25] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 370 out of 2108 initially.
// Phase 1: matrix 370 rows 188 cols
[2024-05-25 11:13:26] [INFO ] Computed 7 invariants in 37 ms
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 9) seen :228
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :163
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :7
[2024-05-25 11:13:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-25 11:13:26] [INFO ] Computed 7 invariants in 11 ms
[2024-05-25 11:13:26] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-05-25 11:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:13:26] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-25 11:13:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:13:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-25 11:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:13:26] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-25 11:13:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:13:27] [INFO ] [Nat]Added 22 Read/Feed constraints in 97 ms returned sat
[2024-05-25 11:13:27] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 4 ms to minimize.
[2024-05-25 11:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2024-05-25 11:13:27] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 105 ms.
[2024-05-25 11:13:27] [INFO ] Added : 10 causal constraints over 2 iterations in 209 ms. Result :sat
Minimization took 160 ms.
[2024-05-25 11:13:27] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [20, 1] Max seen :[6, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 373 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 11:13:28] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:13:28] [INFO ] Computed 5 invariants in 12 ms
[2024-05-25 11:13:29] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1183 ms. Remains : 185/188 places, 2107/2108 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:13:29] [INFO ] Computed 5 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 7106 ms. (steps per millisecond=140 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 696 resets, run finished after 2547 ms. (steps per millisecond=392 ) properties (out of 1) seen :10
[2024-05-25 11:13:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 11:13:39] [INFO ] Computed 5 invariants in 5 ms
[2024-05-25 11:13:39] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 11:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:13:39] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-25 11:13:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:13:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 11:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:13:39] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-25 11:13:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:13:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 70 ms returned sat
[2024-05-25 11:13:39] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 2 ms to minimize.
[2024-05-25 11:13:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2024-05-25 11:13:39] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 100 ms.
[2024-05-25 11:13:40] [INFO ] Added : 10 causal constraints over 2 iterations in 569 ms. Result :sat
Minimization took 219 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 326 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 228 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:13:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:13:41] [INFO ] Invariant cache hit.
[2024-05-25 11:13:42] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-25 11:13:42] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:13:42] [INFO ] Invariant cache hit.
[2024-05-25 11:13:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:13:43] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1949 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 177 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2356 ms. Remains : 183/185 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:13:43] [INFO ] Computed 5 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6743 ms. (steps per millisecond=148 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 695 resets, run finished after 2639 ms. (steps per millisecond=378 ) properties (out of 1) seen :10
[2024-05-25 11:13:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:13:53] [INFO ] Computed 5 invariants in 5 ms
[2024-05-25 11:13:53] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 11:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:13:53] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2024-05-25 11:13:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:13:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 11:13:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:13:53] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-05-25 11:13:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:13:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 34 ms returned sat
[2024-05-25 11:13:54] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 2 ms to minimize.
[2024-05-25 11:13:54] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2024-05-25 11:13:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2024-05-25 11:13:54] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 72 ms.
[2024-05-25 11:13:54] [INFO ] Added : 11 causal constraints over 3 iterations in 255 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 161 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 156 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:13:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:13:55] [INFO ] Invariant cache hit.
[2024-05-25 11:13:55] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-25 11:13:55] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:13:55] [INFO ] Invariant cache hit.
[2024-05-25 11:13:56] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2024-05-25 11:13:56] [INFO ] Redundant transitions in 139 ms returned []
[2024-05-25 11:13:56] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:13:56] [INFO ] Invariant cache hit.
[2024-05-25 11:13:57] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2220 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V80P20N10-UpperBounds-04
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:13:57] [INFO ] Computed 5 invariants in 7 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :10
[2024-05-25 11:13:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:13:57] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 11:13:57] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 11:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:13:58] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-05-25 11:13:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:13:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 11:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:13:58] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-05-25 11:13:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:13:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 34 ms returned sat
[2024-05-25 11:13:58] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2024-05-25 11:13:59] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-25 11:13:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 642 ms
[2024-05-25 11:13:59] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 65 ms.
[2024-05-25 11:13:59] [INFO ] Added : 11 causal constraints over 3 iterations in 257 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 159 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:13:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:13:59] [INFO ] Invariant cache hit.
[2024-05-25 11:14:00] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 963 ms. Remains : 183/183 places, 2107/2107 transitions.
Normalized transition count is 369 out of 2107 initially.
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:14:00] [INFO ] Computed 5 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 1643 resets, run finished after 6088 ms. (steps per millisecond=164 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000003 steps, including 696 resets, run finished after 2325 ms. (steps per millisecond=430 ) properties (out of 1) seen :10
[2024-05-25 11:14:09] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-25 11:14:09] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 11:14:09] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 11:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 11:14:09] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-25 11:14:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 11:14:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-25 11:14:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 11:14:09] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-05-25 11:14:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 11:14:09] [INFO ] [Nat]Added 22 Read/Feed constraints in 57 ms returned sat
[2024-05-25 11:14:10] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 1 ms to minimize.
[2024-05-25 11:14:10] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-05-25 11:14:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 685 ms
[2024-05-25 11:14:10] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 62 ms.
[2024-05-25 11:14:10] [INFO ] Added : 11 causal constraints over 3 iterations in 298 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 195 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 229 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-25 11:14:11] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:14:11] [INFO ] Invariant cache hit.
[2024-05-25 11:14:12] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-25 11:14:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:14:12] [INFO ] Invariant cache hit.
[2024-05-25 11:14:12] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-25 11:14:12] [INFO ] Redundant transitions in 86 ms returned []
[2024-05-25 11:14:12] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 11:14:12] [INFO ] Invariant cache hit.
[2024-05-25 11:14:13] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2217 ms. Remains : 183/183 places, 2107/2107 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V80P20N10-UpperBounds-04 in 16027 ms.
[2024-05-25 11:14:14] [INFO ] Flatten gal took : 170 ms
[2024-05-25 11:14:14] [INFO ] Applying decomposition
[2024-05-25 11:14:14] [INFO ] Flatten gal took : 98 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17083894203572402247.txt' '-o' '/tmp/graph17083894203572402247.bin' '-w' '/tmp/graph17083894203572402247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17083894203572402247.bin' '-l' '-1' '-v' '-w' '/tmp/graph17083894203572402247.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:14:14] [INFO ] Decomposing Gal with order
[2024-05-25 11:14:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:14:15] [INFO ] Removed a total of 3713 redundant transitions.
[2024-05-25 11:14:15] [INFO ] Flatten gal took : 930 ms
[2024-05-25 11:14:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 437 labels/synchronizations in 29 ms.
[2024-05-25 11:14:15] [INFO ] Time to serialize gal into /tmp/UpperBounds12962959176439748879.gal : 5 ms
[2024-05-25 11:14:15] [INFO ] Time to serialize properties into /tmp/UpperBounds11242724003743902316.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12962959176439748879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11242724003743902316.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds11242724003743902316.prop.
Detected timeout of ITS tools.
[2024-05-25 11:34:32] [INFO ] Flatten gal took : 155 ms
[2024-05-25 11:34:32] [INFO ] Time to serialize gal into /tmp/UpperBounds508675497195837365.gal : 37 ms
[2024-05-25 11:34:32] [INFO ] Time to serialize properties into /tmp/UpperBounds1347703617055792276.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds508675497195837365.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1347703617055792276.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...303
Loading property file /tmp/UpperBounds1347703617055792276.prop.
Detected timeout of ITS tools.
[2024-05-25 11:54:52] [INFO ] Flatten gal took : 608 ms
[2024-05-25 11:54:54] [INFO ] Input system was already deterministic with 2107 transitions.
[2024-05-25 11:54:55] [INFO ] Transformed 183 places.
[2024-05-25 11:54:55] [INFO ] Transformed 2107 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 11:54:55] [INFO ] Time to serialize gal into /tmp/UpperBounds377644055761639194.gal : 25 ms
[2024-05-25 11:54:55] [INFO ] Time to serialize properties into /tmp/UpperBounds320960730803074791.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds377644055761639194.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds320960730803074791.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...347
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds320960730803074791.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10493356 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16096304 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V80P20N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BridgeAndVehicles-PT-V80P20N10, 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 r065-tajo-171620414500171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;