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.r553-tall-171734901200221.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 ltsminxred
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 r553-tall-171734901200221
=====================================================================

--------------------
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 1717354377150

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:52:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:52:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:52:58] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 18:52:58] [INFO ] Transformed 126 places.
[2024-06-02 18:52:58] [INFO ] Transformed 396 transitions.
[2024-06-02 18:52:58] [INFO ] Found NUPN structural information;
[2024-06-02 18:52:58] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 170 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 18:52:58] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
// Phase 1: matrix 311 rows 126 cols
[2024-06-02 18:52:58] [INFO ] Computed 8 invariants in 27 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 (552 resets) in 45 ms. (217 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-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (555 resets) in 49 ms. (800 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 18:52:58] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
[2024-06-02 18:52:58] [INFO ] Invariant cache hit.
[2024-06-02 18:52:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:52:58] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-06-02 18:52:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:52:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:52:59] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-02 18:52:59] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 18:52:59] [INFO ] [Nat]Added 45 Read/Feed constraints in 44 ms returned sat
[2024-06-02 18:52:59] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 35 ms.
[2024-06-02 18:52:59] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 22 ms to minimize.
[2024-06-02 18:52:59] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:52:59] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:52:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 328 ms
[2024-06-02 18:52:59] [INFO ] Added : 27 causal constraints over 8 iterations in 523 ms. Result :sat
Minimization took 90 ms.
[2024-06-02 18:52:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:52:59] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-02 18:52:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:52:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:52:59] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 18:52:59] [INFO ] [Nat]Added 45 Read/Feed constraints in 22 ms returned sat
[2024-06-02 18:53:00] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 41 ms.
[2024-06-02 18:53:00] [INFO ] Added : 40 causal constraints over 8 iterations in 189 ms. Result :sat
Minimization took 82 ms.
[2024-06-02 18:53:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:53:00] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:53:00] [INFO ] [Real]Added 45 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:53:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:53:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:53:00] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 18:53:00] [INFO ] [Nat]Added 45 Read/Feed constraints in 15 ms returned sat
[2024-06-02 18:53:00] [INFO ] Computed and/alt/rep : 125/471/125 causal constraints (skipped 185 transitions) in 29 ms.
[2024-06-02 18:53:00] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:53:00] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:53:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2024-06-02 18:53:00] [INFO ] Added : 30 causal constraints over 11 iterations in 417 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
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 146 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 156 ms. Remains : 101/126 places, 279/343 transitions.
[2024-06-02 18:53:01] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
// Phase 1: matrix 250 rows 101 cols
[2024-06-02 18:53:01] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (57840 resets) in 1137 ms. (878 steps per ms)
FORMULA FireWire-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (28442 resets) in 781 ms. (2557 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 18:53:03] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:53:03] [INFO ] Invariant cache hit.
[2024-06-02 18:53:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:53:03] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:53:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:53:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:53:03] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:53:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:53:03] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-06-02 18:53:03] [INFO ] Computed and/alt/rep : 113/458/113 causal constraints (skipped 135 transitions) in 23 ms.
[2024-06-02 18:53:03] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-02 18:53:03] [INFO ] Added : 45 causal constraints over 10 iterations in 276 ms. Result :sat
Minimization took 70 ms.
[2024-06-02 18:53:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:53:03] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-02 18:53:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:53:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:53:04] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-02 18:53:04] [INFO ] [Nat]Added 38 Read/Feed constraints in 16 ms returned sat
[2024-06-02 18:53:04] [INFO ] Computed and/alt/rep : 113/458/113 causal constraints (skipped 135 transitions) in 21 ms.
[2024-06-02 18:53:04] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:53:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-06-02 18:53:04] [INFO ] Added : 25 causal constraints over 5 iterations in 203 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 5 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 18:53:04] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:53:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (57795 resets) in 1034 ms. (966 steps per ms)
BEST_FIRST walk for 2000001 steps (28242 resets) in 747 ms. (2673 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 18:53:06] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:53:06] [INFO ] Invariant cache hit.
[2024-06-02 18:53:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:53:06] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:53:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:53:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:53:06] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:53:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:53:06] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-06-02 18:53:06] [INFO ] Computed and/alt/rep : 113/458/113 causal constraints (skipped 135 transitions) in 14 ms.
[2024-06-02 18:53:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:53:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 18:53:06] [INFO ] Added : 45 causal constraints over 10 iterations in 262 ms. Result :sat
Minimization took 65 ms.
[2024-06-02 18:53:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:53:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:53:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:53:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 18:53:06] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-02 18:53:06] [INFO ] [Nat]Added 38 Read/Feed constraints in 16 ms returned sat
[2024-06-02 18:53:06] [INFO ] Computed and/alt/rep : 113/458/113 causal constraints (skipped 135 transitions) in 18 ms.
[2024-06-02 18:53:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:53:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-02 18:53:07] [INFO ] Added : 25 causal constraints over 5 iterations in 199 ms. Result :sat
Minimization took 57 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 279/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 18:53:07] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:53:07] [INFO ] Invariant cache hit.
[2024-06-02 18:53:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:53:07] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:53:07] [INFO ] Invariant cache hit.
[2024-06-02 18:53:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 18:53:07] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-06-02 18:53:07] [INFO ] Redundant transitions in 15 ms returned []
Running 277 sub problems to find dead transitions.
[2024-06-02 18:53:07] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 18:53:07] [INFO ] Invariant cache hit.
[2024-06-02 18:53:07] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:53:08] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:53:09] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 250/350 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 38/152 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 18:53:11] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:53:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/351 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 18:53:15] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:53:15] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:53:16] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:53:16] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 10 (OVERLAPS) 0/351 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 159 constraints, problems are : Problem set: 0 solved, 277 unsolved in 13933 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 250/350 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 277/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 1/351 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 436 constraints, problems are : Problem set: 0 solved, 277 unsolved in 17426 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 12/12 constraints]
After SMT, in 31570ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 31584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31856 ms. Remains : 101/101 places, 279/279 transitions.
RANDOM walk for 40000 steps (2295 resets) in 785 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (601 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (541 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (599 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (567 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2250 steps, run visited all 4 properties in 42 ms. (steps per millisecond=53 )
Probabilistic random walk after 2250 steps, saw 1291 distinct states, run finished after 45 ms. (steps per millisecond=50 ) properties seen :4
FORMULA FireWire-PT-07-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-07-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 41266 ms.
ITS solved all properties within timeout

BK_STOP 1717354419595

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="ltsminxred"
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 ltsminxred"
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 r553-tall-171734901200221"
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 ;