About the Execution of 2024-gold for JoinFreeModules-PT-0010
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.r125-tall-174876435700053.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 JoinFreeModules-PT-0010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 128K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 31K 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 JoinFreeModules-PT-0010-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748774315262
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:38:36] [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-01 10:38:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:38:36] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2025-06-01 10:38:36] [INFO ] Transformed 51 places.
[2025-06-01 10:38:36] [INFO ] Transformed 81 transitions.
[2025-06-01 10:38:36] [INFO ] Parsed PT model containing 51 places and 81 transitions and 232 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 1, 0, 10, 1, 10, 1, 0, 2, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 1, 0, 10, 1, 10, 1, 0, 2, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 81 rows 50 cols
[2025-06-01 10:38:36] [INFO ] Computed 10 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 1, 0, 10, 1, 10, 1, 0, 2, 0, 0, 0, 0] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
RANDOM walk for 10000 steps (2 resets) in 50 ms. (196 steps per ms)
FORMULA JoinFreeModules-PT-0010-UpperBounds-12 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-10 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150014 steps (30 resets) in 167 ms. (892 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 10, 11, 11, 11, 12, 10, 11, 10, 11, 11, 11, 11, 11] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
[2025-06-01 10:38:36] [INFO ] Invariant cache hit.
[2025-06-01 10:38:37] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 10:38:37] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 10:38:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-01 10:38:37] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 10:38:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 10:38:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2025-06-01 10:38:37] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:38:37] [INFO ] Added : 36 causal constraints over 8 iterations in 127 ms. Result :sat
Minimization took 164 ms.
[2025-06-01 10:38:37] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:38:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:38:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 188 ms returned sat
[2025-06-01 10:38:37] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:38:37] [INFO ] Added : 27 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:38:37] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:38:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:38] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:38:38] [INFO ] Added : 46 causal constraints over 11 iterations in 104 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:38:38] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:38:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 58 ms returned sat
[2025-06-01 10:38:38] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 20 ms.
[2025-06-01 10:38:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 5 ms to minimize.
[2025-06-01 10:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-01 10:38:38] [INFO ] Added : 24 causal constraints over 6 iterations in 104 ms. Result :sat
Minimization took 16 ms.
[2025-06-01 10:38:38] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:38:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:38] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:38] [INFO ] Added : 41 causal constraints over 10 iterations in 60 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:38:38] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:38:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 38 ms returned sat
[2025-06-01 10:38:38] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:38:38] [INFO ] Added : 27 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 17 ms.
[2025-06-01 10:38:38] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:38:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 56 ms returned sat
[2025-06-01 10:38:39] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:38:39] [INFO ] Added : 22 causal constraints over 5 iterations in 69 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:38:39] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:39] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:39] [INFO ] Added : 33 causal constraints over 7 iterations in 115 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:38:39] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:38:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 38 ms returned sat
[2025-06-01 10:38:39] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-01 10:38:39] [INFO ] Added : 26 causal constraints over 6 iterations in 54 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:38:39] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:39] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:39] [INFO ] Added : 39 causal constraints over 10 iterations in 119 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 10:38:39] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:38:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:39] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:40] [INFO ] Added : 30 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 16 ms.
[2025-06-01 10:38:40] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:38:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:40] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:38:40] [INFO ] Added : 45 causal constraints over 11 iterations in 72 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:38:40] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:40] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:38:40] [INFO ] Added : 29 causal constraints over 6 iterations in 98 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:38:40] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:38:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-01 10:38:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2025-06-01 10:38:40] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:40] [INFO ] Added : 36 causal constraints over 9 iterations in 86 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 10, 11, 11, 11, 12, 10, 11, 10, 11, 11, 11, 11, 11] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
FORMULA JoinFreeModules-PT-0010-UpperBounds-13 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-05 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 10, 11, 12, 11, 10, 11, 10, 11, 12, 11, 11] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
Support contains 12 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 81/81 transitions.
Graph (complete) has 120 edges and 50 vertex of which 40 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 64
Applied a total of 2 rules in 18 ms. Remains 40 /50 variables (removed 10) and now considering 64/81 (removed 17) transitions.
Running 48 sub problems to find dead transitions.
// Phase 1: matrix 64 rows 40 cols
[2025-06-01 10:38:41] [INFO ] Computed 8 invariants in 4 ms
[2025-06-01 10:38:41] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1845ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1887 ms. Remains : 40/50 places, 64/81 transitions.
[2025-06-01 10:38:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11, 10, 11, 12, 11, 10, 11, 10, 11, 12, 11, 11] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
RANDOM walk for 1000000 steps (2 resets) in 1560 ms. (640 steps per ms)
FORMULA JoinFreeModules-PT-0010-UpperBounds-14 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 11000011 steps (22 resets) in 7373 ms. (1491 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 12, 11, 12, 11, 10, 11, 10, 11, 12, 12] Max Struct:[13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13]
[2025-06-01 10:38:52] [INFO ] Invariant cache hit.
[2025-06-01 10:38:52] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 10:38:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:52] [INFO ] Added : 23 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 14 ms.
[2025-06-01 10:38:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2025-06-01 10:38:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2025-06-01 10:38:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:52] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:52] [INFO ] Added : 44 causal constraints over 10 iterations in 321 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:38:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-01 10:38:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 35 ms returned sat
[2025-06-01 10:38:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:38:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:53] [INFO ] Added : 41 causal constraints over 11 iterations in 60 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 30 ms returned sat
[2025-06-01 10:38:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:38:53] [INFO ] Added : 35 causal constraints over 9 iterations in 52 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:38:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:38:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:38:53] [INFO ] Added : 33 causal constraints over 10 iterations in 59 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:38:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:38:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:53] [INFO ] Added : 35 causal constraints over 8 iterations in 38 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:53] [INFO ] Added : 36 causal constraints over 10 iterations in 48 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-01 10:38:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 10:38:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2025-06-01 10:38:54] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:38:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:54] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:38:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:54] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:38:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 12, 11, 12, 11, 10, 11, 10, 11, 12, 12] Max Struct:[13, 12, 13, 12, 13, 13, 13, 13, 13, 12, 12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-15 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-11 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-03 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-01 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12, 11, 11, 10, 11, 10, 11] Max Struct:[13, 13, 13, 13, 13, 13, 13]
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 30 /40 variables (removed 10) and now considering 48/64 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/40 places, 48/64 transitions.
// Phase 1: matrix 48 rows 30 cols
[2025-06-01 10:38:54] [INFO ] Computed 6 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[12, 11, 11, 10, 11, 10, 11] Max Struct:[13, 13, 13, 13, 13, 13, 13]
RANDOM walk for 1000002 steps (2 resets) in 1207 ms. (827 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 3489 ms. (2005 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 11, 11, 10, 11, 10, 11] Max Struct:[13, 13, 13, 13, 13, 13, 13]
[2025-06-01 10:38:59] [INFO ] Invariant cache hit.
[2025-06-01 10:38:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:38:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 10:38:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:38:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 10:38:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
Minimization took 14 ms.
[2025-06-01 10:38:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:38:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:38:59] [INFO ] Added : 21 causal constraints over 5 iterations in 213 ms. Result :sat
Minimization took 31 ms.
[2025-06-01 10:38:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:38:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:38:59] [INFO ] Added : 27 causal constraints over 7 iterations in 33 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:38:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:38:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:38:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:38:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:38:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 10:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-01 10:38:59] [INFO ] Added : 21 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:39:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:39:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:39:00] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:39:00] [INFO ] Added : 25 causal constraints over 6 iterations in 46 ms. Result :sat
Minimization took 20 ms.
[2025-06-01 10:39:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:39:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:39:00] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:39:00] [INFO ] Added : 12 causal constraints over 4 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2025-06-01 10:39:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:39:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:39:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 27 ms returned sat
[2025-06-01 10:39:00] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:39:00] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 10:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-06-01 10:39:00] [INFO ] Added : 26 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 11, 11, 10, 11, 10, 11] Max Struct:[12, 13, 13, 13, 13, 13, 13]
FORMULA JoinFreeModules-PT-0010-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 11, 10, 11, 10, 11] Max Struct:[13, 13, 13, 13, 13, 13]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 25 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 25 /30 variables (removed 5) and now considering 40/48 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/30 places, 40/48 transitions.
// Phase 1: matrix 40 rows 25 cols
[2025-06-01 10:39:00] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11, 11, 10, 11, 10, 11] Max Struct:[13, 13, 13, 13, 13, 13]
RANDOM walk for 1000000 steps (2 resets) in 1066 ms. (937 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2590 ms. (2315 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 11, 10, 11, 10, 11] Max Struct:[13, 13, 13, 13, 13, 13]
[2025-06-01 10:39:04] [INFO ] Invariant cache hit.
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:39:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:39:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 10:39:04] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:39:04] [INFO ] Added : 29 causal constraints over 6 iterations in 39 ms. Result :sat
Minimization took 16 ms.
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:39:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Added 5 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:39:04] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:39:04] [INFO ] Added : 25 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-01 10:39:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:39:04] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:39:04] [INFO ] Added : 27 causal constraints over 7 iterations in 32 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:39:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-01 10:39:04] [INFO ] Added : 30 causal constraints over 6 iterations in 24 ms. Result :sat
Minimization took 16 ms.
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:39:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Nat]Added 5 Read/Feed constraints in 21 ms returned sat
[2025-06-01 10:39:04] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:39:04] [INFO ] Added : 24 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 18 ms.
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-01 10:39:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-01 10:39:05] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:39:05] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-01 10:39:05] [INFO ] Added : 23 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 11, 10, 11, 10, 11] Max Struct:[13, 13, 13, 13, 13, 13]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 11, 10, 11, 10, 11] Max Struct:[13, 13, 13, 13, 13, 13]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2025-06-01 10:39:05] [INFO ] Invariant cache hit.
[2025-06-01 10:39:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-01 10:39:05] [INFO ] Invariant cache hit.
[2025-06-01 10:39:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-01 10:39:05] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2025-06-01 10:39:05] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-01 10:39:05] [INFO ] Invariant cache hit.
[2025-06-01 10:39:05] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 30 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 65 constraints, problems are : Problem set: 0 solved, 30 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 705ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 706ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 764 ms. Remains : 25/25 places, 40/40 transitions.
[2025-06-01 10:39:06] [INFO ] Flatten gal took : 50 ms
[2025-06-01 10:39:06] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:39:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12433797206765389854.gal : 8 ms
[2025-06-01 10:39:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3008030385326768658.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12433797206765389854.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3008030385326768658.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3008030385326768658.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :25 after 56
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :56 after 369
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :369 after 967
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :967 after 1449
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :1449 after 2.36588e+06
RANDOM walk for 40000 steps (8 resets) in 1587 ms. (25 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :2.36588e+06 after 1.91716e+11
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.98778e+16,0.088433,6044,2,441,13,13597,18,0,225,13702,0
Total reachable state count : 39877822004900000
Verifying 12 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.088784,6304,1,0,13,13597,18,0,226,13702,0
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.089007,6304,1,0,13,13597,18,0,226,13702,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.089191,6304,1,0,13,13597,18,0,226,13702,0
Invariant property MIN1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.089377,6304,1,0,13,13597,18,0,226,13702,0
Reachability property MAX2 does not hold.
No reachable states exhibit your property : MAX2
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,0,0.089522,6304,1,0,13,13597,18,0,226,13702,0
Invariant property MIN2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,0.089669,6304,1,0,13,13597,18,0,226,13702,0
Reachability property MAX3 does not hold.
No reachable states exhibit your property : MAX3
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,0,0.08989,6304,1,0,13,13597,18,0,226,13702,0
Invariant property MIN3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,0,0.090138,6304,1,0,13,13597,18,0,226,13702,0
Reachability property MAX4 does not hold.
No reachable states exhibit your property : MAX4
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,0,0.090395,6304,1,0,13,13597,18,0,226,13702,0
Invariant property MIN4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,0,0.090654,6304,1,0,13,13597,18,0,226,13702,0
Reachability property MAX5 does not hold.
No reachable states exhibit your property : MAX5
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,0,0.090939,6304,1,0,13,13597,18,0,226,13702,0
Invariant property MIN5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,0,0.091232,6304,1,0,13,13597,18,0,226,13702,0
BEST_FIRST walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 180216 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 12
Probabilistic random walk after 180216 steps, saw 146505 distinct states, run finished after 3006 ms. (steps per millisecond=59 ) properties seen :0
FORMULA JoinFreeModules-PT-0010-UpperBounds-09 11 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0010-UpperBounds-08 10 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0010-UpperBounds-07 11 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0010-UpperBounds-06 10 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0010-UpperBounds-04 11 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0010-UpperBounds-02 11 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 33536 ms.
BK_STOP 1748774350031
--------------------
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="JoinFreeModules-PT-0010"
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 JoinFreeModules-PT-0010, 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 r125-tall-174876435700053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0010.tgz
mv JoinFreeModules-PT-0010 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 ;