Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 22K Feb 25 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 247K Feb 25 12:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 950K Feb 25 12:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 335K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 177K Feb 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 714K Feb 25 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:22 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-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678335753814

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 04:22:35] [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]
[2023-03-09 04:22:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:22:36] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-09 04:22:36] [INFO ] Transformed 128 places.
[2023-03-09 04:22:36] [INFO ] Transformed 1328 transitions.
[2023-03-09 04:22:36] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 128 cols
[2023-03-09 04:22:36] [INFO ] Computed 7 place invariants in 27 ms
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :253
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :106
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :11
[2023-03-09 04:22:36] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2023-03-09 04:22:36] [INFO ] Computed 7 place invariants in 14 ms
[2023-03-09 04:22:36] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2023-03-09 04:22:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 04:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:36] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2023-03-09 04:22:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-09 04:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:37] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-09 04:22:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:37] [INFO ] [Nat]Added 22 Read/Feed constraints in 78 ms returned sat
[2023-03-09 04:22:37] [INFO ] Deduced a trap composed of 6 places in 394 ms of which 5 ms to minimize.
[2023-03-09 04:22:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 493 ms
[2023-03-09 04:22:38] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 176 ms.
[2023-03-09 04:22:38] [INFO ] Added : 2 causal constraints over 1 iterations in 263 ms. Result :sat
Minimization took 220 ms.
Current structural bounds on expressions (after SMT) : [1, 50] Max seen :[1, 10]
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 235 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-09 04:22:38] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-09 04:22:38] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-09 04:22:40] [INFO ] Dead Transitions using invariants and state equation in 1326 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1563 ms. Remains : 125/128 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 125 cols
[2023-03-09 04:22:40] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4672 ms. (steps per millisecond=214 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1029 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties (out of 1) seen :10
[2023-03-09 04:22:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-09 04:22:46] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 04:22:46] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-09 04:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:46] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-09 04:22:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:22:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:46] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 04:22:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2023-03-09 04:22:46] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 52 ms.
[2023-03-09 04:22:46] [INFO ] Added : 7 causal constraints over 7 iterations in 159 ms. Result :sat
Minimization took 372 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 65 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 199 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:22:47] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:47] [INFO ] Invariant cache hit.
[2023-03-09 04:22:48] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-09 04:22:48] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:48] [INFO ] Invariant cache hit.
[2023-03-09 04:22:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:48] [INFO ] Implicit Places using invariants and state equation in 618 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 990 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 132 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1358 ms. Remains : 123/125 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:22:48] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4023 ms. (steps per millisecond=248 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000009 steps, including 1029 resets, run finished after 1551 ms. (steps per millisecond=644 ) properties (out of 1) seen :10
[2023-03-09 04:22:54] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:22:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 04:22:54] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:54] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-09 04:22:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:22:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:54] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-09 04:22:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 14 ms returned sat
[2023-03-09 04:22:54] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 57 ms.
[2023-03-09 04:22:54] [INFO ] Added : 12 causal constraints over 10 iterations in 222 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 56 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 79 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:22:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:55] [INFO ] Invariant cache hit.
[2023-03-09 04:22:55] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-09 04:22:55] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:55] [INFO ] Invariant cache hit.
[2023-03-09 04:22:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:56] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2023-03-09 04:22:56] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-09 04:22:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:56] [INFO ] Invariant cache hit.
[2023-03-09 04:22:56] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1664 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:22:57] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :10
[2023-03-09 04:22:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:22:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 04:22:57] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:57] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-09 04:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:22:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:22:57] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-09 04:22:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:22:57] [INFO ] [Nat]Added 22 Read/Feed constraints in 25 ms returned sat
[2023-03-09 04:22:57] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 30 ms.
[2023-03-09 04:22:57] [INFO ] Added : 12 causal constraints over 10 iterations in 173 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 57 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:22:57] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:22:57] [INFO ] Invariant cache hit.
[2023-03-09 04:22:58] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 123/123 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:22:58] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 3881 ms. (steps per millisecond=257 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1028 resets, run finished after 1835 ms. (steps per millisecond=544 ) properties (out of 1) seen :10
[2023-03-09 04:23:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-09 04:23:04] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-09 04:23:04] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:23:04] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-09 04:23:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:23:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 04:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:23:04] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-09 04:23:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:23:04] [INFO ] [Nat]Added 22 Read/Feed constraints in 16 ms returned sat
[2023-03-09 04:23:04] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 40 ms.
[2023-03-09 04:23:04] [INFO ] Added : 12 causal constraints over 10 iterations in 190 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 96 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 59 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-09 04:23:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:05] [INFO ] Invariant cache hit.
[2023-03-09 04:23:05] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-09 04:23:05] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:05] [INFO ] Invariant cache hit.
[2023-03-09 04:23:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 04:23:06] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-09 04:23:06] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-09 04:23:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-09 04:23:06] [INFO ] Invariant cache hit.
[2023-03-09 04:23:06] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1463 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-05 in 9574 ms.
[2023-03-09 04:23:07] [INFO ] Flatten gal took : 232 ms
[2023-03-09 04:23:07] [INFO ] Applying decomposition
[2023-03-09 04:23:07] [INFO ] Flatten gal took : 128 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3277168746010428685.txt' '-o' '/tmp/graph3277168746010428685.bin' '-w' '/tmp/graph3277168746010428685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3277168746010428685.bin' '-l' '-1' '-v' '-w' '/tmp/graph3277168746010428685.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:23:07] [INFO ] Decomposing Gal with order
[2023-03-09 04:23:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:23:08] [INFO ] Removed a total of 2669 redundant transitions.
[2023-03-09 04:23:08] [INFO ] Flatten gal took : 671 ms
[2023-03-09 04:23:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 346 labels/synchronizations in 47 ms.
[2023-03-09 04:23:08] [INFO ] Time to serialize gal into /tmp/UpperBounds5932412302422463328.gal : 18 ms
[2023-03-09 04:23:08] [INFO ] Time to serialize properties into /tmp/UpperBounds17956683335565777777.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5932412302422463328.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17956683335565777777.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds17956683335565777777.prop.
Detected timeout of ITS tools.
[2023-03-09 04:43:19] [INFO ] Flatten gal took : 76 ms
[2023-03-09 04:43:19] [INFO ] Time to serialize gal into /tmp/UpperBounds9717121769694616951.gal : 22 ms
[2023-03-09 04:43:19] [INFO ] Time to serialize properties into /tmp/UpperBounds558592329714897572.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9717121769694616951.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds558592329714897572.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...303
Loading property file /tmp/UpperBounds558592329714897572.prop.
Detected timeout of ITS tools.
[2023-03-09 05:03:29] [INFO ] Flatten gal took : 53 ms
[2023-03-09 05:03:29] [INFO ] Input system was already deterministic with 1327 transitions.
[2023-03-09 05:03:29] [INFO ] Transformed 123 places.
[2023-03-09 05:03:29] [INFO ] Transformed 1327 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
[2023-03-09 05:03:29] [INFO ] Time to serialize gal into /tmp/UpperBounds16955704438162836111.gal : 11 ms
[2023-03-09 05:03:29] [INFO ] Time to serialize properties into /tmp/UpperBounds492520530260785043.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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16955704438162836111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds492520530260785043.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds492520530260785043.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 9320476 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16095256 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-V50P50N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V50P50N10, 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 r037-tajo-167813690100253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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