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.r224-tall-171649613100597.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 Medical-PT-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649613100597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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 Medical-PT-22-UpperBounds-00
FORMULA_NAME Medical-PT-22-UpperBounds-01
FORMULA_NAME Medical-PT-22-UpperBounds-02
FORMULA_NAME Medical-PT-22-UpperBounds-03
FORMULA_NAME Medical-PT-22-UpperBounds-04
FORMULA_NAME Medical-PT-22-UpperBounds-05
FORMULA_NAME Medical-PT-22-UpperBounds-06
FORMULA_NAME Medical-PT-22-UpperBounds-07
FORMULA_NAME Medical-PT-22-UpperBounds-08
FORMULA_NAME Medical-PT-22-UpperBounds-09
FORMULA_NAME Medical-PT-22-UpperBounds-10
FORMULA_NAME Medical-PT-22-UpperBounds-11
FORMULA_NAME Medical-PT-22-UpperBounds-12
FORMULA_NAME Medical-PT-22-UpperBounds-13
FORMULA_NAME Medical-PT-22-UpperBounds-14
FORMULA_NAME Medical-PT-22-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716620221325

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-25 06:57:02] [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-05-25 06:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 06:57:02] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2024-05-25 06:57:02] [INFO ] Transformed 312 places.
[2024-05-25 06:57:02] [INFO ] Transformed 5431 transitions.
[2024-05-25 06:57:02] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 242 places in 23 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-22-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-25 06:57:02] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2024-05-25 06:57:02] [INFO ] Computed 10 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 22, 1, 1, 1, 22]
RANDOM walk for 10002 steps (29 resets) in 29 ms. (333 steps per ms)
FORMULA Medical-PT-22-UpperBounds-15 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-22-UpperBounds-10 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-22-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (38 resets) in 54 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 0, 0, 147, 0] Max Struct:[+inf, +inf, +inf, +inf, 1]
[2024-05-25 06:57:03] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-25 06:57:03] [INFO ] Invariant cache hit.
[2024-05-25 06:57:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-25 06:57:03] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-25 06:57:03] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-25 06:57:03] [INFO ] [Real]Added 56 Read/Feed constraints in 11 ms returned sat
[2024-05-25 06:57:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:03] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-25 06:57:03] [INFO ] [Nat]Added 56 Read/Feed constraints in 16 ms returned sat
[2024-05-25 06:57:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 6 ms to minimize.
[2024-05-25 06:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-25 06:57:03] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 19 ms.
[2024-05-25 06:57:03] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-25 06:57:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-25 06:57:03] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-25 06:57:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 196 ms
[2024-05-25 06:57:03] [INFO ] Added : 47 causal constraints over 11 iterations in 380 ms. Result :sat
Minimization took 46 ms.
[2024-05-25 06:57:03] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 06:57:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-25 06:57:03] [INFO ] [Real]Added 56 Read/Feed constraints in 8 ms returned sat
[2024-05-25 06:57:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:03] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-25 06:57:04] [INFO ] [Nat]Added 56 Read/Feed constraints in 12 ms returned sat
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-25 06:57:04] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1059 ms
[2024-05-25 06:57:05] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 17 ms.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-25 06:57:05] [INFO ] Added : 42 causal constraints over 9 iterations in 199 ms. Result :sat
Minimization took 53 ms.
[2024-05-25 06:57:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:05] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-25 06:57:05] [INFO ] [Real]Added 56 Read/Feed constraints in 8 ms returned sat
[2024-05-25 06:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:05] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-25 06:57:05] [INFO ] [Nat]Added 56 Read/Feed constraints in 9 ms returned sat
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-25 06:57:05] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1135 ms
[2024-05-25 06:57:06] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 16 ms.
[2024-05-25 06:57:06] [INFO ] Added : 32 causal constraints over 7 iterations in 99 ms. Result :sat
Minimization took 46 ms.
[2024-05-25 06:57:06] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 06:57:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-25 06:57:06] [INFO ] [Real]Added 56 Read/Feed constraints in 6 ms returned sat
[2024-05-25 06:57:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 06:57:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-25 06:57:06] [INFO ] [Nat]Added 56 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-25 06:57:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 113 ms
[2024-05-25 06:57:07] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 16 ms.
[2024-05-25 06:57:07] [INFO ] Added : 45 causal constraints over 10 iterations in 152 ms. Result :sat
Minimization took 44 ms.
[2024-05-25 06:57:07] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:07] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-25 06:57:07] [INFO ] [Real]Added 56 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:07] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-25 06:57:07] [INFO ] [Nat]Added 56 Read/Feed constraints in 8 ms returned sat
[2024-05-25 06:57:07] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-25 06:57:07] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-25 06:57:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2024-05-25 06:57:07] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 16 ms.
[2024-05-25 06:57:07] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-25 06:57:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-25 06:57:07] [INFO ] Added : 52 causal constraints over 11 iterations in 209 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 0, 0, 147, 0] Max Struct:[+inf, +inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 0, 0, 152, 0] Max Struct:[+inf, +inf, +inf, +inf, 1]
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 67 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 42 ms. Remains 61 /69 variables (removed 8) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 61/69 places, 222/227 transitions.
[2024-05-25 06:57:07] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Found an invariant !
This invariant on transitions {1=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :[2, 0, 0, 2147483647, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[13, 0, 0, +inf, 0] Max Struct:[+inf, +inf, +inf, +inf, 1]
[2024-05-25 06:57:08] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-05-25 06:57:08] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[13, 0, 0, +inf, 0] Max Struct:[+inf, +inf, +inf, +inf, 1]
RANDOM walk for 1000008 steps (2 resets) in 375 ms. (2659 steps per ms)
FORMULA Medical-PT-22-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4000003 steps (8 resets) in 1686 ms. (2371 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
[2024-05-25 06:57:10] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-25 06:57:10] [INFO ] Invariant cache hit.
[2024-05-25 06:57:10] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-25 06:57:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-25 06:57:10] [INFO ] [Real]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-05-25 06:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 06:57:10] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-25 06:57:10] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-25 06:57:10] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 15 ms.
[2024-05-25 06:57:10] [INFO ] Added : 53 causal constraints over 11 iterations in 146 ms. Result :sat
Minimization took 42 ms.
[2024-05-25 06:57:10] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:10] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-25 06:57:10] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-05-25 06:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:10] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-25 06:57:10] [INFO ] [Nat]Added 57 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:10] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-25 06:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-25 06:57:10] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 16 ms.
[2024-05-25 06:57:10] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-25 06:57:10] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-25 06:57:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-05-25 06:57:10] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-25 06:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-25 06:57:11] [INFO ] Added : 31 causal constraints over 9 iterations in 335 ms. Result :sat
Minimization took 46 ms.
[2024-05-25 06:57:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-25 06:57:11] [INFO ] [Real]Added 57 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:11] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-25 06:57:11] [INFO ] [Nat]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-05-25 06:57:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-25 06:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-25 06:57:11] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 11 ms.
[2024-05-25 06:57:11] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-25 06:57:11] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-05-25 06:57:11] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-25 06:57:11] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 06:57:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 235 ms
[2024-05-25 06:57:11] [INFO ] Added : 19 causal constraints over 7 iterations in 334 ms. Result :sat
Minimization took 35 ms.
[2024-05-25 06:57:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:11] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-25 06:57:11] [INFO ] [Real]Added 57 Read/Feed constraints in 6 ms returned sat
[2024-05-25 06:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 06:57:11] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-25 06:57:11] [INFO ] [Nat]Added 57 Read/Feed constraints in 6 ms returned sat
[2024-05-25 06:57:11] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 10 ms.
[2024-05-25 06:57:11] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-25 06:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-25 06:57:11] [INFO ] Added : 28 causal constraints over 7 iterations in 151 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 61/61 places, 222/222 transitions.
[2024-05-25 06:57:11] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Found an invariant !
This invariant on transitions {1=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :[3, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[13, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
[2024-05-25 06:57:12] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-25 06:57:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[13, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
RANDOM walk for 1000010 steps (2 resets) in 291 ms. (3424 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 1637 ms. (2442 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
[2024-05-25 06:57:14] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-25 06:57:14] [INFO ] Invariant cache hit.
[2024-05-25 06:57:14] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-25 06:57:14] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-25 06:57:14] [INFO ] [Real]Added 57 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Nat]Added 57 Read/Feed constraints in 9 ms returned sat
[2024-05-25 06:57:14] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 11 ms.
[2024-05-25 06:57:14] [INFO ] Added : 46 causal constraints over 10 iterations in 111 ms. Result :sat
Minimization took 38 ms.
[2024-05-25 06:57:14] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Real]Added 57 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Nat]Added 57 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:14] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-25 06:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-25 06:57:14] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 11 ms.
[2024-05-25 06:57:14] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 06:57:14] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-25 06:57:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2024-05-25 06:57:14] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-25 06:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-25 06:57:14] [INFO ] Added : 31 causal constraints over 9 iterations in 331 ms. Result :sat
Minimization took 47 ms.
[2024-05-25 06:57:14] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-25 06:57:14] [INFO ] [Real]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-05-25 06:57:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:15] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-25 06:57:15] [INFO ] [Nat]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-05-25 06:57:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-25 06:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-25 06:57:15] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 12 ms.
[2024-05-25 06:57:15] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-25 06:57:15] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-25 06:57:15] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-25 06:57:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-25 06:57:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 234 ms
[2024-05-25 06:57:15] [INFO ] Added : 19 causal constraints over 7 iterations in 327 ms. Result :sat
Minimization took 35 ms.
[2024-05-25 06:57:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-25 06:57:15] [INFO ] [Real]Added 57 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 06:57:15] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-25 06:57:15] [INFO ] [Nat]Added 57 Read/Feed constraints in 7 ms returned sat
[2024-05-25 06:57:15] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 10 ms.
[2024-05-25 06:57:15] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-25 06:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-25 06:57:15] [INFO ] Added : 28 causal constraints over 7 iterations in 139 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-25 06:57:15] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-25 06:57:15] [INFO ] Invariant cache hit.
[2024-05-25 06:57:15] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-25 06:57:15] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-25 06:57:15] [INFO ] Invariant cache hit.
[2024-05-25 06:57:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-25 06:57:15] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-25 06:57:15] [INFO ] Redundant transitions in 8 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-25 06:57:15] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-25 06:57:15] [INFO ] Invariant cache hit.
[2024-05-25 06:57:15] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-25 06:57:16] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 127 constraints, problems are : Problem set: 0 solved, 221 unsolved in 4067 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 221/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-05-25 06:57:21] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-25 06:57:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-25 06:57:22] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-05-25 06:57:23] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/352 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/352 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/352 constraints. Problems are: Problem set: 43 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 352 constraints, problems are : Problem set: 43 solved, 178 unsolved in 7053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 5/5 constraints]
After SMT, in 11331ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 11341ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 179/222 transitions.
Reduce places removed 9 places and 65 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 114
Reduce places removed 6 places and 31 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 46 transition count 83
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 44 transition count 72
Reduce places removed 3 places and 12 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 20 place count 41 transition count 60
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 21 place count 40 transition count 56
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 21 rules in 9 ms. Remains 40 /61 variables (removed 21) and now considering 56/179 (removed 123) transitions.
[2024-05-25 06:57:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 40 cols
[2024-05-25 06:57:27] [INFO ] Computed 11 invariants in 3 ms
[2024-05-25 06:57:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 06:57:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:27] [INFO ] Invariant cache hit.
[2024-05-25 06:57:27] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-25 06:57:27] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 40/61 places, 56/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11665 ms. Remains : 40/61 places, 56/222 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA Medical-PT-22-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-22-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 06:57:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
[2024-05-25 06:57:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2024-05-25 06:57:27] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
RANDOM walk for 1000001 steps (2 resets) in 237 ms. (4201 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 309 ms. (3225 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
[2024-05-25 06:57:27] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:28] [INFO ] Invariant cache hit.
[2024-05-25 06:57:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 06:57:28] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-25 06:57:28] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-25 06:57:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 06:57:28] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-25 06:57:28] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-25 06:57:28] [INFO ] Added : 12 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-25 06:57:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:28] [INFO ] Invariant cache hit.
[2024-05-25 06:57:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-25 06:57:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:28] [INFO ] Invariant cache hit.
[2024-05-25 06:57:28] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-25 06:57:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-25 06:57:28] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-25 06:57:28] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:28] [INFO ] Invariant cache hit.
[2024-05-25 06:57:28] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-25 06:57:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 128 constraints, problems are : Problem set: 0 solved, 55 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
After SMT, in 1143ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1239 ms. Remains : 37/37 places, 56/56 transitions.
[2024-05-25 06:57:29] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
RANDOM walk for 40015 steps (8 resets) in 116 ms. (342 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
[2024-05-25 06:57:29] [INFO ] Flatten gal took : 50 ms
[2024-05-25 06:57:29] [INFO ] Flatten gal took : 20 ms
[2024-05-25 06:57:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8608397399052124960.gal : 12 ms
[2024-05-25 06:57:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16041254457314088726.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/ReachabilityCardinality8608397399052124960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16041254457314088726.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 ...329
Loading property file /tmp/ReachabilityCardinality16041254457314088726.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 46
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :46 after 1631
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1631 after 6116
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6116 after 15017
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15017 after 32750
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :32750 after 68147
Interrupted probabilistic random walk after 2530145 steps, run timeout after 3003 ms. (steps per millisecond=842 ) properties seen :0 out of 1
Probabilistic random walk after 2530145 steps, saw 1479356 distinct states, run finished after 3006 ms. (steps per millisecond=841 ) properties seen :0
[2024-05-25 06:57:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:32] [INFO ] Invariant cache hit.
[2024-05-25 06:57:32] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 23/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/28 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/65 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/65 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/65 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/87 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/87 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 23/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/28 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/28 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/28 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/65 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/65 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/65 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/65 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/65 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 22/87 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/87 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/87 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 185 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=92 )
Parikh walk visited 1 properties in 5 ms.
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:[14, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1]
Starting property specific reduction for Medical-PT-22-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-25 06:57:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2024-05-25 06:57:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:32] [INFO ] Invariant cache hit.
[2024-05-25 06:57:32] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 06:57:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 06:57:32] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-25 06:57:32] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-25 06:57:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 06:57:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-25 06:57:32] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 06:57:32] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-25 06:57:32] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-25 06:57:32] [INFO ] Added : 12 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 37/37 places, 56/56 transitions.
[2024-05-25 06:57:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-25 06:57:32] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-25 06:57:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000014 steps (2 resets) in 265 ms. (3759 steps per ms)
FORMULA Medical-PT-22-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-25 06:57:33] [INFO ] Flatten gal took : 11 ms
[2024-05-25 06:57:33] [INFO ] Flatten gal took : 12 ms
[2024-05-25 06:57:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4352160517598883798.gal : 6 ms
[2024-05-25 06:57:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8857583962686345792.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/ReachabilityCardinality4352160517598883798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8857583962686345792.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 ...328
Loading property file /tmp/ReachabilityCardinality8857583962686345792.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Medical-PT-22-UpperBounds-00 in 513 ms.
[2024-05-25 06:57:33] [INFO ] Flatten gal took : 6 ms
Total runtime 30798 ms.

BK_STOP 1716620253222

--------------------
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="Medical-PT-22"
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 Medical-PT-22, 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 r224-tall-171649613100597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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