Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016900589.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-PT-S02J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016900589
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 21K Apr 29 13:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 29 13:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 29 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 29 13:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 862K May 10 09:34 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-S02J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652890052719

Running Version 202205111006
[2022-05-18 16:07:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 16:07:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 16:07:34] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2022-05-18 16:07:34] [INFO ] Transformed 476 places.
[2022-05-18 16:07:34] [INFO ] Transformed 920 transitions.
[2022-05-18 16:07:34] [INFO ] Parsed PT model containing 476 places and 920 transitions in 286 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Normalized transition count is 812 out of 824 initially.
// Phase 1: matrix 812 rows 476 cols
[2022-05-18 16:07:34] [INFO ] Computed 46 place invariants in 59 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :38
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :31
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :33
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :32
[2022-05-18 16:07:34] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2022-05-18 16:07:34] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-18 16:07:34] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-05-18 16:07:34] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 21 ms returned unsat
[2022-05-18 16:07:34] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 16:07:34] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 13 ms returned unsat
[2022-05-18 16:07:35] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-05-18 16:07:35] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned unsat
[2022-05-18 16:07:35] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 16:07:35] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 25 ms returned sat
[2022-05-18 16:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:07:36] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2022-05-18 16:07:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:07:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 16:07:36] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned sat
[2022-05-18 16:07:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:07:38] [INFO ] [Nat]Absence check using state equation in 1985 ms returned sat
[2022-05-18 16:07:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 16:07:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 1301 ms returned sat
[2022-05-18 16:07:39] [INFO ] Deduced a trap composed of 98 places in 187 ms of which 5 ms to minimize.
[2022-05-18 16:07:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 225 ms
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 23 ms returned unsat
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 18 ms returned sat
[2022-05-18 16:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:07:40] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2022-05-18 16:07:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:07:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 16:07:40] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned sat
[2022-05-18 16:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:07:42] [INFO ] [Nat]Absence check using state equation in 1541 ms returned sat
[2022-05-18 16:07:43] [INFO ] [Nat]Added 72 Read/Feed constraints in 1146 ms returned sat
[2022-05-18 16:07:43] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2022-05-18 16:07:44] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2022-05-18 16:07:45] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2224 ms
[2022-05-18 16:07:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 16:07:45] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2022-05-18 16:07:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 16:07:45] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 13 ms returned unsat
[2022-05-18 16:07:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 16:07:45] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 5, 1, 2, 10, -1, 10, 1, 1] Max seen :[1, 1, 1, 5, 1, 2, 10, 1, 10, 1, 1]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 770
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 420 transition count 770
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 110 place count 420 transition count 722
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 206 place count 372 transition count 722
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 302 place count 324 transition count 674
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 314 place count 324 transition count 662
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 326 place count 312 transition count 662
Applied a total of 326 rules in 145 ms. Remains 312 /476 variables (removed 164) and now considering 662/824 (removed 162) transitions.
[2022-05-18 16:07:46] [INFO ] Flow matrix only has 650 transitions (discarded 12 similar events)
// Phase 1: matrix 650 rows 312 cols
[2022-05-18 16:07:46] [INFO ] Computed 44 place invariants in 17 ms
[2022-05-18 16:07:46] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 66 transitions.
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 312/476 places, 596/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 310 transition count 584
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 298 transition count 572
Applied a total of 14 rules in 21 ms. Remains 298 /312 variables (removed 14) and now considering 572/596 (removed 24) transitions.
Finished structural reductions, in 2 iterations. Remains : 298/476 places, 572/824 transitions.
Normalized transition count is 560 out of 572 initially.
// Phase 1: matrix 560 rows 298 cols
[2022-05-18 16:07:46] [INFO ] Computed 44 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 587 resets, run finished after 3120 ms. (steps per millisecond=320 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 8 resets, run finished after 1499 ms. (steps per millisecond=667 ) properties (out of 1) seen :1
[2022-05-18 16:07:51] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
// Phase 1: matrix 560 rows 298 cols
[2022-05-18 16:07:51] [INFO ] Computed 44 place invariants in 21 ms
[2022-05-18 16:07:51] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-18 16:07:51] [INFO ] [Real]Absence check using 15 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-18 16:07:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:07:51] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-05-18 16:07:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:07:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-18 16:07:51] [INFO ] [Nat]Absence check using 15 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-18 16:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:07:52] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2022-05-18 16:07:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 16:07:52] [INFO ] [Nat]Added 72 Read/Feed constraints in 355 ms returned sat
[2022-05-18 16:07:52] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 0 ms to minimize.
[2022-05-18 16:07:52] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 0 ms to minimize.
[2022-05-18 16:07:53] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 1 ms to minimize.
[2022-05-18 16:07:53] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 1 ms to minimize.
[2022-05-18 16:07:53] [INFO ] Deduced a trap composed of 118 places in 114 ms of which 1 ms to minimize.
[2022-05-18 16:07:53] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 1 ms to minimize.
[2022-05-18 16:07:53] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 1 ms to minimize.
[2022-05-18 16:07:53] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 1 ms to minimize.
[2022-05-18 16:07:54] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 0 ms to minimize.
[2022-05-18 16:07:54] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 1 ms to minimize.
[2022-05-18 16:07:54] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 0 ms to minimize.
[2022-05-18 16:07:54] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2022-05-18 16:07:54] [INFO ] Deduced a trap composed of 124 places in 117 ms of which 0 ms to minimize.
[2022-05-18 16:07:55] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 0 ms to minimize.
[2022-05-18 16:07:55] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 0 ms to minimize.
[2022-05-18 16:07:55] [INFO ] Deduced a trap composed of 132 places in 116 ms of which 0 ms to minimize.
[2022-05-18 16:07:55] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 1 ms to minimize.
[2022-05-18 16:07:55] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 1 ms to minimize.
[2022-05-18 16:07:55] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 1 ms to minimize.
[2022-05-18 16:07:55] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3261 ms
[2022-05-18 16:07:55] [INFO ] Computed and/alt/rep : 336/1492/330 causal constraints (skipped 228 transitions) in 41 ms.
[2022-05-18 16:07:57] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 1 ms to minimize.
[2022-05-18 16:07:57] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 1 ms to minimize.
[2022-05-18 16:07:57] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2022-05-18 16:07:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 752 ms
[2022-05-18 16:07:57] [INFO ] Added : 86 causal constraints over 18 iterations in 2033 ms. Result :sat
Minimization took 415 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 1 out of 298 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 298/298 places, 572/572 transitions.
Applied a total of 0 rules in 15 ms. Remains 298 /298 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 298/298 places, 572/572 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 298/298 places, 572/572 transitions.
Applied a total of 0 rules in 14 ms. Remains 298 /298 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2022-05-18 16:07:58] [INFO ] Flow matrix only has 560 transitions (discarded 12 similar events)
// Phase 1: matrix 560 rows 298 cols
[2022-05-18 16:07:58] [INFO ] Computed 44 place invariants in 6 ms
[2022-05-18 16:07:58] [INFO ] Implicit Places using invariants in 277 ms returned [74, 148, 168, 170, 263, 272]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 284 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 292/298 places, 572/572 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 289 transition count 569
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 289 transition count 569
Applied a total of 6 rules in 24 ms. Remains 289 /292 variables (removed 3) and now considering 569/572 (removed 3) transitions.
[2022-05-18 16:07:58] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:07:58] [INFO ] Computed 38 place invariants in 16 ms
[2022-05-18 16:07:59] [INFO ] Implicit Places using invariants in 277 ms returned []
[2022-05-18 16:07:59] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:07:59] [INFO ] Computed 38 place invariants in 6 ms
[2022-05-18 16:07:59] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 16:08:03] [INFO ] Implicit Places using invariants and state equation in 4031 ms returned []
Implicit Place search using SMT with State Equation took 4328 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 289/298 places, 569/572 transitions.
Finished structural reductions, in 2 iterations. Remains : 289/298 places, 569/572 transitions.
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:03] [INFO ] Computed 38 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 603 resets, run finished after 2899 ms. (steps per millisecond=344 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 1402 ms. (steps per millisecond=713 ) properties (out of 1) seen :1
[2022-05-18 16:08:07] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:07] [INFO ] Computed 38 place invariants in 14 ms
[2022-05-18 16:08:07] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 16:08:07] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-18 16:08:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:08:07] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-05-18 16:08:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:08:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 16:08:08] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 10 ms returned sat
[2022-05-18 16:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:08:08] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2022-05-18 16:08:08] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 16:08:09] [INFO ] [Nat]Added 72 Read/Feed constraints in 340 ms returned sat
[2022-05-18 16:08:09] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2022-05-18 16:08:09] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2022-05-18 16:08:09] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 1 ms to minimize.
[2022-05-18 16:08:09] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 0 ms to minimize.
[2022-05-18 16:08:09] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2022-05-18 16:08:09] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 0 ms to minimize.
[2022-05-18 16:08:10] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 1 ms to minimize.
[2022-05-18 16:08:10] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 1 ms to minimize.
[2022-05-18 16:08:10] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2022-05-18 16:08:10] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 1 ms to minimize.
[2022-05-18 16:08:10] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 1 ms to minimize.
[2022-05-18 16:08:10] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 1 ms to minimize.
[2022-05-18 16:08:10] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 0 ms to minimize.
[2022-05-18 16:08:11] [INFO ] Deduced a trap composed of 136 places in 110 ms of which 0 ms to minimize.
[2022-05-18 16:08:11] [INFO ] Deduced a trap composed of 169 places in 125 ms of which 1 ms to minimize.
[2022-05-18 16:08:11] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 1 ms to minimize.
[2022-05-18 16:08:11] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 0 ms to minimize.
[2022-05-18 16:08:11] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 1 ms to minimize.
[2022-05-18 16:08:11] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 1 ms to minimize.
[2022-05-18 16:08:12] [INFO ] Deduced a trap composed of 148 places in 118 ms of which 0 ms to minimize.
[2022-05-18 16:08:12] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 0 ms to minimize.
[2022-05-18 16:08:12] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 0 ms to minimize.
[2022-05-18 16:08:12] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 0 ms to minimize.
[2022-05-18 16:08:12] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 0 ms to minimize.
[2022-05-18 16:08:12] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
[2022-05-18 16:08:13] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
[2022-05-18 16:08:13] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4050 ms
[2022-05-18 16:08:13] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 40 ms.
[2022-05-18 16:08:14] [INFO ] Added : 99 causal constraints over 21 iterations in 1490 ms. Result :sat
Minimization took 541 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 13 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 12 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2022-05-18 16:08:15] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:15] [INFO ] Computed 38 place invariants in 5 ms
[2022-05-18 16:08:15] [INFO ] Implicit Places using invariants in 244 ms returned []
[2022-05-18 16:08:15] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:15] [INFO ] Computed 38 place invariants in 11 ms
[2022-05-18 16:08:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 16:08:20] [INFO ] Implicit Places using invariants and state equation in 4251 ms returned []
Implicit Place search using SMT with State Equation took 4500 ms to find 0 implicit places.
[2022-05-18 16:08:20] [INFO ] Redundant transitions in 40 ms returned []
[2022-05-18 16:08:20] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:20] [INFO ] Computed 38 place invariants in 11 ms
[2022-05-18 16:08:20] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Starting property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-08
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:20] [INFO ] Computed 38 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
[2022-05-18 16:08:20] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:20] [INFO ] Computed 38 place invariants in 11 ms
[2022-05-18 16:08:20] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 16:08:20] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 10 ms returned sat
[2022-05-18 16:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:08:20] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-18 16:08:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:08:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 16:08:20] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-18 16:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:08:21] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2022-05-18 16:08:21] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 16:08:21] [INFO ] [Nat]Added 72 Read/Feed constraints in 354 ms returned sat
[2022-05-18 16:08:22] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 0 ms to minimize.
[2022-05-18 16:08:22] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2022-05-18 16:08:22] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 0 ms to minimize.
[2022-05-18 16:08:22] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 0 ms to minimize.
[2022-05-18 16:08:22] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2022-05-18 16:08:22] [INFO ] Deduced a trap composed of 112 places in 113 ms of which 3 ms to minimize.
[2022-05-18 16:08:22] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 0 ms to minimize.
[2022-05-18 16:08:23] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 1 ms to minimize.
[2022-05-18 16:08:23] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 0 ms to minimize.
[2022-05-18 16:08:23] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 0 ms to minimize.
[2022-05-18 16:08:23] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 1 ms to minimize.
[2022-05-18 16:08:23] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2022-05-18 16:08:23] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 0 ms to minimize.
[2022-05-18 16:08:24] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 0 ms to minimize.
[2022-05-18 16:08:24] [INFO ] Deduced a trap composed of 169 places in 119 ms of which 2 ms to minimize.
[2022-05-18 16:08:24] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2022-05-18 16:08:24] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 0 ms to minimize.
[2022-05-18 16:08:24] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 3 ms to minimize.
[2022-05-18 16:08:24] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 1 ms to minimize.
[2022-05-18 16:08:24] [INFO ] Deduced a trap composed of 148 places in 106 ms of which 1 ms to minimize.
[2022-05-18 16:08:25] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 0 ms to minimize.
[2022-05-18 16:08:25] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 0 ms to minimize.
[2022-05-18 16:08:25] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 0 ms to minimize.
[2022-05-18 16:08:25] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 0 ms to minimize.
[2022-05-18 16:08:25] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
[2022-05-18 16:08:25] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 0 ms to minimize.
[2022-05-18 16:08:25] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 3929 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 28 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2022-05-18 16:08:25] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:25] [INFO ] Computed 38 place invariants in 13 ms
[2022-05-18 16:08:26] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Normalized transition count is 557 out of 569 initially.
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:26] [INFO ] Computed 38 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 648 resets, run finished after 2826 ms. (steps per millisecond=353 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 17 resets, run finished after 1344 ms. (steps per millisecond=744 ) properties (out of 1) seen :1
[2022-05-18 16:08:30] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:30] [INFO ] Computed 38 place invariants in 16 ms
[2022-05-18 16:08:30] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-18 16:08:30] [INFO ] [Real]Absence check using 16 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-18 16:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 16:08:30] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-05-18 16:08:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 16:08:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2022-05-18 16:08:30] [INFO ] [Nat]Absence check using 16 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-18 16:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 16:08:31] [INFO ] [Nat]Absence check using state equation in 678 ms returned sat
[2022-05-18 16:08:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 16:08:31] [INFO ] [Nat]Added 72 Read/Feed constraints in 337 ms returned sat
[2022-05-18 16:08:32] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2022-05-18 16:08:32] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2022-05-18 16:08:32] [INFO ] Deduced a trap composed of 114 places in 106 ms of which 0 ms to minimize.
[2022-05-18 16:08:32] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 0 ms to minimize.
[2022-05-18 16:08:32] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-05-18 16:08:32] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 1 ms to minimize.
[2022-05-18 16:08:32] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 0 ms to minimize.
[2022-05-18 16:08:33] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 0 ms to minimize.
[2022-05-18 16:08:33] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 0 ms to minimize.
[2022-05-18 16:08:33] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 1 ms to minimize.
[2022-05-18 16:08:33] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 0 ms to minimize.
[2022-05-18 16:08:33] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 0 ms to minimize.
[2022-05-18 16:08:33] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 0 ms to minimize.
[2022-05-18 16:08:34] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 0 ms to minimize.
[2022-05-18 16:08:34] [INFO ] Deduced a trap composed of 169 places in 115 ms of which 1 ms to minimize.
[2022-05-18 16:08:34] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 0 ms to minimize.
[2022-05-18 16:08:34] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 1 ms to minimize.
[2022-05-18 16:08:34] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2022-05-18 16:08:34] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 1 ms to minimize.
[2022-05-18 16:08:34] [INFO ] Deduced a trap composed of 148 places in 117 ms of which 0 ms to minimize.
[2022-05-18 16:08:35] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 0 ms to minimize.
[2022-05-18 16:08:35] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 1 ms to minimize.
[2022-05-18 16:08:35] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2022-05-18 16:08:35] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 0 ms to minimize.
[2022-05-18 16:08:35] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 0 ms to minimize.
[2022-05-18 16:08:35] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2022-05-18 16:08:36] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4035 ms
[2022-05-18 16:08:36] [INFO ] Computed and/alt/rep : 333/1488/327 causal constraints (skipped 228 transitions) in 46 ms.
[2022-05-18 16:08:37] [INFO ] Added : 99 causal constraints over 21 iterations in 1460 ms. Result :sat
Minimization took 537 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 11 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 289/289 places, 569/569 transitions.
Applied a total of 0 rules in 10 ms. Remains 289 /289 variables (removed 0) and now considering 569/569 (removed 0) transitions.
[2022-05-18 16:08:38] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:38] [INFO ] Computed 38 place invariants in 7 ms
[2022-05-18 16:08:38] [INFO ] Implicit Places using invariants in 283 ms returned []
[2022-05-18 16:08:38] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:38] [INFO ] Computed 38 place invariants in 9 ms
[2022-05-18 16:08:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 16:08:42] [INFO ] Implicit Places using invariants and state equation in 3647 ms returned []
Implicit Place search using SMT with State Equation took 3934 ms to find 0 implicit places.
[2022-05-18 16:08:42] [INFO ] Redundant transitions in 21 ms returned []
[2022-05-18 16:08:42] [INFO ] Flow matrix only has 557 transitions (discarded 12 similar events)
// Phase 1: matrix 557 rows 289 cols
[2022-05-18 16:08:42] [INFO ] Computed 38 place invariants in 12 ms
[2022-05-18 16:08:42] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 289/289 places, 569/569 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J04T06-UpperBounds-08 in 22238 ms.
[2022-05-18 16:08:43] [INFO ] Flatten gal took : 118 ms
[2022-05-18 16:08:43] [INFO ] Applying decomposition
[2022-05-18 16:08:43] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2565376604999629641.txt' '-o' '/tmp/graph2565376604999629641.bin' '-w' '/tmp/graph2565376604999629641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2565376604999629641.bin' '-l' '-1' '-v' '-w' '/tmp/graph2565376604999629641.weights' '-q' '0' '-e' '0.001'
[2022-05-18 16:08:43] [INFO ] Decomposing Gal with order
[2022-05-18 16:08:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 16:08:43] [INFO ] Removed a total of 448 redundant transitions.
[2022-05-18 16:08:43] [INFO ] Flatten gal took : 168 ms
[2022-05-18 16:08:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 18 ms.
[2022-05-18 16:08:43] [INFO ] Time to serialize gal into /tmp/UpperBounds14076701313439013965.gal : 12 ms
[2022-05-18 16:08:43] [INFO ] Time to serialize properties into /tmp/UpperBounds11028297639878293127.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14076701313439013965.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11028297639878293127.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds11028297639878293127.prop.
Detected timeout of ITS tools.
[2022-05-18 16:29:07] [INFO ] Flatten gal took : 45 ms
[2022-05-18 16:29:07] [INFO ] Time to serialize gal into /tmp/UpperBounds8010219588052657143.gal : 10 ms
[2022-05-18 16:29:07] [INFO ] Time to serialize properties into /tmp/UpperBounds7126632964789952859.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8010219588052657143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7126632964789952859.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds7126632964789952859.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.42283e+06,57.4152,1182168,2,73571,5,1.98817e+06,6,0,1737,2.60002e+06,0
Total reachable state count : 7422828

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PolyORBLF-PT-S02J04T06-UpperBounds-08 :0 <= AwakeTasks_3 <= 1
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-PT-S02J04T06-UpperBounds-08,0,57.4243,1182168,1,0,7,1.98817e+06,9,1,2049,2.60002e+06,4
Total runtime 1350894 ms.

BK_STOP 1652891404785

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-S02J04T06"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J04T06, 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 r168-tall-165277016900589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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