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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-07-UpperBounds-00
FORMULA_NAME FireWire-PT-07-UpperBounds-01
FORMULA_NAME FireWire-PT-07-UpperBounds-02
FORMULA_NAME FireWire-PT-07-UpperBounds-03
FORMULA_NAME FireWire-PT-07-UpperBounds-04
FORMULA_NAME FireWire-PT-07-UpperBounds-05
FORMULA_NAME FireWire-PT-07-UpperBounds-06
FORMULA_NAME FireWire-PT-07-UpperBounds-07
FORMULA_NAME FireWire-PT-07-UpperBounds-08
FORMULA_NAME FireWire-PT-07-UpperBounds-09
FORMULA_NAME FireWire-PT-07-UpperBounds-10
FORMULA_NAME FireWire-PT-07-UpperBounds-11
FORMULA_NAME FireWire-PT-07-UpperBounds-12
FORMULA_NAME FireWire-PT-07-UpperBounds-13
FORMULA_NAME FireWire-PT-07-UpperBounds-14
FORMULA_NAME FireWire-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717360764081

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 20:39:25] [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 20:39:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:39:25] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 20:39:25] [INFO ] Transformed 126 places.
[2024-06-02 20:39:25] [INFO ] Transformed 396 transitions.
[2024-06-02 20:39:25] [INFO ] Found NUPN structural information;
[2024-06-02 20:39:25] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 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 20:39:25] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
// Phase 1: matrix 311 rows 126 cols
[2024-06-02 20:39:25] [INFO ] Computed 8 invariants in 28 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 (561 resets) in 46 ms. (212 steps per ms)
FORMULA FireWire-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (849 resets) in 67 ms. (882 steps per ms)
FORMULA FireWire-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 20:39:25] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
[2024-06-02 20:39:25] [INFO ] Invariant cache hit.
[2024-06-02 20:39:25] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 20:39:25] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-02 20:39:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:39:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:39:26] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-02 20:39:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:39:26] [INFO ] [Nat]Added 45 Read/Feed constraints in 55 ms returned sat
[2024-06-02 20:39:26] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 47 ms.
[2024-06-02 20:39:26] [INFO ] Added : 0 causal constraints over 0 iterations in 94 ms. Result :sat
Minimization took 110 ms.
[2024-06-02 20:39:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:39:26] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 20:39:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:39:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:39:26] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 20:39:26] [INFO ] [Nat]Added 45 Read/Feed constraints in 43 ms returned sat
[2024-06-02 20:39:26] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 34 ms.
[2024-06-02 20:39:26] [INFO ] Added : 0 causal constraints over 0 iterations in 61 ms. Result :sat
Minimization took 74 ms.
[2024-06-02 20:39:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:39:27] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 20:39:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:39:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:39:27] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 20:39:27] [INFO ] [Nat]Added 45 Read/Feed constraints in 23 ms returned sat
[2024-06-02 20:39:27] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 31 ms.
[2024-06-02 20:39:27] [INFO ] Added : 40 causal constraints over 8 iterations in 229 ms. Result :sat
Minimization took 83 ms.
[2024-06-02 20:39:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:39:27] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 20:39:27] [INFO ] [Real]Added 45 Read/Feed constraints in 19 ms returned sat
[2024-06-02 20:39:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:39:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:39:27] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 20:39:27] [INFO ] [Nat]Added 45 Read/Feed constraints in 14 ms returned sat
[2024-06-02 20:39:27] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 35 ms.
[2024-06-02 20:39:28] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 12 ms to minimize.
[2024-06-02 20:39:28] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:39:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2024-06-02 20:39:28] [INFO ] Added : 30 causal constraints over 11 iterations in 473 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA FireWire-PT-07-UpperBounds-13 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 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 343/343 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 126 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 120 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 120 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 120 transition count 323
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 118 transition count 318
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 117 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 116 transition count 313
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 115 transition count 311
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 114 transition count 308
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 113 transition count 306
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 113 transition count 306
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 112 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 112 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 111 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 111 transition count 301
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 110 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 110 transition count 298
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 109 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 109 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 108 transition count 294
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 108 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 107 transition count 292
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 107 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 106 transition count 291
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 103 transition count 297
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 58 place count 103 transition count 291
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 67 place count 103 transition count 282
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 103 transition count 284
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 71 place count 102 transition count 282
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 73 place count 102 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 101 transition count 279
Applied a total of 74 rules in 140 ms. Remains 101 /126 variables (removed 25) and now considering 279/343 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 101/126 places, 279/343 transitions.
[2024-06-02 20:39:28] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
// Phase 1: matrix 250 rows 101 cols
[2024-06-02 20:39:28] [INFO ] Computed 8 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (57843 resets) in 1116 ms. (895 steps per ms)
FORMULA FireWire-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (27929 resets) in 803 ms. (2487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 20:39:30] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 20:39:30] [INFO ] Invariant cache hit.
[2024-06-02 20:39:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:39:30] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 20:39:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:39:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:39:30] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 20:39:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:39:30] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-06-02 20:39:30] [INFO ] Computed and/alt/rep : 113/458/113 causal constraints (skipped 135 transitions) in 28 ms.
[2024-06-02 20:39:30] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:39:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 20:39:31] [INFO ] Added : 45 causal constraints over 10 iterations in 281 ms. Result :sat
Minimization took 84 ms.
[2024-06-02 20:39:31] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:39:31] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 20:39:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:39:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:39:31] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:39:31] [INFO ] [Nat]Added 38 Read/Feed constraints in 16 ms returned sat
[2024-06-02 20:39:31] [INFO ] Computed and/alt/rep : 113/458/113 causal constraints (skipped 135 transitions) in 14 ms.
[2024-06-02 20:39:31] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:39:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-02 20:39:31] [INFO ] Added : 25 causal constraints over 5 iterations in 185 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 279/279 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 279/279 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 101/101 places, 279/279 transitions.
[2024-06-02 20:39:31] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 20:39:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (58024 resets) in 1025 ms. (974 steps per ms)
FORMULA FireWire-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (28217 resets) in 760 ms. (2628 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 20:39:33] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 20:39:33] [INFO ] Invariant cache hit.
[2024-06-02 20:39:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:39:33] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:39:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:39:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:39:33] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:39:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:39:33] [INFO ] [Nat]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-06-02 20:39:33] [INFO ] Computed and/alt/rep : 113/458/113 causal constraints (skipped 135 transitions) in 13 ms.
[2024-06-02 20:39:33] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-06-02 20:39:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-02 20:39:33] [INFO ] Added : 45 causal constraints over 10 iterations in 265 ms. Result :sat
Minimization took 61 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 101 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p89) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 277/277 transitions.
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 99 transition count 270
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 5 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 97 transition count 265
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 97 transition count 265
Applied a total of 6 rules in 15 ms. Remains 97 /101 variables (removed 4) and now considering 265/277 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 97/101 places, 265/277 transitions.
[2024-06-02 20:39:33] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
// Phase 1: matrix 236 rows 97 cols
[2024-06-02 20:39:33] [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 (60995 resets) in 1122 ms. (890 steps per ms)
BEST_FIRST walk for 1000001 steps (14843 resets) in 414 ms. (2409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 20:39:35] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:39:35] [INFO ] Invariant cache hit.
[2024-06-02 20:39:35] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:39:35] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 20:39:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:39:35] [INFO ] [Real]Added 37 Read/Feed constraints in 10 ms returned sat
[2024-06-02 20:39:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:39:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:39:35] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:39:35] [INFO ] [Nat]Added 37 Read/Feed constraints in 10 ms returned sat
[2024-06-02 20:39:35] [INFO ] Computed and/alt/rep : 108/435/108 causal constraints (skipped 126 transitions) in 18 ms.
[2024-06-02 20:39:35] [INFO ] Added : 32 causal constraints over 7 iterations in 119 ms. Result :sat
Minimization took 60 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 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 265/265 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 97/97 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 265/265 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-06-02 20:39:35] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:39:35] [INFO ] Invariant cache hit.
[2024-06-02 20:39:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:39:35] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:39:35] [INFO ] Invariant cache hit.
[2024-06-02 20:39:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:39:36] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-06-02 20:39:36] [INFO ] Redundant transitions in 12 ms returned []
Running 263 sub problems to find dead transitions.
[2024-06-02 20:39:36] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
[2024-06-02 20:39:36] [INFO ] Invariant cache hit.
[2024-06-02 20:39:36] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-02 20:39:37] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:39:38] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:39:39] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:39:39] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-06-02 20:39:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 236/332 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 37/149 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-06-02 20:39:41] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:39:42] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 7 ms to minimize.
[2024-06-02 20:39:42] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/333 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/333 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 153 constraints, problems are : Problem set: 0 solved, 263 unsolved in 12881 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 236/332 variables, 96/115 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 263/415 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/333 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/333 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 416 constraints, problems are : Problem set: 0 solved, 263 unsolved in 12779 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints]
After SMT, in 25900ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 25913ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26159 ms. Remains : 97/97 places, 265/265 transitions.
RANDOM walk for 40000 steps (2423 resets) in 761 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (566 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
[2024-06-02 20:40:02] [INFO ] Flatten gal took : 104 ms
BEST_FIRST walk for 40003 steps (598 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
[2024-06-02 20:40:02] [INFO ] Flatten gal took : 30 ms
Finished probabilistic random walk after 1880 steps, run visited all 2 properties in 31 ms. (steps per millisecond=60 )
Probabilistic random walk after 1880 steps, saw 1054 distinct states, run finished after 35 ms. (steps per millisecond=53 ) properties seen :2
[2024-06-02 20:40:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13971231926947095445.gal : 10 ms
[2024-06-02 20:40:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16616658796226711934.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/ReachabilityCardinality13971231926947095445.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16616658796226711934.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-07-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 37302 ms.

BK_STOP 1717360802528

--------------------
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="FireWire-PT-07"
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-07, 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-171734898800221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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