About the Execution of 2024-gold for Murphy-COL-D3N050
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r139-smll-174876533200069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Murphy-COL-D3N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200069
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 20K May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-00
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-01
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-02
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-03
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-04
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-05
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-06
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-07
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-08
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-09
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-10
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-11
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-12
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-13
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-14
FORMULA_NAME Murphy-COL-D3N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748937829304
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D3N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-03 08:03:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 08:03:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:03:52] [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.
[2025-06-03 08:03:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 08:03:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1338 ms
[2025-06-03 08:03:53] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 28.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2025-06-03 08:03:53] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 7 ms.
[2025-06-03 08:03:53] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 6 cols
[2025-06-03 08:03:53] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 12, 4, 0, 200, 4] Max Struct:[+inf, +inf, 204, +inf, 204, 204]
[2025-06-03 08:03:53] [INFO ] Invariant cache hit.
[2025-06-03 08:03:53] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-03 08:03:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:03:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 08:03:53] [INFO ] [Real]Added 2 Read/Feed constraints in 7 ms returned sat
[2025-06-03 08:03:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:03:54] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:03:54] [INFO ] Added : 0 causal constraints over 0 iterations in 71 ms. Result :sat
Minimization took 122 ms.
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Added 2 Read/Feed constraints in 7 ms returned sat
[2025-06-03 08:03:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:03:54] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:03:54] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:03:54] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:03:54] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:03:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:03:54] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:03:54] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:03:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:03:54] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:03:54] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:03:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:03:54] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:03:54] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:03:54] [INFO ] [Real]Added 2 Read/Feed constraints in 8 ms returned sat
[2025-06-03 08:03:54] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:03:54] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:03:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:03:55] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:03:55] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 12, 4, 0, 200, 4] Max Struct:[+inf, +inf, 204, +inf, 204, 204]
Arc [0:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2025-06-03 08:03:55] [INFO ] Unfolded HLPN to a Petri net with 24 places and 28 transitions 108 arcs in 42 ms.
[2025-06-03 08:03:55] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 12, 4, 0, 200, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 12, 4, 0, 200, 4] Max Struct:[+inf, +inf, 204, +inf, 204, 204]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 12, 4, 0, 200, 4] Max Struct:[+inf, +inf, 204, +inf, 204, 204]
// Phase 1: matrix 28 rows 24 cols
[2025-06-03 08:03:55] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 12, 4, 0, 200, 4] Max Struct:[+inf, +inf, 204, +inf, 204, 204]
RANDOM walk for 10015 steps (2 resets) in 66 ms. (149 steps per ms)
FORMULA Murphy-COL-D3N050-UpperBounds-15 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D3N050-UpperBounds-07 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D3N050-UpperBounds-08 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D3N050-UpperBounds-12 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D3N050-UpperBounds-04 204 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 130 ms. (305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
[2025-06-03 08:03:55] [INFO ] Invariant cache hit.
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:03:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-03 08:03:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:03:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2025-06-03 08:03:55] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:03:55] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:03:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:03:55] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:03:55] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-03 08:03:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:03:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:03:55] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 16 ms to minimize.
[2025-06-03 08:03:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2025-06-03 08:03:56] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-03 08:03:56] [INFO ] Added : 3 causal constraints over 1 iterations in 70 ms. Result :sat
Minimization took 11 ms.
[2025-06-03 08:03:56] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-03 08:03:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:03:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:03:56] [INFO ] [Real]Added 8 Read/Feed constraints in 17 ms returned sat
[2025-06-03 08:03:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:03:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:03:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:03:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 08:03:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2025-06-03 08:03:56] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:03:56] [INFO ] Added : 11 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 26 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2025-06-03 08:03:56] [INFO ] Invariant cache hit.
[2025-06-03 08:03:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 735 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :[4, 12, 8, 200]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
[2025-06-03 08:03:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
RANDOM walk for 1000000 steps (2 resets) in 706 ms. (1414 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2518 ms. (1587 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
[2025-06-03 08:04:00] [INFO ] Invariant cache hit.
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:04:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:04:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:04:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:04:00] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:04:00] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:04:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:00] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:04:00] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:04:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:04:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:04:01] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
[2025-06-03 08:04:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-03 08:04:01] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:04:01] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2025-06-03 08:04:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:01] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:01] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:04:01] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:01] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-03 08:04:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:04:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:01] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:04:01] [INFO ] Added : 11 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:04:01] [INFO ] Invariant cache hit.
[2025-06-03 08:04:01] [INFO ] Implicit Places using invariants in 63 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 72 ms. Remains : 20/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :[4, 12, 8, 200]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
// Phase 1: matrix 28 rows 20 cols
[2025-06-03 08:04:01] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
RANDOM walk for 1000012 steps (2 resets) in 715 ms. (1396 steps per ms)
BEST_FIRST walk for 4000001 steps (8 resets) in 2030 ms. (1969 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
[2025-06-03 08:04:04] [INFO ] Invariant cache hit.
[2025-06-03 08:04:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:04:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:04:04] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:04] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-03 08:04:04] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:04:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:04] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:04:04] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:04:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:04] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:04:04] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2025-06-03 08:04:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:04:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:04:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:04] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:04:04] [INFO ] Added : 8 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
Support contains 16 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2025-06-03 08:04:04] [INFO ] Invariant cache hit.
[2025-06-03 08:04:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-03 08:04:04] [INFO ] Invariant cache hit.
[2025-06-03 08:04:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:04:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2025-06-03 08:04:04] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 08:04:04] [INFO ] Invariant cache hit.
[2025-06-03 08:04:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 827ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 830ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 934 ms. Remains : 20/20 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :[4, 12, 8, 200]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 12, 8, 202] Max Struct:[+inf, +inf, +inf, 204]
[2025-06-03 08:04:05] [INFO ] Flatten gal took : 52 ms
[2025-06-03 08:04:05] [INFO ] Flatten gal took : 21 ms
RANDOM walk for 40079 steps (8 resets) in 708 ms. (56 steps per ms) remains 5/5 properties
[2025-06-03 08:04:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8801720571680937496.gal : 21 ms
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 5/5 properties
[2025-06-03 08:04:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7547228436240716270.prop : 4 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/ReachabilityCardinality8801720571680937496.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7547228436240716270.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 ...328
Loading property file /tmp/ReachabilityCardinality7547228436240716270.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :90 after 192
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :30630 after 243534
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 237381 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 5
Probabilistic random walk after 237381 steps, saw 160425 distinct states, run finished after 3008 ms. (steps per millisecond=78 ) properties seen :0
[2025-06-03 08:04:09] [INFO ] Invariant cache hit.
[2025-06-03 08:04:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-03 08:04:09] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 2 ms to minimize.
[2025-06-03 08:04:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
[2025-06-03 08:04:09] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-06-03 08:04:09] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-03 08:04:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem MAX3 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/48 variables, 20/26 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 8/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 34 constraints, problems are : Problem set: 1 solved, 4 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/48 variables, 20/26 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 8/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MIN3 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 4/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 38 constraints, problems are : Problem set: 2 solved, 3 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 524ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 12 transition count 16
Applied a total of 5 rules in 11 ms. Remains 12 /20 variables (removed 8) and now considering 16/28 (removed 12) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 12 cols
[2025-06-03 08:04:09] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:04:09] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/28 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 16 constraints, problems are : Problem set: 0 solved, 12 unsolved in 142 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/28 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 154 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 12/20 places, 16/28 transitions.
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
Probably explored full state space saw : 1296 states, properties seen :0
Probabilistic random walk after 8208 steps, saw 1296 distinct states, run finished after 68 ms. (steps per millisecond=120 ) properties seen :0
Explored full state space saw : 1296 states, properties seen :0
Exhaustive walk after 8208 steps, saw 1296 distinct states, run finished after 57 ms. (steps per millisecond=144 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-COL-D3N050-UpperBounds-13 202 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-14 202 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-09 202 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-10 8 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-05 8 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-02 12 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-03 12 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-01 12 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-06 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-11 4 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D3N050-UpperBounds-00 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 18993 ms.
BK_STOP 1748937850703
--------------------
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="Murphy-COL-D3N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Murphy-COL-D3N050, 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 r139-smll-174876533200069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D3N050.tgz
mv Murphy-COL-D3N050 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.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 '
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 ;