About the Execution of ITS-Tools for CO4-PT-08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
355.199 | 10139.00 | 18030.00 | 103.00 | 0 1 1 0 1 1 1 0 0 1 0 1 0 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898500061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CO4-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898500061
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 138K Jun 2 16:33 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 CO4-PT-08-UpperBounds-00
FORMULA_NAME CO4-PT-08-UpperBounds-01
FORMULA_NAME CO4-PT-08-UpperBounds-02
FORMULA_NAME CO4-PT-08-UpperBounds-03
FORMULA_NAME CO4-PT-08-UpperBounds-04
FORMULA_NAME CO4-PT-08-UpperBounds-05
FORMULA_NAME CO4-PT-08-UpperBounds-06
FORMULA_NAME CO4-PT-08-UpperBounds-07
FORMULA_NAME CO4-PT-08-UpperBounds-08
FORMULA_NAME CO4-PT-08-UpperBounds-09
FORMULA_NAME CO4-PT-08-UpperBounds-10
FORMULA_NAME CO4-PT-08-UpperBounds-11
FORMULA_NAME CO4-PT-08-UpperBounds-12
FORMULA_NAME CO4-PT-08-UpperBounds-13
FORMULA_NAME CO4-PT-08-UpperBounds-14
FORMULA_NAME CO4-PT-08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717351576188
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 18:06:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:06:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:17] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-02 18:06:17] [INFO ] Transformed 467 places.
[2024-06-02 18:06:17] [INFO ] Transformed 600 transitions.
[2024-06-02 18:06:17] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:17] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 445 rows 359 cols
[2024-06-02 18:06:17] [INFO ] Computed 9 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (5 resets) in 23 ms. (416 steps per ms)
FORMULA CO4-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80003 steps (475 resets) in 75 ms. (1052 steps per ms)
FORMULA CO4-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:06:17] [INFO ] Invariant cache hit.
[2024-06-02 18:06:17] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-02 18:06:17] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 7 ms returned sat
[2024-06-02 18:06:18] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-06-02 18:06:18] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 34 ms.
[2024-06-02 18:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2024-06-02 18:06:18] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:06:18] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-02 18:06:18] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 25 ms.
[2024-06-02 18:06:18] [INFO ] Added : 43 causal constraints over 9 iterations in 276 ms. Result :sat
Minimization took 243 ms.
[2024-06-02 18:06:19] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 18:06:19] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:06:19] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-06-02 18:06:19] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 27 ms.
[2024-06-02 18:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:19] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:06:19] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-02 18:06:19] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 25 ms.
[2024-06-02 18:06:19] [INFO ] Added : 60 causal constraints over 12 iterations in 354 ms. Result :sat
Minimization took 151 ms.
[2024-06-02 18:06:20] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 18:06:20] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:06:20] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-02 18:06:20] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 25 ms.
[2024-06-02 18:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:20] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:06:20] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 18:06:20] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 25 ms.
[2024-06-02 18:06:20] [INFO ] Added : 73 causal constraints over 15 iterations in 404 ms. Result :sat
Minimization took 146 ms.
[2024-06-02 18:06:21] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:21] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:06:21] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-02 18:06:21] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 25 ms.
[2024-06-02 18:06:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 18:06:21] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:06:21] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 18:06:21] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2024-06-02 18:06:21] [INFO ] Added : 65 causal constraints over 13 iterations in 341 ms. Result :sat
Minimization took 153 ms.
[2024-06-02 18:06:22] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:22] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:06:22] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-02 18:06:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:22] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:06:22] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 18:06:22] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2024-06-02 18:06:22] [INFO ] Added : 45 causal constraints over 9 iterations in 260 ms. Result :sat
Minimization took 149 ms.
[2024-06-02 18:06:22] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 18:06:22] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:06:22] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-02 18:06:23] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 30 ms.
[2024-06-02 18:06:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:06:23] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:06:23] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-02 18:06:23] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2024-06-02 18:06:23] [INFO ] Added : 89 causal constraints over 20 iterations in 478 ms. Result :sat
Minimization took 159 ms.
[2024-06-02 18:06:23] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 18:06:23] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:06:24] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-02 18:06:24] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2024-06-02 18:06:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:06:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 18:06:24] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 18:06:24] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-02 18:06:24] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 22 ms.
[2024-06-02 18:06:24] [INFO ] Added : 70 causal constraints over 14 iterations in 372 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 445/445 transitions.
Graph (trivial) has 354 edges and 359 vertex of which 2 / 359 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 653 edges and 358 vertex of which 326 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 326 transition count 248
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 178 rules applied. Total rules applied 364 place count 166 transition count 230
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 382 place count 158 transition count 220
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 388 place count 156 transition count 216
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 394 place count 154 transition count 212
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 7 rules applied. Total rules applied 401 place count 152 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 404 place count 149 transition count 207
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 431 place count 122 transition count 180
Iterating global reduction 7 with 27 rules applied. Total rules applied 458 place count 122 transition count 180
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 458 place count 122 transition count 173
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 472 place count 115 transition count 173
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 487 place count 100 transition count 140
Iterating global reduction 7 with 15 rules applied. Total rules applied 502 place count 100 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 504 place count 100 transition count 138
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 506 place count 98 transition count 136
Iterating global reduction 8 with 2 rules applied. Total rules applied 508 place count 98 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 510 place count 98 transition count 134
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 9 with 68 rules applied. Total rules applied 578 place count 64 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 584 place count 64 transition count 93
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 587 place count 61 transition count 90
Iterating global reduction 10 with 3 rules applied. Total rules applied 590 place count 61 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 596 place count 58 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 599 place count 58 transition count 84
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 602 place count 55 transition count 81
Iterating global reduction 11 with 3 rules applied. Total rules applied 605 place count 55 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 607 place count 55 transition count 79
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 12 with 18 rules applied. Total rules applied 625 place count 46 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 640 place count 46 transition count 65
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 647 place count 39 transition count 58
Iterating global reduction 13 with 7 rules applied. Total rules applied 654 place count 39 transition count 58
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 661 place count 39 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 663 place count 38 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 664 place count 38 transition count 56
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 665 place count 37 transition count 55
Iterating global reduction 14 with 1 rules applied. Total rules applied 666 place count 37 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 668 place count 37 transition count 53
Free-agglomeration rule applied 8 times.
Iterating global reduction 15 with 8 rules applied. Total rules applied 676 place count 37 transition count 45
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 687 place count 29 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 688 place count 28 transition count 41
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 16 with 3 rules applied. Total rules applied 691 place count 26 transition count 40
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 17 with 2 rules applied. Total rules applied 693 place count 25 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 694 place count 24 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 1 Pre rules applied. Total rules applied 694 place count 24 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 696 place count 23 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 700 place count 21 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 704 place count 21 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 706 place count 20 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 708 place count 20 transition count 30
Applied a total of 708 rules in 101 ms. Remains 20 /359 variables (removed 339) and now considering 30/445 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 20/359 places, 30/445 transitions.
// Phase 1: matrix 30 rows 20 cols
[2024-06-02 18:06:25] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (38401 resets) in 642 ms. (1555 steps per ms)
FORMULA CO4-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (10812 resets) in 308 ms. (3236 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-02 18:06:26] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:06:26] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:06:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7198624015043270349.gal : 4 ms
[2024-06-02 18:06:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2123866691900331220.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7198624015043270349.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2123866691900331220.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8985 ms.
BK_STOP 1717351586327
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CO4-PT-08"
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-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-08, 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 r550-tall-171734898500061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-08.tgz
mv CO4-PT-08 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 ;