About the Execution of ITS-Tools for PolyORBNT-PT-S05J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.932 | 3600000.00 | 2635034.00 | 620101.90 | 1 4 1 3 4 ? 1 2 1 1 1 10 1 1 10 3 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945800725.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-PT-S05J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945800725
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 15K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 62K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 274K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Feb 25 23:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 216K Feb 25 23:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 25 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Feb 25 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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 PolyORBNT-PT-S05J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678952544887
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=PolyORBNT-PT-S05J30
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-16 07:42:26] [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-16 07:42:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 07:42:26] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-16 07:42:26] [INFO ] Transformed 489 places.
[2023-03-16 07:42:26] [INFO ] Transformed 1400 transitions.
[2023-03-16 07:42:26] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 741 out of 745 initially.
// Phase 1: matrix 741 rows 489 cols
[2023-03-16 07:42:26] [INFO ] Computed 82 place invariants in 67 ms
FORMULA PolyORBNT-PT-S05J30-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 672 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 15) seen :37
FORMULA PolyORBNT-PT-S05J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :25
Incomplete Best-First random walk after 10000 steps, including 174 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :27
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 10001 steps, including 211 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10000 steps, including 147 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :36
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :30
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :17
Incomplete Best-First random walk after 10001 steps, including 150 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :36
[2023-03-16 07:42:27] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-16 07:42:27] [INFO ] Computed 82 place invariants in 38 ms
[2023-03-16 07:42:27] [INFO ] [Real]Absence check using 58 positive place invariants in 35 ms returned sat
[2023-03-16 07:42:27] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 16 ms returned unsat
[2023-03-16 07:42:27] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-16 07:42:27] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-16 07:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:27] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2023-03-16 07:42:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:42:28] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-16 07:42:28] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-16 07:42:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:28] [INFO ] [Nat]Absence check using state equation in 277 ms returned unsat
[2023-03-16 07:42:28] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-16 07:42:28] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 21 ms returned unsat
[2023-03-16 07:42:28] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-16 07:42:28] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned unsat
[2023-03-16 07:42:28] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-16 07:42:28] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-16 07:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:28] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2023-03-16 07:42:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:42:29] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-16 07:42:29] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-16 07:42:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:33] [INFO ] [Nat]Absence check using state equation in 4919 ms returned unknown
[2023-03-16 07:42:34] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-16 07:42:34] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-16 07:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:34] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2023-03-16 07:42:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:42:34] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-16 07:42:34] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-16 07:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:34] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2023-03-16 07:42:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:42:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 25 ms returned sat
[2023-03-16 07:42:35] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 72 ms.
[2023-03-16 07:42:35] [INFO ] Deduced a trap composed of 301 places in 214 ms of which 3 ms to minimize.
[2023-03-16 07:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2023-03-16 07:42:35] [INFO ] Added : 20 causal constraints over 4 iterations in 975 ms. Result :sat
Minimization took 304 ms.
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 17 ms returned unsat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned unsat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 14 ms returned unsat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 4 ms returned unsat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned unsat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 7 ms returned unsat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-16 07:42:36] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-16 07:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:37] [INFO ] [Real]Absence check using state equation in 154 ms returned unsat
[2023-03-16 07:42:37] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-16 07:42:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 1, 3, 10, 320, 1, 2, 1, 1, 1, 1, 10, 3] Max seen :[1, 4, 1, 3, 4, 3, 1, 2, 1, 1, 1, 1, 10, 3]
FORMULA PolyORBNT-PT-S05J30-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 77 place count 448 transition count 675
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 145 place count 414 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 413 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 413 transition count 674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 411 transition count 672
Applied a total of 151 rules in 155 ms. Remains 411 /489 variables (removed 78) and now considering 672/745 (removed 73) transitions.
[2023-03-16 07:42:37] [INFO ] Flow matrix only has 668 transitions (discarded 4 similar events)
// Phase 1: matrix 668 rows 411 cols
[2023-03-16 07:42:37] [INFO ] Computed 77 place invariants in 17 ms
[2023-03-16 07:42:37] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/489 places, 577/745 transitions.
Applied a total of 0 rules in 31 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 665 ms. Remains : 411/489 places, 577/745 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:42:37] [INFO ] Computed 77 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 47183 resets, run finished after 3955 ms. (steps per millisecond=252 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4147 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 5391 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 2) seen :7
[2023-03-16 07:42:43] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:42:43] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-16 07:42:43] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-16 07:42:43] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 12 ms returned sat
[2023-03-16 07:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:44] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-16 07:42:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:42:44] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-16 07:42:44] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-16 07:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:45] [INFO ] [Nat]Absence check using state equation in 1730 ms returned unsat
[2023-03-16 07:42:46] [INFO ] [Real]Absence check using 59 positive place invariants in 12 ms returned sat
[2023-03-16 07:42:46] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 13 ms returned sat
[2023-03-16 07:42:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:46] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-16 07:42:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:42:46] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-16 07:42:46] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-16 07:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:42:46] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2023-03-16 07:42:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:42:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-16 07:42:46] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 1 ms to minimize.
[2023-03-16 07:42:46] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 2 ms to minimize.
[2023-03-16 07:42:47] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 0 ms to minimize.
[2023-03-16 07:42:47] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:42:47] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 1 ms to minimize.
[2023-03-16 07:42:47] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 1 ms to minimize.
[2023-03-16 07:42:47] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 1 ms to minimize.
[2023-03-16 07:42:47] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 1 ms to minimize.
[2023-03-16 07:42:48] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2023-03-16 07:42:48] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 1 ms to minimize.
[2023-03-16 07:42:48] [INFO ] Deduced a trap composed of 142 places in 135 ms of which 0 ms to minimize.
[2023-03-16 07:42:48] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 0 ms to minimize.
[2023-03-16 07:42:48] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 1 ms to minimize.
[2023-03-16 07:42:49] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 1 ms to minimize.
[2023-03-16 07:42:49] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-16 07:42:49] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:42:49] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 1 ms to minimize.
[2023-03-16 07:42:49] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:42:50] [INFO ] Deduced a trap composed of 133 places in 122 ms of which 0 ms to minimize.
[2023-03-16 07:42:50] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 1 ms to minimize.
[2023-03-16 07:42:50] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 1 ms to minimize.
[2023-03-16 07:42:50] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 0 ms to minimize.
[2023-03-16 07:42:50] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 0 ms to minimize.
[2023-03-16 07:42:53] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 0 ms to minimize.
[2023-03-16 07:42:56] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 9926 ms
Current structural bounds on expressions (after SMT) : [4, 320] Max seen :[4, 3]
FORMULA PolyORBNT-PT-S05J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:42:56] [INFO ] Computed 77 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47188 resets, run finished after 3843 ms. (steps per millisecond=260 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5425 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 1) seen :3
[2023-03-16 07:43:01] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:43:01] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-16 07:43:01] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-16 07:43:01] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 12 ms returned sat
[2023-03-16 07:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:43:01] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-03-16 07:43:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:43:01] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-16 07:43:01] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-16 07:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:43:02] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-16 07:43:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-16 07:43:02] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:43:02] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:43:02] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2023-03-16 07:43:02] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:43:02] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 1 ms to minimize.
[2023-03-16 07:43:03] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:43:03] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:43:03] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 0 ms to minimize.
[2023-03-16 07:43:03] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-16 07:43:03] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 2 ms to minimize.
[2023-03-16 07:43:04] [INFO ] Deduced a trap composed of 142 places in 139 ms of which 1 ms to minimize.
[2023-03-16 07:43:04] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 1 ms to minimize.
[2023-03-16 07:43:04] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2023-03-16 07:43:04] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 1 ms to minimize.
[2023-03-16 07:43:04] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2023-03-16 07:43:05] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 0 ms to minimize.
[2023-03-16 07:43:05] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2023-03-16 07:43:05] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 1 ms to minimize.
[2023-03-16 07:43:05] [INFO ] Deduced a trap composed of 133 places in 134 ms of which 1 ms to minimize.
[2023-03-16 07:43:05] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 1 ms to minimize.
[2023-03-16 07:43:06] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 0 ms to minimize.
[2023-03-16 07:43:06] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 0 ms to minimize.
[2023-03-16 07:43:06] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 0 ms to minimize.
[2023-03-16 07:43:08] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2023-03-16 07:43:11] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 9797 ms
Current structural bounds on expressions (after SMT) : [320] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 07:43:12] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:12] [INFO ] Invariant cache hit.
[2023-03-16 07:43:12] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-16 07:43:12] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:12] [INFO ] Invariant cache hit.
[2023-03-16 07:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:16] [INFO ] Implicit Places using invariants and state equation in 3611 ms returned []
Implicit Place search using SMT with State Equation took 4142 ms to find 0 implicit places.
[2023-03-16 07:43:16] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-16 07:43:16] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:16] [INFO ] Invariant cache hit.
[2023-03-16 07:43:16] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4605 ms. Remains : 411/411 places, 577/577 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J30-UpperBounds-05
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:43:16] [INFO ] Computed 77 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 464 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :3
[2023-03-16 07:43:16] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:43:16] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-16 07:43:16] [INFO ] [Real]Absence check using 59 positive place invariants in 9 ms returned sat
[2023-03-16 07:43:16] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 13 ms returned sat
[2023-03-16 07:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:43:16] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-16 07:43:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:43:17] [INFO ] [Nat]Absence check using 59 positive place invariants in 12 ms returned sat
[2023-03-16 07:43:17] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-16 07:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:43:17] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2023-03-16 07:43:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-16 07:43:17] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 1 ms to minimize.
[2023-03-16 07:43:17] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 1 ms to minimize.
[2023-03-16 07:43:17] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 1 ms to minimize.
[2023-03-16 07:43:17] [INFO ] Deduced a trap composed of 137 places in 135 ms of which 1 ms to minimize.
[2023-03-16 07:43:18] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 0 ms to minimize.
[2023-03-16 07:43:18] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 1 ms to minimize.
[2023-03-16 07:43:18] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 0 ms to minimize.
[2023-03-16 07:43:18] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 1 ms to minimize.
[2023-03-16 07:43:18] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 1 ms to minimize.
[2023-03-16 07:43:19] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 0 ms to minimize.
[2023-03-16 07:43:19] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 1 ms to minimize.
[2023-03-16 07:43:19] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 0 ms to minimize.
[2023-03-16 07:43:19] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:43:19] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 1 ms to minimize.
[2023-03-16 07:43:20] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 1 ms to minimize.
[2023-03-16 07:43:20] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 0 ms to minimize.
[2023-03-16 07:43:20] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:43:20] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 4 ms to minimize.
[2023-03-16 07:43:20] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:43:21] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 1 ms to minimize.
[2023-03-16 07:43:21] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 1 ms to minimize.
[2023-03-16 07:43:21] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 0 ms to minimize.
[2023-03-16 07:43:21] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 0 ms to minimize.
[2023-03-16 07:43:21] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 4666 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 07:43:22] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:22] [INFO ] Invariant cache hit.
[2023-03-16 07:43:22] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:43:22] [INFO ] Computed 77 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47385 resets, run finished after 4028 ms. (steps per millisecond=248 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5441 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 1) seen :3
[2023-03-16 07:43:27] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 07:43:27] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-16 07:43:27] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-16 07:43:27] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 13 ms returned sat
[2023-03-16 07:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 07:43:27] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-16 07:43:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 07:43:27] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-16 07:43:27] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-16 07:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 07:43:28] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-16 07:43:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2023-03-16 07:43:28] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 1 ms to minimize.
[2023-03-16 07:43:28] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:43:28] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 1 ms to minimize.
[2023-03-16 07:43:28] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 0 ms to minimize.
[2023-03-16 07:43:28] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 1 ms to minimize.
[2023-03-16 07:43:29] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 1 ms to minimize.
[2023-03-16 07:43:29] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 0 ms to minimize.
[2023-03-16 07:43:29] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:43:29] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2023-03-16 07:43:29] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 0 ms to minimize.
[2023-03-16 07:43:30] [INFO ] Deduced a trap composed of 142 places in 127 ms of which 1 ms to minimize.
[2023-03-16 07:43:30] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 0 ms to minimize.
[2023-03-16 07:43:30] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 1 ms to minimize.
[2023-03-16 07:43:30] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 0 ms to minimize.
[2023-03-16 07:43:30] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:43:31] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 0 ms to minimize.
[2023-03-16 07:43:31] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 0 ms to minimize.
[2023-03-16 07:43:31] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 1 ms to minimize.
[2023-03-16 07:43:31] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 1 ms to minimize.
[2023-03-16 07:43:31] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 1 ms to minimize.
[2023-03-16 07:43:31] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 1 ms to minimize.
[2023-03-16 07:43:32] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 1 ms to minimize.
[2023-03-16 07:43:32] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 1 ms to minimize.
[2023-03-16 07:43:34] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 0 ms to minimize.
[2023-03-16 07:43:37] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 9742 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 07:43:38] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:38] [INFO ] Invariant cache hit.
[2023-03-16 07:43:38] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-16 07:43:38] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:38] [INFO ] Invariant cache hit.
[2023-03-16 07:43:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 07:43:42] [INFO ] Implicit Places using invariants and state equation in 3646 ms returned []
Implicit Place search using SMT with State Equation took 4135 ms to find 0 implicit places.
[2023-03-16 07:43:42] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 07:43:42] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 07:43:42] [INFO ] Invariant cache hit.
[2023-03-16 07:43:42] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4616 ms. Remains : 411/411 places, 577/577 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J30-UpperBounds-05 in 26005 ms.
[2023-03-16 07:43:43] [INFO ] Flatten gal took : 167 ms
[2023-03-16 07:43:43] [INFO ] Applying decomposition
[2023-03-16 07:43:43] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17469689639941896855.txt' '-o' '/tmp/graph17469689639941896855.bin' '-w' '/tmp/graph17469689639941896855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17469689639941896855.bin' '-l' '-1' '-v' '-w' '/tmp/graph17469689639941896855.weights' '-q' '0' '-e' '0.001'
[2023-03-16 07:43:43] [INFO ] Decomposing Gal with order
[2023-03-16 07:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 07:43:43] [INFO ] Removed a total of 697 redundant transitions.
[2023-03-16 07:43:43] [INFO ] Flatten gal took : 199 ms
[2023-03-16 07:43:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 29 ms.
[2023-03-16 07:43:43] [INFO ] Time to serialize gal into /tmp/UpperBounds4748181637142913622.gal : 15 ms
[2023-03-16 07:43:43] [INFO ] Time to serialize properties into /tmp/UpperBounds17406009357846681123.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/UpperBounds4748181637142913622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17406009357846681123.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/UpperBounds17406009357846681123.prop.
Detected timeout of ITS tools.
[2023-03-16 08:04:39] [INFO ] Flatten gal took : 350 ms
[2023-03-16 08:04:39] [INFO ] Time to serialize gal into /tmp/UpperBounds5099743807225848133.gal : 63 ms
[2023-03-16 08:04:39] [INFO ] Time to serialize properties into /tmp/UpperBounds14454678258448604867.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/UpperBounds5099743807225848133.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14454678258448604867.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 ...305
Loading property file /tmp/UpperBounds14454678258448604867.prop.
Detected timeout of ITS tools.
[2023-03-16 08:25:12] [INFO ] Flatten gal took : 524 ms
[2023-03-16 08:25:14] [INFO ] Input system was already deterministic with 577 transitions.
[2023-03-16 08:25:14] [INFO ] Transformed 411 places.
[2023-03-16 08:25:14] [INFO ] Transformed 577 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
[2023-03-16 08:25:44] [INFO ] Time to serialize gal into /tmp/UpperBounds6432156819826565489.gal : 10 ms
[2023-03-16 08:25:44] [INFO ] Time to serialize properties into /tmp/UpperBounds14153747561127930119.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/UpperBounds6432156819826565489.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14153747561127930119.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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14153747561127930119.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 149652 kB
After kill :
MemTotal: 16393232 kB
MemFree: 14396896 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="PolyORBNT-PT-S05J30"
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 PolyORBNT-PT-S05J30, 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 r293-tall-167873945800725"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J30.tgz
mv PolyORBNT-PT-S05J30 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 '
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 ;