Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418400445.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DoubleExponent-PT-001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418400445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K Mar 5 18:22 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-001-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678854105443

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 04:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 04:21:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 04:21:48] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-15 04:21:48] [INFO ] Transformed 57 places.
[2023-03-15 04:21:48] [INFO ] Transformed 48 transitions.
[2023-03-15 04:21:48] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 48 rows 57 cols
[2023-03-15 04:21:48] [INFO ] Computed 9 place invariants in 20 ms
FORMULA DoubleExponent-PT-001-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 331 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :19
FORMULA DoubleExponent-PT-001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-001-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :5
[2023-03-15 04:21:48] [INFO ] Invariant cache hit.
[2023-03-15 04:21:48] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2023-03-15 04:21:48] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 4 ms returned unsat
[2023-03-15 04:21:48] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-15 04:21:48] [INFO ] [Real]Absence check using 4 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 04:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:48] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-15 04:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:21:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:48] [INFO ] [Nat]Absence check using 4 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 04:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:48] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-15 04:21:48] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
[2023-03-15 04:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-15 04:21:48] [INFO ] Computed and/alt/rep : 47/88/47 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 04:21:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-03-15 04:21:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-15 04:21:49] [INFO ] Added : 44 causal constraints over 9 iterations in 229 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1, -1] Max seen :[1, 4]
FORMULA DoubleExponent-PT-001-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 52 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 51 transition count 34
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 28 place count 39 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 28 place count 39 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 36 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 35 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 35 transition count 30
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 60 place count 23 transition count 18
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 21 transition count 16
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 21 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 20 transition count 15
Applied a total of 68 rules in 59 ms. Remains 20 /57 variables (removed 37) and now considering 15/48 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 20/57 places, 15/48 transitions.
// Phase 1: matrix 15 rows 20 cols
[2023-03-15 04:21:49] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 115385 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 79121 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 1) seen :4
[2023-03-15 04:21:50] [INFO ] Invariant cache hit.
[2023-03-15 04:21:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:50] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 04:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 04:21:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:21:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:50] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 04:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 04:21:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-15 04:21:50] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2023-03-15 04:21:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-15 04:21:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2023-03-15 04:21:50] [INFO ] Computed and/alt/rep : 14/43/14 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 04:21:50] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2023-03-15 04:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-15 04:21:50] [INFO ] Added : 11 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-15 04:21:50] [INFO ] Invariant cache hit.
[2023-03-15 04:21:51] [INFO ] Implicit Places using invariants in 43 ms returned [6, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 18/20 places, 15/15 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 17 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 14
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 16 transition count 13
Applied a total of 4 rules in 5 ms. Remains 16 /18 variables (removed 2) and now considering 13/15 (removed 2) transitions.
// Phase 1: matrix 13 rows 16 cols
[2023-03-15 04:21:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-15 04:21:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-15 04:21:51] [INFO ] Invariant cache hit.
[2023-03-15 04:21:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 16/20 places, 13/15 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 146 ms. Remains : 16/20 places, 13/15 transitions.
[2023-03-15 04:21:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 126801 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 84274 resets, run finished after 407 ms. (steps per millisecond=2457 ) properties (out of 1) seen :9
[2023-03-15 04:21:52] [INFO ] Invariant cache hit.
[2023-03-15 04:21:52] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-15 04:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-15 04:21:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:21:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:52] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 04:21:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-15 04:21:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-15 04:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-15 04:21:52] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 04:21:52] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-03-15 04:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-15 04:21:52] [INFO ] Added : 11 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[13]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-15 04:21:52] [INFO ] Invariant cache hit.
[2023-03-15 04:21:52] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-15 04:21:52] [INFO ] Invariant cache hit.
[2023-03-15 04:21:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:52] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-15 04:21:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 04:21:52] [INFO ] Invariant cache hit.
[2023-03-15 04:21:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 16/16 places, 13/13 transitions.
[2023-03-15 04:21:52] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 126895 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 84225 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 1) seen :8
[2023-03-15 04:21:53] [INFO ] Invariant cache hit.
[2023-03-15 04:21:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-15 04:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-15 04:21:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:21:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:53] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 04:21:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-15 04:21:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 3 ms to minimize.
[2023-03-15 04:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-15 04:21:53] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 04:21:53] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-03-15 04:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-15 04:21:53] [INFO ] Added : 11 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[13]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-15 04:21:53] [INFO ] Invariant cache hit.
[2023-03-15 04:21:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-15 04:21:53] [INFO ] Invariant cache hit.
[2023-03-15 04:21:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:53] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-15 04:21:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 04:21:53] [INFO ] Invariant cache hit.
[2023-03-15 04:21:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 16/16 places, 13/13 transitions.
Starting property specific reduction for DoubleExponent-PT-001-UpperBounds-15
[2023-03-15 04:21:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
[2023-03-15 04:21:53] [INFO ] Invariant cache hit.
[2023-03-15 04:21:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:53] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 04:21:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:21:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:53] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 04:21:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-15 04:21:53] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2023-03-15 04:21:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-15 04:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 51 ms
[2023-03-15 04:21:53] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 04:21:53] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2023-03-15 04:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-15 04:21:53] [INFO ] Added : 11 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 13/13 transitions.
[2023-03-15 04:21:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 126899 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 83943 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 1) seen :9
[2023-03-15 04:21:54] [INFO ] Invariant cache hit.
[2023-03-15 04:21:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 04:21:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:21:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-15 04:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:54] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 04:21:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-15 04:21:54] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2023-03-15 04:21:55] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2023-03-15 04:21:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-15 04:21:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 77 ms
[2023-03-15 04:21:55] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-15 04:21:55] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2023-03-15 04:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-15 04:21:55] [INFO ] Added : 11 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-15 04:21:55] [INFO ] Invariant cache hit.
[2023-03-15 04:21:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-15 04:21:55] [INFO ] Invariant cache hit.
[2023-03-15 04:21:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:55] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-15 04:21:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 04:21:55] [INFO ] Invariant cache hit.
[2023-03-15 04:21:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 16/16 places, 13/13 transitions.
[2023-03-15 04:21:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 126814 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000000 steps, including 84206 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 1) seen :9
[2023-03-15 04:21:56] [INFO ] Invariant cache hit.
[2023-03-15 04:21:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 04:21:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 04:21:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 04:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 04:21:56] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-15 04:21:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-15 04:21:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2023-03-15 04:21:56] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2023-03-15 04:21:56] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-15 04:21:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 81 ms
[2023-03-15 04:21:56] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 04:21:56] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2023-03-15 04:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-15 04:21:56] [INFO ] Added : 11 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[10]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 13/13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-15 04:21:56] [INFO ] Invariant cache hit.
[2023-03-15 04:21:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-15 04:21:56] [INFO ] Invariant cache hit.
[2023-03-15 04:21:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:21:56] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-15 04:21:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 04:21:56] [INFO ] Invariant cache hit.
[2023-03-15 04:21:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 16/16 places, 13/13 transitions.
Ending property specific reduction for DoubleExponent-PT-001-UpperBounds-15 in 2876 ms.
[2023-03-15 04:21:56] [INFO ] Flatten gal took : 25 ms
[2023-03-15 04:21:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-15 04:21:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 13 transitions and 58 arcs took 1 ms.
Total runtime 8768 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/638/ub_0_
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 361260 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093028 kB
Could not compute solution for formula : DoubleExponent-PT-001-UpperBounds-15

BK_STOP 1678857689097

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DoubleExponent-PT-001-UpperBounds-15
ub formula formula --maxsum=/tmp/638/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 16 places, 13 transitions and 58 arcs
pnml2lts-sym: Petri net DoubleExponent_PT_001 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 13->13 groups
pnml2lts-sym: Regrouping took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state vector length is 16; there are 13 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 644
Killing (9) : 644

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-001"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is DoubleExponent-PT-001, 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 r137-smll-167819418400445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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