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-171734898900245.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 FireWire-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898900245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 101K 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 FireWire-PT-10-UpperBounds-00
FORMULA_NAME FireWire-PT-10-UpperBounds-01
FORMULA_NAME FireWire-PT-10-UpperBounds-02
FORMULA_NAME FireWire-PT-10-UpperBounds-03
FORMULA_NAME FireWire-PT-10-UpperBounds-04
FORMULA_NAME FireWire-PT-10-UpperBounds-05
FORMULA_NAME FireWire-PT-10-UpperBounds-06
FORMULA_NAME FireWire-PT-10-UpperBounds-07
FORMULA_NAME FireWire-PT-10-UpperBounds-08
FORMULA_NAME FireWire-PT-10-UpperBounds-09
FORMULA_NAME FireWire-PT-10-UpperBounds-10
FORMULA_NAME FireWire-PT-10-UpperBounds-11
FORMULA_NAME FireWire-PT-10-UpperBounds-12
FORMULA_NAME FireWire-PT-10-UpperBounds-13
FORMULA_NAME FireWire-PT-10-UpperBounds-14
FORMULA_NAME FireWire-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717362413153

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 21:06:54] [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 21:06:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:06:54] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 21:06:54] [INFO ] Transformed 131 places.
[2024-06-02 21:06:54] [INFO ] Transformed 409 transitions.
[2024-06-02 21:06:54] [INFO ] Found NUPN structural information;
[2024-06-02 21:06:54] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 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, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 21:06:54] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
// Phase 1: matrix 321 rows 131 cols
[2024-06-02 21:06:54] [INFO ] Computed 8 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (581 resets) in 42 ms. (232 steps per ms)
FORMULA FireWire-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (713 resets) in 58 ms. (847 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-02 21:06:54] [INFO ] Flow matrix only has 321 transitions (discarded 32 similar events)
[2024-06-02 21:06:54] [INFO ] Invariant cache hit.
[2024-06-02 21:06:54] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 21:06:54] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-02 21:06:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:06:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 21:06:55] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-02 21:06:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 21:06:55] [INFO ] [Nat]Added 45 Read/Feed constraints in 17 ms returned sat
[2024-06-02 21:06:55] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 40 ms.
[2024-06-02 21:06:55] [INFO ] Added : 17 causal constraints over 4 iterations in 172 ms. Result :sat
Minimization took 55 ms.
[2024-06-02 21:06:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:06:55] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-02 21:06:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:06:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 21:06:55] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 21:06:55] [INFO ] [Nat]Added 45 Read/Feed constraints in 18 ms returned sat
[2024-06-02 21:06:55] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 29 ms.
[2024-06-02 21:06:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 9 ms to minimize.
[2024-06-02 21:06:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 21:06:56] [INFO ] Added : 34 causal constraints over 9 iterations in 326 ms. Result :sat
Minimization took 56 ms.
[2024-06-02 21:06:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 21:06:56] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-02 21:06:56] [INFO ] [Real]Added 45 Read/Feed constraints in 17 ms returned sat
[2024-06-02 21:06:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:06:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:06:56] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-02 21:06:56] [INFO ] [Nat]Added 45 Read/Feed constraints in 10 ms returned sat
[2024-06-02 21:06:56] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 33 ms.
[2024-06-02 21:06:56] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 5 ms to minimize.
[2024-06-02 21:06:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:06:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2024-06-02 21:06:56] [INFO ] Added : 19 causal constraints over 6 iterations in 353 ms. Result :sat
Minimization took 47 ms.
[2024-06-02 21:06:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:06:56] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 21:06:56] [INFO ] [Real]Added 45 Read/Feed constraints in 18 ms returned sat
[2024-06-02 21:06:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:06:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 21:06:57] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 21:06:57] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2024-06-02 21:06:57] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 39 ms.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 21:06:57] [INFO ] Added : 20 causal constraints over 7 iterations in 279 ms. Result :sat
Minimization took 59 ms.
[2024-06-02 21:06:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 21:06:57] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 21:06:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:06:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 21:06:57] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 21:06:57] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 21:06:57] [INFO ] Computed and/alt/rep : 126/467/126 causal constraints (skipped 194 transitions) in 27 ms.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:06:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2024-06-02 21:06:58] [INFO ] Added : 18 causal constraints over 6 iterations in 361 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA FireWire-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 131 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 127 transition count 342
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 127 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 127 transition count 339
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 126 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 126 transition count 336
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 125 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 125 transition count 334
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 124 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 124 transition count 331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 123 transition count 329
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 123 transition count 329
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 122 transition count 326
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 121 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 121 transition count 324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 120 transition count 321
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 119 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 118 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 117 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 116 transition count 312
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 115 transition count 310
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 115 transition count 310
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 114 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 111 transition count 315
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 111 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 61 place count 111 transition count 300
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 111 transition count 302
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 110 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 110 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 109 transition count 297
Applied a total of 68 rules in 156 ms. Remains 109 /131 variables (removed 22) and now considering 297/353 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 109/131 places, 297/353 transitions.
[2024-06-02 21:06:58] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 21:06:58] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (58111 resets) in 1184 ms. (843 steps per ms)
FORMULA FireWire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (14229 resets) in 530 ms. (1883 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 21:07:00] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 21:07:00] [INFO ] Invariant cache hit.
[2024-06-02 21:07:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:07:00] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 21:07:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:07:00] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-06-02 21:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:07:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:07:00] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 21:07:00] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 21:07:00] [INFO ] Computed and/alt/rep : 120/484/120 causal constraints (skipped 146 transitions) in 25 ms.
[2024-06-02 21:07:00] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:07:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-06-02 21:07:00] [INFO ] Added : 37 causal constraints over 9 iterations in 240 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 109 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p95) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 294/294 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 292
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 287
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 5 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 105 transition count 282
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 105 transition count 282
Applied a total of 5 rules in 26 ms. Remains 105 /109 variables (removed 4) and now considering 282/294 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 105/109 places, 282/294 transitions.
[2024-06-02 21:07:00] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
// Phase 1: matrix 253 rows 105 cols
[2024-06-02 21:07:00] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (60928 resets) in 1151 ms. (868 steps per ms)
BEST_FIRST walk for 1000001 steps (15179 resets) in 419 ms. (2380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 21:07:02] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 21:07:02] [INFO ] Invariant cache hit.
[2024-06-02 21:07:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:07:02] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 21:07:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:07:02] [INFO ] [Real]Added 38 Read/Feed constraints in 11 ms returned sat
[2024-06-02 21:07:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:07:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 21:07:02] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 21:07:02] [INFO ] [Nat]Added 38 Read/Feed constraints in 14 ms returned sat
[2024-06-02 21:07:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:07:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-06-02 21:07:02] [INFO ] Computed and/alt/rep : 114/468/114 causal constraints (skipped 137 transitions) in 14 ms.
[2024-06-02 21:07:02] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:07:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 21:07:02] [INFO ] Added : 46 causal constraints over 10 iterations in 244 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 282/282 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 282/282 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 105/105 places, 282/282 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 282/282 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2024-06-02 21:07:02] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 21:07:02] [INFO ] Invariant cache hit.
[2024-06-02 21:07:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:07:03] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
[2024-06-02 21:07:03] [INFO ] Invariant cache hit.
[2024-06-02 21:07:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:07:03] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 241 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/105 places, 282/282 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 280
Applied a total of 4 rules in 12 ms. Remains 101 /103 variables (removed 2) and now considering 280/282 (removed 2) transitions.
[2024-06-02 21:07:03] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
// Phase 1: matrix 251 rows 101 cols
[2024-06-02 21:07:03] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:07:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 21:07:03] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 21:07:03] [INFO ] Invariant cache hit.
[2024-06-02 21:07:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:07:03] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 101/105 places, 280/282 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 455 ms. Remains : 101/105 places, 280/282 transitions.
[2024-06-02 21:07:03] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 21:07:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA FireWire-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (60454 resets) in 1088 ms. (918 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 21:07:04] [INFO ] Flatten gal took : 53 ms
[2024-06-02 21:07:04] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:07:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9916291829694586979.gal : 12 ms
[2024-06-02 21:07:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3079529187558821087.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/ReachabilityCardinality9916291829694586979.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3079529187558821087.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 10476 ms.

BK_STOP 1717362424832

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="FireWire-PT-10"
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 FireWire-PT-10, 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-171734898900245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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