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.r297-tall-167873950800717.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 PolyORBNT-PT-S05J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800717
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 18K Feb 25 23:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 23:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 23:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 294K Feb 25 23:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 25 23:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 25 23:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 83K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 402K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:23 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 PolyORBNT-PT-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679619879284

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=PolyORBNT-PT-S05J20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 01:04:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 01:04:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 01:04:41] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-24 01:04:41] [INFO ] Transformed 349 places.
[2023-03-24 01:04:41] [INFO ] Transformed 1210 transitions.
[2023-03-24 01:04:41] [INFO ] Parsed PT model containing 349 places and 1210 transitions and 8824 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 551 out of 555 initially.
// Phase 1: matrix 551 rows 349 cols
[2023-03-24 01:04:41] [INFO ] Computed 62 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 696 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :25
FORMULA PolyORBNT-PT-S05J20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 175 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10000 steps, including 119 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 205 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 160 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10000 steps, including 160 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10000 steps, including 160 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :22
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :21
[2023-03-24 01:04:41] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2023-03-24 01:04:41] [INFO ] Computed 62 place invariants in 23 ms
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive place invariants in 23 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 12 ms returned unsat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 41 ms returned unsat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 7 ms returned unsat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 9 ms returned unsat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 15 ms returned unsat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 8 ms returned unsat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned sat
[2023-03-24 01:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:04:43] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2023-03-24 01:04:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:04:43] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-24 01:04:43] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 19 ms returned sat
[2023-03-24 01:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:04:43] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-03-24 01:04:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 01:04:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-24 01:04:43] [INFO ] Computed and/alt/rep : 349/889/349 causal constraints (skipped 196 transitions) in 55 ms.
[2023-03-24 01:04:44] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 4 ms to minimize.
[2023-03-24 01:04:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-24 01:04:44] [INFO ] Added : 13 causal constraints over 3 iterations in 979 ms. Result :sat
Minimization took 129 ms.
[2023-03-24 01:04:44] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-24 01:04:44] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned sat
[2023-03-24 01:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:04:45] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2023-03-24 01:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:04:45] [INFO ] [Nat]Absence check using 42 positive place invariants in 9 ms returned sat
[2023-03-24 01:04:45] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 12 ms returned sat
[2023-03-24 01:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:04:50] [INFO ] [Nat]Absence check using state equation in 4926 ms returned unknown
[2023-03-24 01:04:50] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2023-03-24 01:04:50] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 11 ms returned unsat
[2023-03-24 01:04:50] [INFO ] [Real]Absence check using 42 positive place invariants in 9 ms returned sat
[2023-03-24 01:04:50] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 17 ms returned unsat
[2023-03-24 01:04:50] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2023-03-24 01:04:50] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 7 ms returned unsat
[2023-03-24 01:04:50] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned sat
[2023-03-24 01:04:50] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 3, 1, 1, 1, 1, 3, 32, 10, 1, 1, 4, 1] Max seen :[1, 3, 1, 1, 1, 1, 3, 0, 4, 1, 1, 4, 1]
FORMULA PolyORBNT-PT-S05J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 344 transition count 530
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 55 place count 319 transition count 530
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 55 place count 319 transition count 505
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 105 place count 294 transition count 505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 293 transition count 504
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 293 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 291 transition count 502
Applied a total of 111 rules in 151 ms. Remains 291 /349 variables (removed 58) and now considering 502/555 (removed 53) transitions.
[2023-03-24 01:04:50] [INFO ] Flow matrix only has 498 transitions (discarded 4 similar events)
// Phase 1: matrix 498 rows 291 cols
[2023-03-24 01:04:50] [INFO ] Computed 57 place invariants in 15 ms
[2023-03-24 01:04:50] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 291/349 places, 407/555 transitions.
Applied a total of 0 rules in 19 ms. Remains 291 /291 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 599 ms. Remains : 291/349 places, 407/555 transitions.
Normalized transition count is 403 out of 407 initially.
// Phase 1: matrix 403 rows 291 cols
[2023-03-24 01:04:50] [INFO ] Computed 57 place invariants in 5 ms
FORMULA PolyORBNT-PT-S05J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 51809 resets, run finished after 4389 ms. (steps per millisecond=227 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5640 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 1) seen :4
[2023-03-24 01:04:56] [INFO ] Flow matrix only has 403 transitions (discarded 4 similar events)
// Phase 1: matrix 403 rows 291 cols
[2023-03-24 01:04:56] [INFO ] Computed 57 place invariants in 9 ms
[2023-03-24 01:04:56] [INFO ] [Real]Absence check using 43 positive place invariants in 20 ms returned sat
[2023-03-24 01:04:56] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-24 01:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:04:56] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-24 01:04:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:04:56] [INFO ] [Nat]Absence check using 43 positive place invariants in 11 ms returned sat
[2023-03-24 01:04:56] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-24 01:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:05:02] [INFO ] [Nat]Absence check using state equation in 6123 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 407/407 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 291 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 290 transition count 406
Applied a total of 2 rules in 25 ms. Remains 290 /291 variables (removed 1) and now considering 406/407 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 290/291 places, 406/407 transitions.
Normalized transition count is 402 out of 406 initially.
// Phase 1: matrix 402 rows 290 cols
[2023-03-24 01:05:02] [INFO ] Computed 57 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 52093 resets, run finished after 4364 ms. (steps per millisecond=229 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5733 resets, run finished after 1015 ms. (steps per millisecond=985 ) properties (out of 1) seen :4
[2023-03-24 01:05:08] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-24 01:05:08] [INFO ] Computed 57 place invariants in 8 ms
[2023-03-24 01:05:08] [INFO ] [Real]Absence check using 43 positive place invariants in 9 ms returned sat
[2023-03-24 01:05:08] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 7 ms returned sat
[2023-03-24 01:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:05:08] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-24 01:05:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:05:08] [INFO ] [Nat]Absence check using 43 positive place invariants in 9 ms returned sat
[2023-03-24 01:05:08] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 25 ms returned sat
[2023-03-24 01:05:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:05:14] [INFO ] [Nat]Absence check using state equation in 6179 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 20 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-24 01:05:14] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-24 01:05:14] [INFO ] Invariant cache hit.
[2023-03-24 01:05:15] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-24 01:05:15] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-24 01:05:15] [INFO ] Invariant cache hit.
[2023-03-24 01:05:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 01:05:17] [INFO ] Implicit Places using invariants and state equation in 1930 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
[2023-03-24 01:05:17] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-24 01:05:17] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-24 01:05:17] [INFO ] Invariant cache hit.
[2023-03-24 01:05:17] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2611 ms. Remains : 290/290 places, 406/406 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-10
Normalized transition count is 402 out of 406 initially.
// Phase 1: matrix 402 rows 290 cols
[2023-03-24 01:05:17] [INFO ] Computed 57 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 545 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :4
[2023-03-24 01:05:17] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-24 01:05:17] [INFO ] Computed 57 place invariants in 10 ms
[2023-03-24 01:05:17] [INFO ] [Real]Absence check using 43 positive place invariants in 9 ms returned sat
[2023-03-24 01:05:17] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-24 01:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:05:17] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-24 01:05:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:05:17] [INFO ] [Nat]Absence check using 43 positive place invariants in 9 ms returned sat
[2023-03-24 01:05:17] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 24 ms returned sat
[2023-03-24 01:05:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:05:22] [INFO ] [Nat]Absence check using state equation in 4920 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 12 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-24 01:05:22] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-24 01:05:22] [INFO ] Invariant cache hit.
[2023-03-24 01:05:22] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 290/290 places, 406/406 transitions.
Normalized transition count is 402 out of 406 initially.
// Phase 1: matrix 402 rows 290 cols
[2023-03-24 01:05:22] [INFO ] Computed 57 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 52012 resets, run finished after 4335 ms. (steps per millisecond=230 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5749 resets, run finished after 1021 ms. (steps per millisecond=979 ) properties (out of 1) seen :4
[2023-03-24 01:05:28] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2023-03-24 01:05:28] [INFO ] Computed 57 place invariants in 14 ms
[2023-03-24 01:05:28] [INFO ] [Real]Absence check using 43 positive place invariants in 10 ms returned sat
[2023-03-24 01:05:28] [INFO ] [Real]Absence check using 43 positive and 14 generalized place invariants in 8 ms returned sat
[2023-03-24 01:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 01:05:28] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-24 01:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 01:05:28] [INFO ] [Nat]Absence check using 43 positive place invariants in 8 ms returned sat
[2023-03-24 01:05:28] [INFO ] [Nat]Absence check using 43 positive and 14 generalized place invariants in 23 ms returned sat
[2023-03-24 01:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 01:05:34] [INFO ] [Nat]Absence check using state equation in 6154 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 17 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2023-03-24 01:05:34] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-24 01:05:34] [INFO ] Invariant cache hit.
[2023-03-24 01:05:35] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-24 01:05:35] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-24 01:05:35] [INFO ] Invariant cache hit.
[2023-03-24 01:05:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 01:05:37] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2023-03-24 01:05:37] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-24 01:05:37] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2023-03-24 01:05:37] [INFO ] Invariant cache hit.
[2023-03-24 01:05:37] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2508 ms. Remains : 290/290 places, 406/406 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J20-UpperBounds-10 in 19977 ms.
[2023-03-24 01:05:37] [INFO ] Flatten gal took : 75 ms
[2023-03-24 01:05:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-24 01:05:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 290 places, 406 transitions and 2109 arcs took 4 ms.
Total runtime 56445 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/569/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14574860 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095924 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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="PolyORBNT-PT-S05J20"
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 PolyORBNT-PT-S05J20, 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 r297-tall-167873950800717"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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