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.r307-tajo-171654460700206.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 PolyORBLF-PT-S06J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460700206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 18K Apr 11 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 443K Apr 11 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 11 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 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 PolyORBLF-PT-S06J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717122669052

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=PolyORBLF-PT-S06J04T08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 02:31:11] [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-31 02:31:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 02:31:12] [INFO ] Load time of PNML (sax parser for PT used): 786 ms
[2024-05-31 02:31:12] [INFO ] Transformed 810 places.
[2024-05-31 02:31:12] [INFO ] Transformed 14014 transitions.
[2024-05-31 02:31:12] [INFO ] Parsed PT model containing 810 places and 14014 transitions and 118428 arcs in 1023 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Normalized transition count is 3206 out of 3254 initially.
// Phase 1: matrix 3206 rows 810 cols
[2024-05-31 02:31:12] [INFO ] Computed 58 invariants in 428 ms
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 65 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 14) seen :21
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :21
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :18
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :16
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :16
[2024-05-31 02:31:13] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2024-05-31 02:31:13] [INFO ] Computed 58 invariants in 113 ms
[2024-05-31 02:31:14] [INFO ] [Real]Absence check using 17 positive place invariants in 55 ms returned sat
[2024-05-31 02:31:14] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 75 ms returned unsat
[2024-05-31 02:31:14] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2024-05-31 02:31:14] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 31 ms returned unsat
[2024-05-31 02:31:14] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-31 02:31:14] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 35 ms returned unsat
[2024-05-31 02:31:14] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 54 ms returned unsat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 24 ms returned unsat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 70 ms returned unsat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 66 ms returned unsat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive place invariants in 35 ms returned sat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 97 ms returned unsat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-31 02:31:15] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 67 ms returned unsat
[2024-05-31 02:31:16] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2024-05-31 02:31:16] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 50 ms returned unsat
[2024-05-31 02:31:16] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-31 02:31:16] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 41 ms returned unsat
[2024-05-31 02:31:16] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-31 02:31:16] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 45 ms returned sat
[2024-05-31 02:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:31:19] [INFO ] [Real]Absence check using state equation in 3219 ms returned sat
[2024-05-31 02:31:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:31:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-31 02:31:20] [INFO ] [Nat]Absence check using 17 positive and 41 generalized place invariants in 54 ms returned sat
[2024-05-31 02:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:31:24] [INFO ] [Nat]Absence check using state equation in 4759 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 8, 1, 4, 1, 1, 1, -1] Max seen :[1, 1, 1, 1, 1, 8, 1, 4, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 810/810 places, 3254/3254 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 804 transition count 3183
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 148 place count 733 transition count 3183
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 148 place count 733 transition count 3087
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 340 place count 637 transition count 3087
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 530 place count 542 transition count 2992
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 546 place count 542 transition count 2976
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 562 place count 526 transition count 2976
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 563 place count 526 transition count 2976
Applied a total of 563 rules in 779 ms. Remains 526 /810 variables (removed 284) and now considering 2976/3254 (removed 278) transitions.
[2024-05-31 02:31:25] [INFO ] Flow matrix only has 2928 transitions (discarded 48 similar events)
// Phase 1: matrix 2928 rows 526 cols
[2024-05-31 02:31:25] [INFO ] Computed 52 invariants in 89 ms
[2024-05-31 02:31:27] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 1224 transitions.
Found 1224 dead transitions using SMT.
Drop transitions removed 1224 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 526/810 places, 1752/3254 transitions.
Applied a total of 0 rules in 36 ms. Remains 526 /526 variables (removed 0) and now considering 1752/1752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2278 ms. Remains : 526/810 places, 1752/3254 transitions.
Normalized transition count is 1704 out of 1752 initially.
// Phase 1: matrix 1704 rows 526 cols
[2024-05-31 02:31:27] [INFO ] Computed 52 invariants in 27 ms
Incomplete random walk after 1000000 steps, including 11244 resets, run finished after 8068 ms. (steps per millisecond=123 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3133 resets, run finished after 2439 ms. (steps per millisecond=410 ) properties (out of 1) seen :1
[2024-05-31 02:31:37] [INFO ] Flow matrix only has 1704 transitions (discarded 48 similar events)
// Phase 1: matrix 1704 rows 526 cols
[2024-05-31 02:31:37] [INFO ] Computed 52 invariants in 26 ms
[2024-05-31 02:31:37] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-31 02:31:37] [INFO ] [Real]Absence check using 15 positive and 37 generalized place invariants in 23 ms returned sat
[2024-05-31 02:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:32:22] [INFO ] [Real]Absence check using state equation in 44946 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1752/1752 transitions.
Applied a total of 0 rules in 34 ms. Remains 526 /526 variables (removed 0) and now considering 1752/1752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 526/526 places, 1752/1752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1752/1752 transitions.
Applied a total of 0 rules in 100 ms. Remains 526 /526 variables (removed 0) and now considering 1752/1752 (removed 0) transitions.
[2024-05-31 02:32:22] [INFO ] Flow matrix only has 1704 transitions (discarded 48 similar events)
[2024-05-31 02:32:22] [INFO ] Invariant cache hit.
[2024-05-31 02:32:23] [INFO ] Implicit Places using invariants in 893 ms returned [33, 49, 148, 189, 221, 327, 334, 517]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 899 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 518/526 places, 1752/1752 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 514 transition count 1748
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 514 transition count 1748
Applied a total of 8 rules in 73 ms. Remains 514 /518 variables (removed 4) and now considering 1748/1752 (removed 4) transitions.
[2024-05-31 02:32:23] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
// Phase 1: matrix 1700 rows 514 cols
[2024-05-31 02:32:23] [INFO ] Computed 44 invariants in 27 ms
[2024-05-31 02:32:24] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-05-31 02:32:24] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
[2024-05-31 02:32:24] [INFO ] Invariant cache hit.
[2024-05-31 02:32:25] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 02:32:55] [INFO ] Performed 388/514 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 02:33:04] [INFO ] Implicit Places using invariants and state equation in 40044 ms returned []
Implicit Place search using SMT with State Equation took 40946 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 514/526 places, 1748/1752 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 42019 ms. Remains : 514/526 places, 1748/1752 transitions.
Normalized transition count is 1700 out of 1748 initially.
// Phase 1: matrix 1700 rows 514 cols
[2024-05-31 02:33:04] [INFO ] Computed 44 invariants in 47 ms
Incomplete random walk after 1000000 steps, including 11523 resets, run finished after 8137 ms. (steps per millisecond=122 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3144 resets, run finished after 2767 ms. (steps per millisecond=361 ) properties (out of 1) seen :1
[2024-05-31 02:33:15] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
// Phase 1: matrix 1700 rows 514 cols
[2024-05-31 02:33:15] [INFO ] Computed 44 invariants in 42 ms
[2024-05-31 02:33:15] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-31 02:33:15] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 20 ms returned sat
[2024-05-31 02:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:33:19] [INFO ] [Real]Absence check using state equation in 3152 ms returned sat
[2024-05-31 02:33:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:33:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-31 02:33:19] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 46 ms returned sat
[2024-05-31 02:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:33:25] [INFO ] [Nat]Absence check using state equation in 5688 ms returned sat
[2024-05-31 02:33:25] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 02:33:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 02:33:28] [INFO ] [Nat]Added 224 Read/Feed constraints in 3355 ms returned sat
[2024-05-31 02:33:28] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 16 ms to minimize.
[2024-05-31 02:33:29] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2024-05-31 02:33:31] [INFO ] Deduced a trap composed of 262 places in 703 ms of which 2 ms to minimize.
[2024-05-31 02:33:31] [INFO ] Deduced a trap composed of 234 places in 470 ms of which 2 ms to minimize.
[2024-05-31 02:33:32] [INFO ] Deduced a trap composed of 252 places in 517 ms of which 1 ms to minimize.
[2024-05-31 02:33:32] [INFO ] Deduced a trap composed of 255 places in 502 ms of which 0 ms to minimize.
[2024-05-31 02:33:33] [INFO ] Deduced a trap composed of 243 places in 432 ms of which 0 ms to minimize.
[2024-05-31 02:33:33] [INFO ] Deduced a trap composed of 230 places in 326 ms of which 1 ms to minimize.
[2024-05-31 02:33:34] [INFO ] Deduced a trap composed of 273 places in 329 ms of which 1 ms to minimize.
[2024-05-31 02:33:34] [INFO ] Deduced a trap composed of 282 places in 322 ms of which 1 ms to minimize.
[2024-05-31 02:33:35] [INFO ] Deduced a trap composed of 249 places in 344 ms of which 0 ms to minimize.
[2024-05-31 02:33:35] [INFO ] Deduced a trap composed of 307 places in 368 ms of which 1 ms to minimize.
[2024-05-31 02:33:38] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 0 ms to minimize.
[2024-05-31 02:33:38] [INFO ] Deduced a trap composed of 192 places in 374 ms of which 1 ms to minimize.
[2024-05-31 02:33:38] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-31 02:33:39] [INFO ] Deduced a trap composed of 298 places in 367 ms of which 0 ms to minimize.
[2024-05-31 02:33:39] [INFO ] Deduced a trap composed of 270 places in 323 ms of which 0 ms to minimize.
[2024-05-31 02:33:42] [INFO ] Deduced a trap composed of 254 places in 425 ms of which 1 ms to minimize.
[2024-05-31 02:33:42] [INFO ] Deduced a trap composed of 254 places in 392 ms of which 0 ms to minimize.
[2024-05-31 02:33:43] [INFO ] Deduced a trap composed of 248 places in 404 ms of which 0 ms to minimize.
[2024-05-31 02:33:43] [INFO ] Deduced a trap composed of 248 places in 325 ms of which 0 ms to minimize.
[2024-05-31 02:33:44] [INFO ] Deduced a trap composed of 273 places in 316 ms of which 0 ms to minimize.
[2024-05-31 02:33:44] [INFO ] Deduced a trap composed of 251 places in 327 ms of which 0 ms to minimize.
[2024-05-31 02:33:45] [INFO ] Deduced a trap composed of 236 places in 383 ms of which 2 ms to minimize.
[2024-05-31 02:33:45] [INFO ] Deduced a trap composed of 253 places in 365 ms of which 1 ms to minimize.
[2024-05-31 02:33:46] [INFO ] Deduced a trap composed of 246 places in 371 ms of which 1 ms to minimize.
[2024-05-31 02:33:46] [INFO ] Deduced a trap composed of 241 places in 358 ms of which 0 ms to minimize.
[2024-05-31 02:33:47] [INFO ] Deduced a trap composed of 306 places in 416 ms of which 0 ms to minimize.
[2024-05-31 02:33:49] [INFO ] Deduced a trap composed of 251 places in 306 ms of which 1 ms to minimize.
[2024-05-31 02:33:49] [INFO ] Deduced a trap composed of 249 places in 310 ms of which 1 ms to minimize.
[2024-05-31 02:33:49] [INFO ] Deduced a trap composed of 269 places in 334 ms of which 0 ms to minimize.
[2024-05-31 02:33:51] [INFO ] Deduced a trap composed of 287 places in 396 ms of which 1 ms to minimize.
[2024-05-31 02:33:51] [INFO ] Deduced a trap composed of 257 places in 409 ms of which 1 ms to minimize.
[2024-05-31 02:33:51] [INFO ] Deduced a trap composed of 280 places in 397 ms of which 1 ms to minimize.
[2024-05-31 02:33:52] [INFO ] Deduced a trap composed of 248 places in 431 ms of which 12 ms to minimize.
[2024-05-31 02:33:53] [INFO ] Deduced a trap composed of 276 places in 328 ms of which 0 ms to minimize.
[2024-05-31 02:33:53] [INFO ] Deduced a trap composed of 273 places in 368 ms of which 1 ms to minimize.
[2024-05-31 02:33:54] [INFO ] Deduced a trap composed of 274 places in 326 ms of which 1 ms to minimize.
[2024-05-31 02:33:54] [INFO ] Deduced a trap composed of 264 places in 368 ms of which 0 ms to minimize.
[2024-05-31 02:33:57] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 29221 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 1748/1748 transitions.
Applied a total of 0 rules in 40 ms. Remains 514 /514 variables (removed 0) and now considering 1748/1748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 514/514 places, 1748/1748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 1748/1748 transitions.
Applied a total of 0 rules in 80 ms. Remains 514 /514 variables (removed 0) and now considering 1748/1748 (removed 0) transitions.
[2024-05-31 02:33:58] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
[2024-05-31 02:33:58] [INFO ] Invariant cache hit.
[2024-05-31 02:33:59] [INFO ] Implicit Places using invariants in 832 ms returned []
[2024-05-31 02:33:59] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
[2024-05-31 02:33:59] [INFO ] Invariant cache hit.
[2024-05-31 02:33:59] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 02:34:23] [INFO ] Implicit Places using invariants and state equation in 24674 ms returned []
Implicit Place search using SMT with State Equation took 25523 ms to find 0 implicit places.
[2024-05-31 02:34:23] [INFO ] Redundant transitions in 127 ms returned []
[2024-05-31 02:34:23] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
[2024-05-31 02:34:23] [INFO ] Invariant cache hit.
[2024-05-31 02:34:24] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26739 ms. Remains : 514/514 places, 1748/1748 transitions.
Starting property specific reduction for PolyORBLF-PT-S06J04T08-UpperBounds-14
Normalized transition count is 1700 out of 1748 initially.
// Phase 1: matrix 1700 rows 514 cols
[2024-05-31 02:34:24] [INFO ] Computed 44 invariants in 27 ms
Incomplete random walk after 10000 steps, including 134 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :1
[2024-05-31 02:34:24] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
// Phase 1: matrix 1700 rows 514 cols
[2024-05-31 02:34:25] [INFO ] Computed 44 invariants in 25 ms
[2024-05-31 02:34:25] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-31 02:34:25] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 16 ms returned sat
[2024-05-31 02:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:34:28] [INFO ] [Real]Absence check using state equation in 3178 ms returned sat
[2024-05-31 02:34:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:34:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-31 02:34:28] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 18 ms returned sat
[2024-05-31 02:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:34:33] [INFO ] [Nat]Absence check using state equation in 4918 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 1748/1748 transitions.
Applied a total of 0 rules in 58 ms. Remains 514 /514 variables (removed 0) and now considering 1748/1748 (removed 0) transitions.
[2024-05-31 02:34:33] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
[2024-05-31 02:34:33] [INFO ] Invariant cache hit.
[2024-05-31 02:34:34] [INFO ] Dead Transitions using invariants and state equation in 1053 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1136 ms. Remains : 514/514 places, 1748/1748 transitions.
Normalized transition count is 1700 out of 1748 initially.
// Phase 1: matrix 1700 rows 514 cols
[2024-05-31 02:34:34] [INFO ] Computed 44 invariants in 27 ms
Incomplete random walk after 1000000 steps, including 11361 resets, run finished after 7955 ms. (steps per millisecond=125 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3177 resets, run finished after 2451 ms. (steps per millisecond=407 ) properties (out of 1) seen :1
[2024-05-31 02:34:44] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
// Phase 1: matrix 1700 rows 514 cols
[2024-05-31 02:34:44] [INFO ] Computed 44 invariants in 32 ms
[2024-05-31 02:34:45] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-31 02:34:45] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 23 ms returned sat
[2024-05-31 02:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 02:34:48] [INFO ] [Real]Absence check using state equation in 3256 ms returned sat
[2024-05-31 02:34:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 02:34:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-05-31 02:34:48] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-31 02:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 02:34:53] [INFO ] [Nat]Absence check using state equation in 5250 ms returned sat
[2024-05-31 02:34:53] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 02:34:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 02:34:57] [INFO ] [Nat]Added 224 Read/Feed constraints in 3725 ms returned sat
[2024-05-31 02:34:57] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-31 02:34:58] [INFO ] Deduced a trap composed of 238 places in 444 ms of which 1 ms to minimize.
[2024-05-31 02:34:59] [INFO ] Deduced a trap composed of 231 places in 436 ms of which 13 ms to minimize.
[2024-05-31 02:34:59] [INFO ] Deduced a trap composed of 250 places in 357 ms of which 0 ms to minimize.
[2024-05-31 02:35:00] [INFO ] Deduced a trap composed of 273 places in 325 ms of which 1 ms to minimize.
[2024-05-31 02:35:00] [INFO ] Deduced a trap composed of 301 places in 367 ms of which 1 ms to minimize.
[2024-05-31 02:35:00] [INFO ] Deduced a trap composed of 270 places in 334 ms of which 0 ms to minimize.
[2024-05-31 02:35:01] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 1 ms to minimize.
[2024-05-31 02:35:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4015 ms
[2024-05-31 02:35:01] [INFO ] Computed and/alt/rep : 745/3265/740 causal constraints (skipped 954 transitions) in 181 ms.
[2024-05-31 02:35:06] [INFO ] Deduced a trap composed of 274 places in 427 ms of which 1 ms to minimize.
[2024-05-31 02:35:07] [INFO ] Deduced a trap composed of 247 places in 468 ms of which 1 ms to minimize.
[2024-05-31 02:35:07] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2024-05-31 02:35:08] [INFO ] Deduced a trap composed of 267 places in 387 ms of which 1 ms to minimize.
[2024-05-31 02:35:08] [INFO ] Deduced a trap composed of 244 places in 328 ms of which 1 ms to minimize.
[2024-05-31 02:35:08] [INFO ] Deduced a trap composed of 303 places in 356 ms of which 0 ms to minimize.
[2024-05-31 02:35:09] [INFO ] Deduced a trap composed of 247 places in 333 ms of which 0 ms to minimize.
[2024-05-31 02:35:09] [INFO ] Deduced a trap composed of 271 places in 338 ms of which 1 ms to minimize.
[2024-05-31 02:35:10] [INFO ] Deduced a trap composed of 253 places in 369 ms of which 7 ms to minimize.
[2024-05-31 02:35:10] [INFO ] Deduced a trap composed of 262 places in 323 ms of which 0 ms to minimize.
[2024-05-31 02:35:11] [INFO ] Deduced a trap composed of 273 places in 333 ms of which 1 ms to minimize.
[2024-05-31 02:35:11] [INFO ] Deduced a trap composed of 262 places in 349 ms of which 1 ms to minimize.
[2024-05-31 02:35:11] [INFO ] Deduced a trap composed of 279 places in 354 ms of which 0 ms to minimize.
[2024-05-31 02:35:12] [INFO ] Deduced a trap composed of 224 places in 465 ms of which 1 ms to minimize.
[2024-05-31 02:35:13] [INFO ] Deduced a trap composed of 258 places in 439 ms of which 1 ms to minimize.
[2024-05-31 02:35:13] [INFO ] Deduced a trap composed of 258 places in 415 ms of which 1 ms to minimize.
[2024-05-31 02:35:14] [INFO ] Deduced a trap composed of 252 places in 414 ms of which 0 ms to minimize.
[2024-05-31 02:35:14] [INFO ] Deduced a trap composed of 248 places in 419 ms of which 1 ms to minimize.
[2024-05-31 02:35:17] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 11524 ms
[2024-05-31 02:35:17] [INFO ] Added : 97 causal constraints over 20 iterations in 16421 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 1748/1748 transitions.
Applied a total of 0 rules in 54 ms. Remains 514 /514 variables (removed 0) and now considering 1748/1748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 514/514 places, 1748/1748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 1748/1748 transitions.
Applied a total of 0 rules in 31 ms. Remains 514 /514 variables (removed 0) and now considering 1748/1748 (removed 0) transitions.
[2024-05-31 02:35:21] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
[2024-05-31 02:35:21] [INFO ] Invariant cache hit.
[2024-05-31 02:35:21] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-31 02:35:21] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
[2024-05-31 02:35:21] [INFO ] Invariant cache hit.
[2024-05-31 02:35:22] [INFO ] State equation strengthened by 224 read => feed constraints.
[2024-05-31 02:35:52] [INFO ] Performed 507/514 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 02:35:52] [INFO ] Implicit Places using invariants and state equation in 30794 ms returned []
Implicit Place search using SMT with State Equation took 31594 ms to find 0 implicit places.
[2024-05-31 02:35:52] [INFO ] Redundant transitions in 124 ms returned []
[2024-05-31 02:35:52] [INFO ] Flow matrix only has 1700 transitions (discarded 48 similar events)
[2024-05-31 02:35:52] [INFO ] Invariant cache hit.
[2024-05-31 02:35:53] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32784 ms. Remains : 514/514 places, 1748/1748 transitions.
Ending property specific reduction for PolyORBLF-PT-S06J04T08-UpperBounds-14 in 88931 ms.
[2024-05-31 02:35:54] [INFO ] Flatten gal took : 422 ms
[2024-05-31 02:35:54] [INFO ] Applying decomposition
[2024-05-31 02:35:54] [INFO ] Flatten gal took : 194 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/graph13808356921801904119.txt' '-o' '/tmp/graph13808356921801904119.bin' '-w' '/tmp/graph13808356921801904119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13808356921801904119.bin' '-l' '-1' '-v' '-w' '/tmp/graph13808356921801904119.weights' '-q' '0' '-e' '0.001'
[2024-05-31 02:35:55] [INFO ] Decomposing Gal with order
[2024-05-31 02:35:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 02:35:56] [INFO ] Removed a total of 1412 redundant transitions.
[2024-05-31 02:35:56] [INFO ] Flatten gal took : 579 ms
[2024-05-31 02:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 1097 labels/synchronizations in 67 ms.
[2024-05-31 02:35:56] [INFO ] Time to serialize gal into /tmp/UpperBounds8073965266192464426.gal : 30 ms
[2024-05-31 02:35:56] [INFO ] Time to serialize properties into /tmp/UpperBounds10684253136367825260.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8073965266192464426.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10684253136367825260.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 ...284
Loading property file /tmp/UpperBounds10684253136367825260.prop.
Detected timeout of ITS tools.
[2024-05-31 02:57:39] [INFO ] Flatten gal took : 2218 ms
[2024-05-31 02:57:39] [INFO ] Time to serialize gal into /tmp/UpperBounds7296018734567664104.gal : 117 ms
[2024-05-31 02:57:39] [INFO ] Time to serialize properties into /tmp/UpperBounds12550849483667028354.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/UpperBounds7296018734567664104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12550849483667028354.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 ...305
Loading property file /tmp/UpperBounds12550849483667028354.prop.
Detected timeout of ITS tools.
[2024-05-31 03:19:17] [INFO ] Flatten gal took : 972 ms
[2024-05-31 03:19:19] [INFO ] Input system was already deterministic with 1748 transitions.
[2024-05-31 03:19:19] [INFO ] Transformed 514 places.
[2024-05-31 03:19:19] [INFO ] Transformed 1748 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-31 03:19:49] [INFO ] Time to serialize gal into /tmp/UpperBounds8655712420666291103.gal : 62 ms
[2024-05-31 03:19:49] [INFO ] Time to serialize properties into /tmp/UpperBounds15642239147601163801.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8655712420666291103.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15642239147601163801.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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15642239147601163801.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 4898420 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16210352 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="PolyORBLF-PT-S06J04T08"
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 PolyORBLF-PT-S06J04T08, 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 r307-tajo-171654460700206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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