About the Execution of 2024-gold for Murphy-COL-D4N025
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-174876533200070.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-D4N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200070
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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-D4N025-UpperBounds-00
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-01
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-02
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-03
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-04
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-05
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-06
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-07
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-08
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-09
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-10
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-11
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-12
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-13
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-14
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748937864023
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-D4N025
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-03 08:04:26] [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:04:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:04:27] [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:04:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 08:04:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1091 ms
[2025-06-03 08:04:28] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2025-06-03 08:04:28] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 8 ms.
[2025-06-03 08:04:28] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 6 cols
[2025-06-03 08:04:28] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 5, 5, 125, 15, 0] Max Struct:[+inf, 130, 130, 130, +inf, +inf]
[2025-06-03 08:04:28] [INFO ] Invariant cache hit.
[2025-06-03 08:04:28] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-06-03 08:04:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:04:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 08:04:28] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:04:28] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2025-06-03 08:04:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-03 08:04:29] [INFO ] Added : 0 causal constraints over 0 iterations in 62 ms. Result :sat
Minimization took 36 ms.
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using 2 positive place invariants in 26 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:04:29] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2025-06-03 08:04:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:04:29] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:04:29] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 08:04:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:04:29] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:04:29] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:04:29] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:04:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:04:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:04:29] [INFO ] Added : 0 causal constraints over 0 iterations in 36 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 5, 5, 125, 15, 0] Max Struct:[+inf, 130, 130, 130, +inf, +inf]
Arc [0:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2025-06-03 08:04:29] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 34 ms.
[2025-06-03 08:04:29] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 5, 5, 125, 15, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 5, 5, 125, 15, 0] Max Struct:[+inf, 130, 130, 130, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 5, 5, 125, 15, 0] Max Struct:[+inf, 130, 130, 130, +inf, +inf]
// Phase 1: matrix 35 rows 30 cols
[2025-06-03 08:04:29] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 5, 5, 125, 15, 0] Max Struct:[+inf, 130, 130, 130, +inf, +inf]
RANDOM walk for 10017 steps (2 resets) in 48 ms. (204 steps per ms)
FORMULA Murphy-COL-D4N025-UpperBounds-13 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-14 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-03 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-02 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-04 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-09 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-01 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
[2025-06-03 08:04:29] [INFO ] Invariant cache hit.
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-03 08:04:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:04:30] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:04:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:30] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 17 ms to minimize.
[2025-06-03 08:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-06-03 08:04:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:04:30] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:04:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 19 ms.
[2025-06-03 08:04:30] [INFO ] Added : 3 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 22 ms.
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 12 ms returned sat
[2025-06-03 08:04:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 20 ms.
[2025-06-03 08:04:30] [INFO ] Added : 3 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:04:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-03 08:04:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:04:30] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
[2025-06-03 08:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-06-03 08:04:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-03 08:04:31] [INFO ] Added : 2 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 16 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2025-06-03 08:04:31] [INFO ] Invariant cache hit.
[2025-06-03 08:04:31] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1393ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1450 ms. Remains : 30/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :[10, 125, 15, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
[2025-06-03 08:04:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1153 ms. (866 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2973 ms. (1344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
[2025-06-03 08:04:36] [INFO ] Invariant cache hit.
[2025-06-03 08:04:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 08:04:36] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 08:04:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:04:36] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:04:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:37] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2025-06-03 08:04:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2025-06-03 08:04:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:04:37] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:04:37] [INFO ] Added : 3 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 14 ms.
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:04:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:04:37] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 13 ms.
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:04:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:37] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
[2025-06-03 08:04:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2025-06-03 08:04:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:04:37] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:04:37] [INFO ] Invariant cache hit.
[2025-06-03 08:04:37] [INFO ] Implicit Places using invariants in 49 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 56 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60 ms. Remains : 25/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :[10, 125, 15, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
// Phase 1: matrix 35 rows 25 cols
[2025-06-03 08:04:37] [INFO ] Computed 1 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
RANDOM walk for 1000008 steps (2 resets) in 896 ms. (1114 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2297 ms. (1740 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
[2025-06-03 08:04:40] [INFO ] Invariant cache hit.
[2025-06-03 08:04:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:04:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:04:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:04:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:41] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:04:41] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:04:41] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:04:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:04:41] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:04:41] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2025-06-03 08:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-03 08:04:41] [INFO ] Added : 8 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 24 ms.
[2025-06-03 08:04:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:04:41] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:04:41] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 13 ms.
[2025-06-03 08:04:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:04:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:04:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:04:41] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:04:41] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2025-06-03 08:04:41] [INFO ] Invariant cache hit.
[2025-06-03 08:04:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 08:04:41] [INFO ] Invariant cache hit.
[2025-06-03 08:04:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:04:41] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2025-06-03 08:04:41] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 08:04:41] [INFO ] Invariant cache hit.
[2025-06-03 08:04:41] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 930ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 932ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1049 ms. Remains : 25/25 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :[10, 125, 15, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 128, 15, 5] Max Struct:[+inf, 130, +inf, +inf]
[2025-06-03 08:04:42] [INFO ] Flatten gal took : 56 ms
[2025-06-03 08:04:42] [INFO ] Flatten gal took : 35 ms
RANDOM walk for 40007 steps (8 resets) in 905 ms. (44 steps per ms) remains 5/5 properties
[2025-06-03 08:04:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17887399169406255585.gal : 24 ms
[2025-06-03 08:04:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4734713381932640271.prop : 2 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/ReachabilityCardinality17887399169406255585.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4734713381932640271.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 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/ReachabilityCardinality4734713381932640271.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
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
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 3822
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :3822 after 34242
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :34242 after 6.33906e+07
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :6.33906e+07 after 1.93336e+11
Interrupted probabilistic random walk after 273024 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 5
Probabilistic random walk after 273024 steps, saw 188180 distinct states, run finished after 3006 ms. (steps per millisecond=90 ) properties seen :0
[2025-06-03 08:04:46] [INFO ] Invariant cache hit.
[2025-06-03 08:04:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-03 08:04:46] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2025-06-03 08:04:46] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2025-06-03 08:04:46] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2025-06-03 08:04:46] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2025-06-03 08:04:46] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 41 constraints, problems are : Problem set: 1 solved, 4 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 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/20 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2025-06-03 08:04:46] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2025-06-03 08:04:46] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2025-06-03 08:04:46] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 35/60 variables, 25/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 10/44 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MIN1 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 4/48 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 48 constraints, problems are : Problem set: 2 solved, 3 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 408ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 251 ms.
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.11 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 22 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 15 cols
[2025-06-03 08:04:47] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:04:47] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 20 constraints, problems are : Problem set: 0 solved, 15 unsolved in 223 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 261 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 505ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 15/25 places, 20/35 transitions.
RANDOM walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
Probably explored full state space saw : 7776 states, properties seen :0
Probabilistic random walk after 59616 steps, saw 7776 distinct states, run finished after 241 ms. (steps per millisecond=247 ) properties seen :0
Explored full state space saw : 7776 states, properties seen :0
Exhaustive walk after 59616 steps, saw 7776 distinct states, run finished after 177 ms. (steps per millisecond=336 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-COL-D4N025-UpperBounds-10 5 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N025-UpperBounds-08 15 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N025-UpperBounds-11 15 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N025-UpperBounds-15 15 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N025-UpperBounds-07 15 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N025-UpperBounds-05 128 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N025-UpperBounds-06 10 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N025-UpperBounds-12 10 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N025-UpperBounds-00 10 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 21268 ms.
BK_STOP 1748937888271
--------------------
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-D4N025"
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-D4N025, 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-174876533200070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D4N025.tgz
mv Murphy-COL-D4N025 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 ;