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.r135-tall-171631131300533.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 greatspnxred
Input is DoubleExponent-PT-002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 33K 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 DoubleExponent-PT-002-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716375570060

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:59:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 10:59:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:59:31] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-22 10:59:31] [INFO ] Transformed 110 places.
[2024-05-22 10:59:31] [INFO ] Transformed 98 transitions.
[2024-05-22 10:59:31] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 145 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, 0, 0, 0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 98 rows 110 cols
[2024-05-22 10:59:31] [INFO ] Computed 14 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 5, 1, +inf, 1]
RANDOM walk for 10000 steps (325 resets) in 29 ms. (333 steps per ms)
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (2224 resets) in 99 ms. (800 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 5, 1, +inf]
[2024-05-22 10:59:31] [INFO ] Invariant cache hit.
[2024-05-22 10:59:31] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-22 10:59:31] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-22 10:59:31] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 10:59:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 10:59:31] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:31] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-22 10:59:32] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 8 ms to minimize.
[2024-05-22 10:59:32] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:59:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2024-05-22 10:59:32] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 10:59:32] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:59:32] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:59:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2024-05-22 10:59:32] [INFO ] Added : 94 causal constraints over 20 iterations in 390 ms. Result :sat
Minimization took 93 ms.
[2024-05-22 10:59:32] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 10:59:32] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-22 10:59:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-22 10:59:32] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:59:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:59:32] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:32] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 10:59:32] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:59:32] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:59:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2024-05-22 10:59:32] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 333 ms
[2024-05-22 10:59:33] [INFO ] Added : 90 causal constraints over 19 iterations in 573 ms. Result :sat
Minimization took 95 ms.
[2024-05-22 10:59:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 10:59:33] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:33] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:59:33] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:33] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 9 ms to minimize.
[2024-05-22 10:59:33] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:59:34] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-22 10:59:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 225 ms
[2024-05-22 10:59:34] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 10:59:34] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:59:34] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:59:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2024-05-22 10:59:34] [INFO ] Added : 79 causal constraints over 17 iterations in 286 ms. Result :sat
Minimization took 74 ms.
[2024-05-22 10:59:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 10:59:34] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 10:59:34] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:59:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 10:59:34] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:34] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 10:59:34] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:59:34] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-05-22 10:59:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-22 10:59:34] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 10:59:34] [INFO ] Added : 93 causal constraints over 19 iterations in 190 ms. Result :sat
Minimization took 80 ms.
[2024-05-22 10:59:34] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 10:59:34] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:35] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-22 10:59:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2024-05-22 10:59:35] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 10:59:35] [INFO ] Added : 93 causal constraints over 19 iterations in 175 ms. Result :sat
Minimization took 84 ms.
[2024-05-22 10:59:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 10:59:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned unsat
[2024-05-22 10:59:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 10:59:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-22 10:59:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-22 10:59:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-22 10:59:35] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 0 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 0 ms to minimize.
[2024-05-22 10:59:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 195 ms
[2024-05-22 10:59:35] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 10:59:36] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:59:36] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:59:36] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 2 ms to minimize.
[2024-05-22 10:59:36] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:59:36] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:59:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 256 ms
[2024-05-22 10:59:36] [INFO ] Added : 90 causal constraints over 19 iterations in 444 ms. Result :sat
Minimization took 74 ms.
[2024-05-22 10:59:36] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:59:36] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 10:59:36] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 10:59:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:59:36] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 10:59:36] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 10:59:36] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:59:36] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:59:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-22 10:59:36] [INFO ] Added : 90 causal constraints over 19 iterations in 310 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 1, 1, +inf]
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 1, +inf]
Support contains 7 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 104 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 103 transition count 78
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 85 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 83 transition count 76
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 44 place count 83 transition count 73
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 80 transition count 73
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 88 place count 61 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 59 transition count 54
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 99 place count 59 transition count 47
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 106 place count 52 transition count 47
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 115 place count 52 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 51 transition count 46
Applied a total of 116 rules in 95 ms. Remains 51 /110 variables (removed 59) and now considering 46/98 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 51/110 places, 46/98 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 13=1, 14=1, 15=1, 27=1, 29=1, 42=1, 44=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 2=1, 3=1, 13=1, 14=1, 15=1, 27=1, 29=1, 42=1, 44=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1133 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :[4, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 1, +inf]
// Phase 1: matrix 46 rows 51 cols
[2024-05-22 10:59:37] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 1, +inf]
RANDOM walk for 1000000 steps (112874 resets) in 767 ms. (1302 steps per ms)
FORMULA DoubleExponent-PT-002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (155074 resets) in 943 ms. (2118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2024-05-22 10:59:39] [INFO ] Invariant cache hit.
[2024-05-22 10:59:39] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-22 10:59:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 10:59:39] [INFO ] [Real]Added 4 Read/Feed constraints in 5 ms returned sat
[2024-05-22 10:59:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 10:59:39] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:59:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-22 10:59:39] [INFO ] Computed and/alt/rep : 45/157/45 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 10:59:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 10:59:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-22 10:59:39] [INFO ] Added : 22 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 25 ms.
[2024-05-22 10:59:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-22 10:59:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-22 10:59:39] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 10:59:39] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-22 10:59:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-22 10:59:39] [INFO ] Computed and/alt/rep : 45/157/45 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 10:59:39] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-22 10:59:39] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-22 10:59:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2024-05-22 10:59:39] [INFO ] Added : 43 causal constraints over 9 iterations in 140 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 46/46 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 51 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 44
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 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 47 transition count 42
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 47 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 46 transition count 41
Applied a total of 10 rules in 6 ms. Remains 46 /51 variables (removed 5) and now considering 41/46 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 46/51 places, 41/46 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 5=2, 6=1, 10=1, 11=1, 12=1, 20=1, 22=1, 26=2, 31=1, 32=1, 33=1, 37=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 3=1, 10=1, 11=1, 12=1, 20=1, 22=1, 31=1, 33=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1132 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :[4, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
// Phase 1: matrix 41 rows 46 cols
[2024-05-22 10:59:39] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (112872 resets) in 634 ms. (1574 steps per ms)
BEST_FIRST walk for 2000000 steps (155313 resets) in 872 ms. (2290 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2024-05-22 10:59:41] [INFO ] Invariant cache hit.
[2024-05-22 10:59:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 10:59:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 10:59:41] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 10:59:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 89 ms
[2024-05-22 10:59:41] [INFO ] Computed and/alt/rep : 39/161/39 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 10:59:41] [INFO ] Added : 35 causal constraints over 8 iterations in 100 ms. Result :sat
Minimization took 21 ms.
[2024-05-22 10:59:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 10:59:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 10:59:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-22 10:59:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 159 ms
[2024-05-22 10:59:41] [INFO ] Computed and/alt/rep : 39/161/39 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-22 10:59:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-22 10:59:42] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-22 10:59:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-05-22 10:59:42] [INFO ] Added : 39 causal constraints over 10 iterations in 125 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 46/46 places, 41/41 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-22 10:59:42] [INFO ] Invariant cache hit.
[2024-05-22 10:59:42] [INFO ] Implicit Places using invariants in 52 ms returned [16, 21, 33, 40]
[2024-05-22 10:59:42] [INFO ] Actually due to overlaps returned [16, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 44/46 places, 41/41 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 40
Applied a total of 2 rules in 4 ms. Remains 43 /44 variables (removed 1) and now considering 40/41 (removed 1) transitions.
// Phase 1: matrix 40 rows 43 cols
[2024-05-22 10:59:42] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 10:59:42] [INFO ] Implicit Places using invariants in 151 ms returned [30, 37]
[2024-05-22 10:59:42] [INFO ] Actually due to overlaps returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 156 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 42/46 places, 40/41 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 39
Applied a total of 2 rules in 3 ms. Remains 41 /42 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 41 cols
[2024-05-22 10:59:42] [INFO ] Computed 7 invariants in 3 ms
[2024-05-22 10:59:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 10:59:42] [INFO ] Invariant cache hit.
[2024-05-22 10:59:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 10:59:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 41/46 places, 39/41 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 324 ms. Remains : 41/46 places, 39/41 transitions.
Found an invariant !
This invariant on transitions {0=2, 2=2, 3=1, 4=1, 5=1, 7=1, 9=1, 10=1, 11=1, 12=1, 13=1, 15=1, 17=1, 21=1, 22=2, 25=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 36=1, 37=1, 38=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 8=1, 9=1, 16=1, 18=1, 26=1, 28=1, 36=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1251 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :[4, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2024-05-22 10:59:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (125383 resets) in 513 ms. (1945 steps per ms)
BEST_FIRST walk for 2000001 steps (166499 resets) in 775 ms. (2577 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2024-05-22 10:59:43] [INFO ] Invariant cache hit.
[2024-05-22 10:59:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:59:43] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 10:59:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-22 10:59:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 10:59:43] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 10:59:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:59:43] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-22 10:59:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 5 ms returned sat
[2024-05-22 10:59:43] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:59:43] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-22 10:59:43] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-22 10:59:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 79 ms
[2024-05-22 10:59:43] [INFO ] Computed and/alt/rep : 38/161/38 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-22 10:59:44] [INFO ] Added : 38 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 24 ms.
[2024-05-22 10:59:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:59:44] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-22 10:59:44] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-22 10:59:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:59:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 10:59:44] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:59:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 10:59:44] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 209 ms
[2024-05-22 10:59:44] [INFO ] Computed and/alt/rep : 38/161/38 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-22 10:59:44] [INFO ] Added : 23 causal constraints over 6 iterations in 70 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 41/41 places, 39/39 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2024-05-22 10:59:44] [INFO ] Invariant cache hit.
[2024-05-22 10:59:44] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 10:59:44] [INFO ] Invariant cache hit.
[2024-05-22 10:59:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 10:59:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-22 10:59:44] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-22 10:59:44] [INFO ] Invariant cache hit.
[2024-05-22 10:59:44] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-22 10:59:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-22 10:59:45] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:59:45] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-22 10:59:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-22 10:59:45] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2024-05-22 10:59:45] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 39/80 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/80 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 60 constraints, problems are : Problem set: 0 solved, 38 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-22 10:59:45] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 39/80 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 38/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-22 10:59:46] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/80 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-22 10:59:46] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/80 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/80 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 0/80 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 101 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 11/11 constraints]
After SMT, in 2502ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2509ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2622 ms. Remains : 41/41 places, 39/39 transitions.
Found an invariant !
This invariant on transitions {0=2, 2=2, 3=1, 4=1, 5=1, 7=1, 9=1, 10=1, 11=1, 12=1, 13=1, 15=1, 17=1, 21=1, 22=2, 25=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 36=1, 37=1, 38=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 8=1, 9=1, 16=1, 18=1, 26=1, 28=1, 36=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1239 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :[4, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
RANDOM walk for 40000 steps (5001 resets) in 446 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3321 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3302 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
Probably explored full state space saw : 1224 states, properties seen :0
Probabilistic random walk after 2447 steps, saw 1224 distinct states, run finished after 43 ms. (steps per millisecond=56 ) properties seen :0
Explored full state space saw : 1224 states, properties seen :0
Exhaustive walk after 2447 steps, saw 1224 distinct states, run finished after 27 ms. (steps per millisecond=90 ) properties seen :0
FORMULA DoubleExponent-PT-002-UpperBounds-14 4 TECHNIQUES REACHABILITY_MIN
FORMULA DoubleExponent-PT-002-UpperBounds-00 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16385 ms.
ITS solved all properties within timeout

BK_STOP 1716375587617

--------------------
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="DoubleExponent-PT-002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DoubleExponent-PT-002, 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 r135-tall-171631131300533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 ;