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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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-08-UpperBounds-00
FORMULA_NAME FireWire-PT-08-UpperBounds-01
FORMULA_NAME FireWire-PT-08-UpperBounds-02
FORMULA_NAME FireWire-PT-08-UpperBounds-03
FORMULA_NAME FireWire-PT-08-UpperBounds-04
FORMULA_NAME FireWire-PT-08-UpperBounds-05
FORMULA_NAME FireWire-PT-08-UpperBounds-06
FORMULA_NAME FireWire-PT-08-UpperBounds-07
FORMULA_NAME FireWire-PT-08-UpperBounds-08
FORMULA_NAME FireWire-PT-08-UpperBounds-09
FORMULA_NAME FireWire-PT-08-UpperBounds-10
FORMULA_NAME FireWire-PT-08-UpperBounds-11
FORMULA_NAME FireWire-PT-08-UpperBounds-12
FORMULA_NAME FireWire-PT-08-UpperBounds-13
FORMULA_NAME FireWire-PT-08-UpperBounds-14
FORMULA_NAME FireWire-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717361566119

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 20:52:47] [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:52:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:47] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-06-02 20:52:47] [INFO ] Transformed 127 places.
[2024-06-02 20:52:47] [INFO ] Transformed 397 transitions.
[2024-06-02 20:52:47] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:47] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 179 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:52:47] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
// Phase 1: matrix 312 rows 127 cols
[2024-06-02 20:52:47] [INFO ] Computed 8 invariants in 24 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 (555 resets) in 43 ms. (227 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (1299 resets) in 133 ms. (671 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 20:52:47] [INFO ] Flow matrix only has 312 transitions (discarded 32 similar events)
[2024-06-02 20:52:47] [INFO ] Invariant cache hit.
[2024-06-02 20:52:47] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:52:47] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 20:52:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:52:48] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-02 20:52:48] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 20:52:48] [INFO ] [Nat]Added 45 Read/Feed constraints in 24 ms returned sat
[2024-06-02 20:52:48] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 33 ms.
[2024-06-02 20:52:48] [INFO ] Added : 27 causal constraints over 6 iterations in 205 ms. Result :sat
Minimization took 75 ms.
[2024-06-02 20:52:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:48] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-02 20:52:48] [INFO ] [Real]Added 45 Read/Feed constraints in 16 ms returned sat
[2024-06-02 20:52:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:48] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-02 20:52:48] [INFO ] [Nat]Added 45 Read/Feed constraints in 27 ms returned sat
[2024-06-02 20:52:48] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 32 ms.
[2024-06-02 20:52:48] [INFO ] Added : 15 causal constraints over 4 iterations in 117 ms. Result :sat
Minimization took 61 ms.
[2024-06-02 20:52:49] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:52:49] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 20:52:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:52:49] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-02 20:52:49] [INFO ] [Nat]Added 45 Read/Feed constraints in 39 ms returned sat
[2024-06-02 20:52:49] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 36 ms.
[2024-06-02 20:52:49] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 12 ms to minimize.
[2024-06-02 20:52:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-06-02 20:52:49] [INFO ] Added : 29 causal constraints over 8 iterations in 339 ms. Result :sat
Minimization took 70 ms.
[2024-06-02 20:52:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:49] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 20:52:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:52:49] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-02 20:52:49] [INFO ] [Nat]Added 45 Read/Feed constraints in 17 ms returned sat
[2024-06-02 20:52:49] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 42 ms.
[2024-06-02 20:52:50] [INFO ] Added : 38 causal constraints over 8 iterations in 216 ms. Result :sat
Minimization took 74 ms.
[2024-06-02 20:52:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:50] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-02 20:52:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:50] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-06-02 20:52:50] [INFO ] [Nat]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-06-02 20:52:50] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 25 ms.
[2024-06-02 20:52:50] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:52:50] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:52:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2024-06-02 20:52:50] [INFO ] Added : 33 causal constraints over 8 iterations in 393 ms. Result :sat
Minimization took 70 ms.
[2024-06-02 20:52:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:52:51] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 20:52:51] [INFO ] [Real]Added 45 Read/Feed constraints in 15 ms returned sat
[2024-06-02 20:52:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:51] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 20:52:51] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:52:51] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 21 ms.
[2024-06-02 20:52:51] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:52:51] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:52:51] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:52:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2024-06-02 20:52:51] [INFO ] Added : 22 causal constraints over 6 iterations in 385 ms. Result :sat
Minimization took 72 ms.
[2024-06-02 20:52:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:51] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 20:52:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:51] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-02 20:52:51] [INFO ] [Nat]Added 45 Read/Feed constraints in 26 ms returned sat
[2024-06-02 20:52:51] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 23 ms.
[2024-06-02 20:52:52] [INFO ] Added : 20 causal constraints over 5 iterations in 152 ms. Result :sat
Minimization took 70 ms.
[2024-06-02 20:52:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:52] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-02 20:52:52] [INFO ] [Real]Added 45 Read/Feed constraints in 17 ms returned sat
[2024-06-02 20:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 20:52:52] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 20:52:52] [INFO ] [Nat]Added 45 Read/Feed constraints in 51 ms returned sat
[2024-06-02 20:52:52] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 21 ms.
[2024-06-02 20:52:52] [INFO ] Added : 0 causal constraints over 0 iterations in 42 ms. Result :sat
Minimization took 58 ms.
[2024-06-02 20:52:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:52:52] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-02 20:52:52] [INFO ] [Real]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-06-02 20:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:52:52] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 20:52:52] [INFO ] [Nat]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-06-02 20:52:52] [INFO ] Computed and/alt/rep : 125/473/125 causal constraints (skipped 186 transitions) in 20 ms.
[2024-06-02 20:52:53] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-02 20:52:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-02 20:52:53] [INFO ] Added : 26 causal constraints over 8 iterations in 267 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 344/344 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 127 transition count 341
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 121 transition count 327
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 121 transition count 327
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 121 transition count 324
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 118 transition count 317
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 117 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 117 transition count 315
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 28 place count 116 transition count 314
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 113 transition count 320
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 40 place count 113 transition count 314
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 49 place count 113 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 113 transition count 307
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 53 place count 112 transition count 305
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 55 place count 112 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 111 transition count 302
Applied a total of 56 rules in 110 ms. Remains 111 /127 variables (removed 16) and now considering 302/344 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 111/127 places, 302/344 transitions.
[2024-06-02 20:52:53] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
// Phase 1: matrix 273 rows 111 cols
[2024-06-02 20:52:53] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (57886 resets) in 1174 ms. (851 steps per ms)
FORMULA FireWire-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000002 steps (56704 resets) in 1628 ms. (2455 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 20:52:56] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:52:56] [INFO ] Invariant cache hit.
[2024-06-02 20:52:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:52:56] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-02 20:52:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:52:56] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 20:52:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:52:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 20:52:56] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 25 ms.
[2024-06-02 20:52:57] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:52:57] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:52:57] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 4 ms to minimize.
[2024-06-02 20:52:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 287 ms
[2024-06-02 20:52:57] [INFO ] Added : 59 causal constraints over 14 iterations in 655 ms. Result :sat
Minimization took 91 ms.
[2024-06-02 20:52:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:52:57] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:52:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:52:57] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-02 20:52:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 26 ms returned sat
[2024-06-02 20:52:57] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 20:52:57] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 3 ms to minimize.
[2024-06-02 20:52:57] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:52:57] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 6 ms to minimize.
[2024-06-02 20:52:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2024-06-02 20:52:57] [INFO ] Added : 38 causal constraints over 9 iterations in 428 ms. Result :sat
Minimization took 84 ms.
[2024-06-02 20:52:58] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 20:52:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2024-06-02 20:52:58] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 20:52:58] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:52:58] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:52:58] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:52:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 229 ms
[2024-06-02 20:52:58] [INFO ] Added : 45 causal constraints over 9 iterations in 407 ms. Result :sat
Minimization took 86 ms.
[2024-06-02 20:52:58] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Real]Added 42 Read/Feed constraints in 7 ms returned sat
[2024-06-02 20:52:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:52:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 20:52:58] [INFO ] [Nat]Added 42 Read/Feed constraints in 32 ms returned sat
[2024-06-02 20:52:59] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 18 ms.
[2024-06-02 20:52:59] [INFO ] Added : 22 causal constraints over 5 iterations in 103 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 111/111 places, 302/302 transitions.
[2024-06-02 20:52:59] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:52:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (58005 resets) in 1164 ms. (858 steps per ms)
BEST_FIRST walk for 4000001 steps (56075 resets) in 1630 ms. (2452 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-02 20:53:02] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:53:02] [INFO ] Invariant cache hit.
[2024-06-02 20:53:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:02] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-02 20:53:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:53:02] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-06-02 20:53:02] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 17 ms.
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:53:02] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:53:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2024-06-02 20:53:02] [INFO ] Added : 59 causal constraints over 14 iterations in 501 ms. Result :sat
Minimization took 90 ms.
[2024-06-02 20:53:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:02] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 20:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:03] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:53:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 26 ms returned sat
[2024-06-02 20:53:03] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 24 ms.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-06-02 20:53:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 243 ms
[2024-06-02 20:53:03] [INFO ] Added : 38 causal constraints over 9 iterations in 422 ms. Result :sat
Minimization took 83 ms.
[2024-06-02 20:53:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:03] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 20:53:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:03] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-02 20:53:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-06-02 20:53:03] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 16 ms.
[2024-06-02 20:53:04] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:53:04] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 3 ms to minimize.
[2024-06-02 20:53:04] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:53:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2024-06-02 20:53:04] [INFO ] Added : 45 causal constraints over 9 iterations in 398 ms. Result :sat
Minimization took 88 ms.
[2024-06-02 20:53:04] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:04] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 20:53:04] [INFO ] [Real]Added 42 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:53:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:53:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:53:04] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 20:53:04] [INFO ] [Nat]Added 42 Read/Feed constraints in 32 ms returned sat
[2024-06-02 20:53:04] [INFO ] Computed and/alt/rep : 125/501/125 causal constraints (skipped 146 transitions) in 19 ms.
[2024-06-02 20:53:04] [INFO ] Added : 22 causal constraints over 5 iterations in 102 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 16 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 111/111 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-06-02 20:53:04] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:53:04] [INFO ] Invariant cache hit.
[2024-06-02 20:53:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 20:53:04] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:53:04] [INFO ] Invariant cache hit.
[2024-06-02 20:53:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:53:05] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-06-02 20:53:05] [INFO ] Redundant transitions in 16 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-02 20:53:05] [INFO ] Flow matrix only has 273 transitions (discarded 29 similar events)
[2024-06-02 20:53:05] [INFO ] Invariant cache hit.
[2024-06-02 20:53:05] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 20:53:06] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:53:07] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
[2024-06-02 20:53:07] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 1/384 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 172 constraints, problems are : Problem set: 0 solved, 300 unsolved in 10041 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 273/383 variables, 110/129 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 300/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-02 20:53:29] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:53:29] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/384 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 474 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 111/111 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 13/13 constraints]
After SMT, in 40532ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 40545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40834 ms. Remains : 111/111 places, 302/302 transitions.
[2024-06-02 20:53:46] [INFO ] Flatten gal took : 130 ms
[2024-06-02 20:53:46] [INFO ] Flatten gal took : 35 ms
[2024-06-02 20:53:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17246859066820348525.gal : 13 ms
[2024-06-02 20:53:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13207728670919242539.prop : 1 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/ReachabilityCardinality17246859066820348525.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13207728670919242539.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13207728670919242539.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :20 after 31
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :31 after 61
RANDOM walk for 40000 steps (2362 resets) in 1927 ms. (20 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :61 after 288
BEST_FIRST walk for 40004 steps (598 resets) in 171 ms. (232 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :288 after 3816
BEST_FIRST walk for 40004 steps (586 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (539 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (531 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (588 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3816 after 9476
BEST_FIRST walk for 40003 steps (541 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (618 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (536 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :9476 after 96139
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.95859e+06,0.508548,19212,2,1987,15,56450,14,0,756,51277,0
Total reachable state count : 7958590

Verifying 8 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,6592,0.509283,19212,2,576,15,56450,14,0,758,51277,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,6592,0.509636,19212,2,576,15,56450,14,0,758,51277,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,3173,0.509918,19212,2,432,15,56450,14,0,759,51277,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,3173,0.510146,19212,2,432,15,56450,14,0,759,51277,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,3571,0.510397,19212,2,406,15,56450,14,0,760,51277,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,3571,0.51062,19212,2,406,15,56450,14,0,760,51277,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,7666,0.510894,19212,2,457,15,56450,14,0,761,51277,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,7666,0.511128,19212,2,457,15,56450,14,0,761,51277,0
Interrupted probabilistic random walk after 670923 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :2 out of 8
Probabilistic random walk after 670923 steps, saw 150889 distinct states, run finished after 3004 ms. (steps per millisecond=223 ) properties seen :2
FORMULA FireWire-PT-08-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-08-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-08-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-08-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 62384 ms.

BK_STOP 1717361629675

--------------------
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-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FireWire-PT-08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898900229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-08.tgz
mv FireWire-PT-08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;