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.r246-tall-171654351200245.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 Murphy-COL-D1N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351200245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.4K Apr 11 22:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 11 22:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 23:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20K May 18 16:43 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 Murphy-COL-D1N010-UpperBounds-00
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-01
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-02
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-03
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-04
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-05
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-06
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-07
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-08
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-09
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-10
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-11
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-12
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-13
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-14
FORMULA_NAME Murphy-COL-D1N010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716649915194

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D1N010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-25 15:11:56] [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 15:11:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:11:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 15:11:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 15:11:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 570 ms
[2024-05-25 15:11:57] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 12 PT places and 14.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2024-05-25 15:11:57] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2024-05-25 15:11:57] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 15:11:57] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
[2024-05-25 15:11:57] [INFO ] Invariant cache hit.
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 15:11:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 15:11:57] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 15:11:57] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 15:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:11:57] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 15:11:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-25 15:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:11:57] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:11:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:11:57] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:11:57] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 15:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 4/9/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:11:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
Arc [0:1*[(MOD (ADD $x 1) 2)]] contains successor/predecessor on variables of sort CD
[2024-05-25 15:11:57] [INFO ] Unfolded HLPN to a Petri net with 12 places and 14 transitions 54 arcs in 10 ms.
[2024-05-25 15:11:57] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
Current structural bounds on expressions (Before main loop) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
// Phase 1: matrix 14 rows 12 cols
[2024-05-25 15:11:57] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 20, 0, 6, 2] Max Struct:[22, +inf, 22, +inf, +inf, 22]
RANDOM walk for 10004 steps (2 resets) in 20 ms. (476 steps per ms)
FORMULA Murphy-COL-D1N010-UpperBounds-14 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D1N010-UpperBounds-15 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D1N010-UpperBounds-12 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D1N010-UpperBounds-13 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D1N010-UpperBounds-00 22 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2024-05-25 15:11:57] [INFO ] Invariant cache hit.
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 15:11:57] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 15:11:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:11:57] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-25 15:11:57] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 15:11:57] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Real]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-05-25 15:11:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-05-25 15:11:58] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 41 ms to minimize.
[2024-05-25 15:11:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-25 15:11:58] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 15:11:58] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:11:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-25 15:11:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2024-05-25 15:11:58] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 15:11:58] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:11:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:11:58] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:11:58] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 15:11:58] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 7 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Running 8 sub problems to find dead transitions.
[2024-05-25 15:11:58] [INFO ] Invariant cache hit.
[2024-05-25 15:11:58] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/10 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/24 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/26 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 27 constraints, problems are : Problem set: 0 solved, 8 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 372 ms. Remains : 12/12 places, 14/14 transitions.
Found an invariant !
This invariant on transitions {7=1, 9=1, 13=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {6=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :[4, 20, 2, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2024-05-25 15:11:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
RANDOM walk for 1000007 steps (2 resets) in 577 ms. (1730 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1376 ms. (2904 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2024-05-25 15:12:00] [INFO ] Invariant cache hit.
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 15:12:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:12:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:12:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:12:00] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-25 15:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2024-05-25 15:12:00] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:12:00] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:12:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:12:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-25 15:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-25 15:12:00] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:12:00] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-25 15:12:00] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 15:12:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:12:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 15:12:01] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 15:12:01] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:12:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 0 ms returned sat
[2024-05-25 15:12:01] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 15:12:01] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 15:12:01] [INFO ] Invariant cache hit.
[2024-05-25 15:12:01] [INFO ] Implicit Places using invariants in 33 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38 ms. Remains : 10/12 places, 14/14 transitions.
Found an invariant !
This invariant on transitions {7=1, 9=1, 13=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {6=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :[4, 20, 2, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
// Phase 1: matrix 14 rows 10 cols
[2024-05-25 15:12:01] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 375 ms. (2659 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 980 ms. (4077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2024-05-25 15:12:02] [INFO ] Invariant cache hit.
[2024-05-25 15:12:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 15:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:12:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 15:12:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:12:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:12:02] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:12:02] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 15:12:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:12:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-25 15:12:02] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-25 15:12:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-25 15:12:02] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:12:02] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 15:12:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 15:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:12:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:12:02] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:12:02] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 15:12:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 15:12:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:12:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 15:12:02] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-25 15:12:02] [INFO ] Computed and/alt/rep : 8/20/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 15:12:02] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
Support contains 8 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 10/10 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 15:12:02] [INFO ] Invariant cache hit.
[2024-05-25 15:12:02] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 15:12:02] [INFO ] Invariant cache hit.
[2024-05-25 15:12:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 15:12:02] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-25 15:12:02] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-25 15:12:02] [INFO ] Invariant cache hit.
[2024-05-25 15:12:02] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/22 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/24 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 23 constraints, problems are : Problem set: 0 solved, 8 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 10/10 places, 14/14 transitions.
Found an invariant !
This invariant on transitions {7=1, 9=1, 13=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {6=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :[4, 20, 2, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 20, 2, 6] Max Struct:[+inf, 22, +inf, +inf]
[2024-05-25 15:12:03] [INFO ] Flatten gal took : 27 ms
[2024-05-25 15:12:03] [INFO ] Flatten gal took : 7 ms
[2024-05-25 15:12:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2964856734333269946.gal : 4 ms
[2024-05-25 15:12:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16570154940343365021.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/ReachabilityCardinality2964856734333269946.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16570154940343365021.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40002 steps (8 resets) in 722 ms. (55 steps per ms) remains 5/5 properties
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/ReachabilityCardinality16570154940343365021.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 264
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :264 after 874
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :874 after 4324
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :12156 after 12588
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,39780,0.030318,4068,2,295,12,2674,11,0,76,2606,0
Total reachable state count : 39780

Verifying 5 reachability properties.
Invariant property MIN0 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
MIN0,0,0.030791,4068,1,0,12,2674,11,0,80,2606,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

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,0,0.031918,4328,1,0,12,2674,11,0,100,2606,0
Invariant property MIN1 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
MIN1,0,0.033074,4328,1,0,12,2674,11,0,120,2606,0
Invariant property MIN2 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
MIN2,0,0.033395,4328,1,0,12,2674,11,0,122,2606,0
Invariant property MIN3 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
MIN3,0,0.033837,4328,1,0,12,2674,11,0,126,2606,0
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
Probably explored full state space saw : 39780 states, properties seen :0
Probabilistic random walk after 307764 steps, saw 39780 distinct states, run finished after 793 ms. (steps per millisecond=388 ) properties seen :0
Explored full state space saw : 39780 states, properties seen :0
Exhaustive walk after 307764 steps, saw 39780 distinct states, run finished after 497 ms. (steps per millisecond=619 ) properties seen :0
FORMULA Murphy-COL-D1N010-UpperBounds-10 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-09 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-11 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-08 20 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-02 20 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-05 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-06 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-07 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D1N010-UpperBounds-01 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8526 ms.

BK_STOP 1716649924949

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Murphy-COL-D1N010"
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 Murphy-COL-D1N010, 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 r246-tall-171654351200245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D1N010.tgz
mv Murphy-COL-D1N010 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 ;