Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603200349.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is GPPP-PT-C0001N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603200349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000000100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717195788247

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:49:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 22:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:49:49] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2024-05-31 22:49:49] [INFO ] Transformed 33 places.
[2024-05-31 22:49:49] [INFO ] Transformed 22 transitions.
[2024-05-31 22:49:49] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 400, 0, 0, 0, 200, 0, 0, 7, 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, 0, 0, 0, 400, 0, 0, 0, 200, 0, 0, 7, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 22 rows 33 cols
[2024-05-31 22:49:49] [INFO ] Computed 13 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 400, 0, 0, 0, 200, 0, 0, 7, 0, 0, 0] Max Struct:[+inf, 200, +inf, +inf, 1000, +inf, 200, 200, 200, 200, +inf, 200, 7, +inf, +inf, 7]
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 26 ms. (370 steps per ms)
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130012 steps (26 resets) in 120 ms. (1074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 7, 1, 14, 7, 407, 7, 7, 84, 1, 7, 1, 2] Max Struct:[+inf, 200, +inf, +inf, 1000, +inf, 200, 200, 200, +inf, 200, +inf, +inf]
[2024-05-31 22:49:49] [INFO ] Invariant cache hit.
[2024-05-31 22:49:49] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 22:49:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned unsat
[2024-05-31 22:49:49] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-05-31 22:49:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-31 22:49:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:49:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-31 22:49:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 22:49:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:49:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 22:49:50] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 22:49:50] [INFO ] Added : 19 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 13 ms.
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 22:49:50] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 22:49:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:49:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 22:49:50] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 22:49:50] [INFO ] Added : 20 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 41 ms.
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 22:49:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[7, 7, 1, 14, 7, 407, 7, 7, 84, 1, 7, 1, 2] Max Struct:[7, 7, +inf, 14, 7, 407, 7, 7, 200, 1, 7, 1, 2]
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-05 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-03 14 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 36 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 24 cols
[2024-05-31 22:49:50] [INFO ] Computed 11 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 48 constraints, problems are : Problem set: 0 solved, 13 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 547ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 595 ms. Remains : 24/33 places, 14/22 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2024-05-31 22:49:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000002 steps (2 resets) in 432 ms. (2309 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 445 ms. (2242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2024-05-31 22:49:52] [INFO ] Invariant cache hit.
[2024-05-31 22:49:52] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:49:52] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-31 22:49:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-31 22:49:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:49:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-31 22:49:52] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-31 22:49:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 22:49:52] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 22:49:52] [INFO ] Added : 13 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-31 22:49:52] [INFO ] Invariant cache hit.
[2024-05-31 22:49:52] [INFO ] Implicit Places using invariants in 54 ms returned [0, 1, 2, 3, 13]
[2024-05-31 22:49:52] [INFO ] Actually due to overlaps returned [1, 13, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 14/14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 17 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 14 transition count 9
Applied a total of 11 rules in 4 ms. Remains 14 /20 variables (removed 6) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 14 cols
[2024-05-31 22:49:52] [INFO ] Computed 6 invariants in 3 ms
[2024-05-31 22:49:52] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 22:49:52] [INFO ] Invariant cache hit.
[2024-05-31 22:49:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:49:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 14/24 places, 9/14 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 129 ms. Remains : 14/24 places, 9/14 transitions.
[2024-05-31 22:49:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[3]
RANDOM walk for 1000003 steps (2 resets) in 290 ms. (3436 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 231 ms. (4310 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[3]
[2024-05-31 22:49:53] [INFO ] Invariant cache hit.
[2024-05-31 22:49:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:49:53] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-31 22:49:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-31 22:49:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 22:49:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 22:49:53] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-31 22:49:53] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-31 22:49:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:49:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 22:49:53] [INFO ] Computed and/alt/rep : 8/18/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 22:49:53] [INFO ] Added : 8 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[3]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 14/14 places, 9/9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-31 22:49:53] [INFO ] Invariant cache hit.
[2024-05-31 22:49:53] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 22:49:53] [INFO ] Invariant cache hit.
[2024-05-31 22:49:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:49:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-31 22:49:53] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-31 22:49:53] [INFO ] Invariant cache hit.
[2024-05-31 22:49:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/23 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 21 constraints, problems are : Problem set: 0 solved, 8 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/23 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 29 constraints, problems are : Problem set: 0 solved, 8 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 216ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 14/14 places, 9/9 transitions.
RANDOM walk for 40000 steps (8 resets) in 532 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
Probably explored full state space saw : 37 states, properties seen :0
Probabilistic random walk after 93 steps, saw 37 distinct states, run finished after 17 ms. (steps per millisecond=5 ) properties seen :0
Explored full state space saw : 37 states, properties seen :0
Exhaustive walk after 93 steps, saw 37 distinct states, run finished after 3 ms. (steps per millisecond=31 ) properties seen :0
FORMULA GPPP-PT-C0001N0000000100-UpperBounds-02 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4492 ms.
ITS solved all properties within timeout

BK_STOP 1717195793931

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="GPPP-PT-C0001N0000000100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is GPPP-PT-C0001N0000000100, 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 r496-tall-171640603200349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000100.tgz
mv GPPP-PT-C0001N0000000100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;