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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 48K 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 26K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K 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 86K 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-03-UpperBounds-00
FORMULA_NAME FireWire-PT-03-UpperBounds-01
FORMULA_NAME FireWire-PT-03-UpperBounds-02
FORMULA_NAME FireWire-PT-03-UpperBounds-03
FORMULA_NAME FireWire-PT-03-UpperBounds-04
FORMULA_NAME FireWire-PT-03-UpperBounds-05
FORMULA_NAME FireWire-PT-03-UpperBounds-06
FORMULA_NAME FireWire-PT-03-UpperBounds-07
FORMULA_NAME FireWire-PT-03-UpperBounds-08
FORMULA_NAME FireWire-PT-03-UpperBounds-09
FORMULA_NAME FireWire-PT-03-UpperBounds-10
FORMULA_NAME FireWire-PT-03-UpperBounds-11
FORMULA_NAME FireWire-PT-03-UpperBounds-12
FORMULA_NAME FireWire-PT-03-UpperBounds-13
FORMULA_NAME FireWire-PT-03-UpperBounds-14
FORMULA_NAME FireWire-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717359590107

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 20:19:51] [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:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:19:51] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 20:19:51] [INFO ] Transformed 112 places.
[2024-06-02 20:19:51] [INFO ] Transformed 356 transitions.
[2024-06-02 20:19:51] [INFO ] Found NUPN structural information;
[2024-06-02 20:19:51] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 173 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:19:51] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 20:19:51] [INFO ] Computed 9 invariants in 33 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 (485 resets) in 42 ms. (232 steps per ms)
FORMULA FireWire-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110008 steps (1408 resets) in 139 ms. (785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 20:19:51] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
[2024-06-02 20:19:51] [INFO ] Invariant cache hit.
[2024-06-02 20:19:51] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 20:19:52] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-06-02 20:19:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:19:52] [INFO ] [Real]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-06-02 20:19:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 20:19:52] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 20:19:52] [INFO ] [Nat]Added 41 Read/Feed constraints in 15 ms returned sat
[2024-06-02 20:19:52] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 40 ms.
[2024-06-02 20:19:52] [INFO ] Added : 6 causal constraints over 2 iterations in 126 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 20:19:52] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:52] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-02 20:19:52] [INFO ] [Real]Added 41 Read/Feed constraints in 7 ms returned sat
[2024-06-02 20:19:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:52] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 20:19:52] [INFO ] [Nat]Added 41 Read/Feed constraints in 22 ms returned sat
[2024-06-02 20:19:52] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 26 ms.
[2024-06-02 20:19:52] [INFO ] Added : 6 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 90 ms.
[2024-06-02 20:19:53] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:53] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 20:19:53] [INFO ] [Real]Added 41 Read/Feed constraints in 13 ms returned sat
[2024-06-02 20:19:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:53] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 20:19:53] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:19:53] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 24 ms.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 10 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-02 20:19:53] [INFO ] Added : 47 causal constraints over 10 iterations in 313 ms. Result :sat
Minimization took 106 ms.
[2024-06-02 20:19:53] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:53] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 20:19:53] [INFO ] [Real]Added 41 Read/Feed constraints in 28 ms returned sat
[2024-06-02 20:19:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:53] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 20:19:53] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:19:53] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 30 ms.
[2024-06-02 20:19:54] [INFO ] Added : 49 causal constraints over 12 iterations in 250 ms. Result :sat
Minimization took 107 ms.
[2024-06-02 20:19:54] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 20:19:54] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 20:19:54] [INFO ] [Real]Added 41 Read/Feed constraints in 15 ms returned sat
[2024-06-02 20:19:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:54] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 20:19:54] [INFO ] [Nat]Added 41 Read/Feed constraints in 20 ms returned sat
[2024-06-02 20:19:54] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 23 ms.
[2024-06-02 20:19:54] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-02 20:19:54] [INFO ] Added : 16 causal constraints over 4 iterations in 237 ms. Result :sat
Minimization took 121 ms.
[2024-06-02 20:19:54] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:55] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 20:19:55] [INFO ] [Real]Added 41 Read/Feed constraints in 29 ms returned sat
[2024-06-02 20:19:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:55] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 20:19:55] [INFO ] [Nat]Added 41 Read/Feed constraints in 18 ms returned sat
[2024-06-02 20:19:55] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 27 ms.
[2024-06-02 20:19:55] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:19:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-02 20:19:55] [INFO ] Added : 36 causal constraints over 8 iterations in 276 ms. Result :sat
Minimization took 109 ms.
[2024-06-02 20:19:55] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:55] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 20:19:55] [INFO ] [Real]Added 41 Read/Feed constraints in 7 ms returned sat
[2024-06-02 20:19:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:55] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 20:19:55] [INFO ] [Nat]Added 41 Read/Feed constraints in 27 ms returned sat
[2024-06-02 20:19:55] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 25 ms.
[2024-06-02 20:19:55] [INFO ] Added : 7 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 103 ms.
[2024-06-02 20:19:56] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:56] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 20:19:56] [INFO ] [Real]Added 41 Read/Feed constraints in 17 ms returned sat
[2024-06-02 20:19:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:56] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 20:19:56] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:19:56] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 18 ms.
[2024-06-02 20:19:56] [INFO ] Added : 64 causal constraints over 15 iterations in 268 ms. Result :sat
Minimization took 120 ms.
[2024-06-02 20:19:56] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-02 20:19:56] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 20:19:56] [INFO ] [Real]Added 41 Read/Feed constraints in 7 ms returned sat
[2024-06-02 20:19:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 20:19:56] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 20:19:56] [INFO ] [Nat]Added 41 Read/Feed constraints in 27 ms returned sat
[2024-06-02 20:19:56] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 27 ms.
[2024-06-02 20:19:57] [INFO ] Added : 12 causal constraints over 3 iterations in 103 ms. Result :sat
Minimization took 114 ms.
[2024-06-02 20:19:57] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:19:57] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:19:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 20:19:57] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:19:57] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:19:57] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 18 ms.
[2024-06-02 20:19:57] [INFO ] Added : 14 causal constraints over 5 iterations in 160 ms. Result :sat
Minimization took 107 ms.
[2024-06-02 20:19:57] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 20:19:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:19:57] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-06-02 20:19:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:19:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-02 20:19:57] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:19:57] [INFO ] [Nat]Added 41 Read/Feed constraints in 19 ms returned sat
[2024-06-02 20:19:57] [INFO ] Computed and/alt/rep : 120/476/120 causal constraints (skipped 150 transitions) in 19 ms.
[2024-06-02 20:19:58] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-06-02 20:19:58] [INFO ] Added : 10 causal constraints over 4 iterations in 222 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-01 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 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 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 112 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 299
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 299
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 108 transition count 291
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 108 transition count 291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 106 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 106 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 101 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 31 place count 101 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 42 place count 101 transition count 275
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 101 transition count 277
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 2 with 3 rules applied. Total rules applied 46 place count 100 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 100 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 99 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 98 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 50 place count 98 transition count 271
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 97 transition count 271
Applied a total of 52 rules in 111 ms. Remains 97 /112 variables (removed 15) and now considering 271/303 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 97/112 places, 271/303 transitions.
[2024-06-02 20:19:58] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
// Phase 1: matrix 243 rows 97 cols
[2024-06-02 20:19:58] [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 (60937 resets) in 1125 ms. (888 steps per ms)
BEST_FIRST walk for 3000001 steps (44955 resets) in 1101 ms. (2722 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 20:20:00] [INFO ] Flow matrix only has 243 transitions (discarded 28 similar events)
[2024-06-02 20:20:00] [INFO ] Invariant cache hit.
[2024-06-02 20:20:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:20:00] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 20:20:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:20:00] [INFO ] [Real]Added 37 Read/Feed constraints in 17 ms returned sat
[2024-06-02 20:20:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:20:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:20:01] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:20:01] [INFO ] [Nat]Added 37 Read/Feed constraints in 13 ms returned sat
[2024-06-02 20:20:01] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 22 ms.
[2024-06-02 20:20:01] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-06-02 20:20:01] [INFO ] Added : 42 causal constraints over 11 iterations in 264 ms. Result :sat
Minimization took 83 ms.
[2024-06-02 20:20:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:20:01] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-02 20:20:01] [INFO ] [Real]Added 37 Read/Feed constraints in 21 ms returned sat
[2024-06-02 20:20:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:20:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:20:01] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 20:20:01] [INFO ] [Nat]Added 37 Read/Feed constraints in 15 ms returned sat
[2024-06-02 20:20:01] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 14 ms.
[2024-06-02 20:20:01] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 20:20:01] [INFO ] Added : 52 causal constraints over 12 iterations in 253 ms. Result :sat
Minimization took 77 ms.
[2024-06-02 20:20:01] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 20:20:01] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-02 20:20:01] [INFO ] [Real]Added 37 Read/Feed constraints in 3 ms returned sat
[2024-06-02 20:20:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:20:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:20:02] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-02 20:20:02] [INFO ] [Nat]Added 37 Read/Feed constraints in 14 ms returned sat
[2024-06-02 20:20:02] [INFO ] Computed and/alt/rep : 108/429/108 causal constraints (skipped 133 transitions) in 15 ms.
[2024-06-02 20:20:02] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:20:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-02 20:20:02] [INFO ] Added : 11 causal constraints over 3 iterations in 137 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA FireWire-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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 20:20:02] [INFO ] Flatten gal took : 56 ms
[2024-06-02 20:20:02] [INFO ] Flatten gal took : 24 ms
[2024-06-02 20:20:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4409577881143662601.gal : 13 ms
[2024-06-02 20:20:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17011771872335248707.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/ReachabilityCardinality4409577881143662601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17011771872335248707.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 11463 ms.

BK_STOP 1717359602778

--------------------
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-03"
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-03, 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-171734898800189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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