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.r265-smll-167863540300622.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 Peterson-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300622
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679140178806

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 11:49:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 11:49:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:49:42] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2023-03-18 11:49:42] [INFO ] Transformed 480 places.
[2023-03-18 11:49:42] [INFO ] Transformed 690 transitions.
[2023-03-18 11:49:42] [INFO ] Found NUPN structural information;
[2023-03-18 11:49:42] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-18 11:49:42] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 115 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-4-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 15) seen :2
FORMULA Peterson-PT-4-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 13) seen :1
FORMULA Peterson-PT-4-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-18 11:49:46] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 11:49:46] [INFO ] Computed 19 place invariants in 28 ms
[2023-03-18 11:49:48] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:8
[2023-03-18 11:49:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-18 11:49:48] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-18 11:49:50] [INFO ] After 992ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :4
[2023-03-18 11:49:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 11:49:50] [INFO ] After 359ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :8 sat :4
[2023-03-18 11:49:50] [INFO ] Deduced a trap composed of 10 places in 441 ms of which 12 ms to minimize.
[2023-03-18 11:49:51] [INFO ] Deduced a trap composed of 13 places in 392 ms of which 1 ms to minimize.
[2023-03-18 11:49:51] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 2 ms to minimize.
[2023-03-18 11:49:52] [INFO ] Deduced a trap composed of 10 places in 438 ms of which 4 ms to minimize.
[2023-03-18 11:49:52] [INFO ] Deduced a trap composed of 12 places in 485 ms of which 1 ms to minimize.
[2023-03-18 11:49:53] [INFO ] Deduced a trap composed of 18 places in 418 ms of which 1 ms to minimize.
[2023-03-18 11:49:53] [INFO ] Deduced a trap composed of 32 places in 394 ms of which 1 ms to minimize.
[2023-03-18 11:49:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3384 ms
[2023-03-18 11:49:54] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 2 ms to minimize.
[2023-03-18 11:49:54] [INFO ] Deduced a trap composed of 87 places in 312 ms of which 1 ms to minimize.
[2023-03-18 11:49:54] [INFO ] Deduced a trap composed of 66 places in 309 ms of which 1 ms to minimize.
[2023-03-18 11:49:55] [INFO ] Deduced a trap composed of 88 places in 281 ms of which 1 ms to minimize.
[2023-03-18 11:49:55] [INFO ] Deduced a trap composed of 54 places in 257 ms of which 1 ms to minimize.
[2023-03-18 11:49:55] [INFO ] Deduced a trap composed of 69 places in 238 ms of which 0 ms to minimize.
[2023-03-18 11:49:55] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2023-03-18 11:49:56] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 0 ms to minimize.
[2023-03-18 11:49:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2241 ms
[2023-03-18 11:49:56] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 1 ms to minimize.
[2023-03-18 11:49:56] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 0 ms to minimize.
[2023-03-18 11:49:56] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 1 ms to minimize.
[2023-03-18 11:49:57] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 0 ms to minimize.
[2023-03-18 11:49:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 925 ms
[2023-03-18 11:49:57] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 1 ms to minimize.
[2023-03-18 11:49:57] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 2 ms to minimize.
[2023-03-18 11:49:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2023-03-18 11:49:57] [INFO ] After 7860ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :4
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-18 11:49:58] [INFO ] After 9819ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :4
FORMULA Peterson-PT-4-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-4-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 52 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 480 transition count 553
Reduce places removed 137 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 158 rules applied. Total rules applied 295 place count 343 transition count 532
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 316 place count 322 transition count 532
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 316 place count 322 transition count 452
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 476 place count 242 transition count 452
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 510 place count 225 transition count 435
Applied a total of 510 rules in 150 ms. Remains 225 /480 variables (removed 255) and now considering 435/690 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 225/480 places, 435/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 458682 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458682 steps, saw 77043 distinct states, run finished after 3003 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 11:50:01] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
// Phase 1: matrix 375 rows 225 cols
[2023-03-18 11:50:01] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-18 11:50:02] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 11:50:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 11:50:02] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-18 11:50:02] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 11:50:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 11:50:02] [INFO ] After 201ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 11:50:02] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 1 ms to minimize.
[2023-03-18 11:50:03] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
[2023-03-18 11:50:03] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 2 ms to minimize.
[2023-03-18 11:50:03] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-18 11:50:03] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 1 ms to minimize.
[2023-03-18 11:50:04] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-18 11:50:04] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 1 ms to minimize.
[2023-03-18 11:50:04] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2023-03-18 11:50:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1879 ms
[2023-03-18 11:50:04] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-18 11:50:04] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 1 ms to minimize.
[2023-03-18 11:50:05] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2023-03-18 11:50:05] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2023-03-18 11:50:05] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 9 ms to minimize.
[2023-03-18 11:50:05] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2023-03-18 11:50:05] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2023-03-18 11:50:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1085 ms
[2023-03-18 11:50:05] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2023-03-18 11:50:05] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-18 11:50:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-03-18 11:50:06] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2023-03-18 11:50:06] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-03-18 11:50:06] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2023-03-18 11:50:06] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2023-03-18 11:50:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 658 ms
[2023-03-18 11:50:06] [INFO ] After 4301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 275 ms.
[2023-03-18 11:50:07] [INFO ] After 4975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 26 ms.
Support contains 52 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 435/435 transitions.
Applied a total of 0 rules in 30 ms. Remains 225 /225 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 225/225 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 435/435 transitions.
Applied a total of 0 rules in 22 ms. Remains 225 /225 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-18 11:50:07] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-18 11:50:07] [INFO ] Invariant cache hit.
[2023-03-18 11:50:07] [INFO ] Implicit Places using invariants in 229 ms returned [215, 216, 217, 218, 219]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 232 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 220/225 places, 435/435 transitions.
Applied a total of 0 rules in 15 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 270 ms. Remains : 220/225 places, 435/435 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 510978 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 510978 steps, saw 86078 distinct states, run finished after 3002 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 11:50:10] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
// Phase 1: matrix 375 rows 220 cols
[2023-03-18 11:50:10] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-18 11:50:10] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 11:50:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-18 11:50:11] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 11:50:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 11:50:11] [INFO ] After 182ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-18 11:50:11] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 1 ms to minimize.
[2023-03-18 11:50:11] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2023-03-18 11:50:11] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 1 ms to minimize.
[2023-03-18 11:50:12] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2023-03-18 11:50:12] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-18 11:50:12] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2023-03-18 11:50:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1187 ms
[2023-03-18 11:50:12] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2023-03-18 11:50:12] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-18 11:50:13] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2023-03-18 11:50:13] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 1 ms to minimize.
[2023-03-18 11:50:13] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2023-03-18 11:50:13] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2023-03-18 11:50:13] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-18 11:50:13] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
[2023-03-18 11:50:14] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2023-03-18 11:50:14] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2023-03-18 11:50:14] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2023-03-18 11:50:14] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-03-18 11:50:14] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2023-03-18 11:50:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2182 ms
[2023-03-18 11:50:15] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2023-03-18 11:50:15] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 2 ms to minimize.
[2023-03-18 11:50:15] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2023-03-18 11:50:15] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-18 11:50:15] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 0 ms to minimize.
[2023-03-18 11:50:15] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-03-18 11:50:15] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2023-03-18 11:50:15] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 1 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1710 ms
[2023-03-18 11:50:16] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 4 ms to minimize.
[2023-03-18 11:50:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2023-03-18 11:50:16] [INFO ] After 5784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-18 11:50:17] [INFO ] After 6300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 25 ms.
Support contains 52 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 435/435 transitions.
Applied a total of 0 rules in 25 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 220/220 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 435/435 transitions.
Applied a total of 0 rules in 21 ms. Remains 220 /220 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-18 11:50:17] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-18 11:50:17] [INFO ] Invariant cache hit.
[2023-03-18 11:50:17] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-18 11:50:17] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-18 11:50:17] [INFO ] Invariant cache hit.
[2023-03-18 11:50:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 11:50:18] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2023-03-18 11:50:18] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-18 11:50:18] [INFO ] Flow matrix only has 375 transitions (discarded 60 similar events)
[2023-03-18 11:50:18] [INFO ] Invariant cache hit.
[2023-03-18 11:50:18] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1629 ms. Remains : 220/220 places, 435/435 transitions.
Graph (trivial) has 230 edges and 220 vertex of which 31 / 220 are part of one of the 13 SCC in 9 ms
Free SCC test removed 18 places
Drop transitions removed 36 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 97 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 202 transition count 337
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 201 transition count 337
Performed 41 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 85 place count 160 transition count 282
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 94 place count 160 transition count 273
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 127 place count 142 transition count 327
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 50 edges and 142 vertex of which 6 / 142 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 138 place count 137 transition count 317
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 145 place count 137 transition count 310
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 135 transition count 308
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 179 place count 135 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 135 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 134 transition count 277
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 190 place count 134 transition count 268
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 199 place count 125 transition count 268
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 211 place count 125 transition count 268
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 218 place count 125 transition count 261
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 125 transition count 261
Applied a total of 219 rules in 124 ms. Remains 125 /220 variables (removed 95) and now considering 261/435 (removed 174) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 261 rows 125 cols
[2023-03-18 11:50:18] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-18 11:50:18] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 11:50:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-18 11:50:19] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 11:50:19] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-18 11:50:19] [INFO ] After 522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-18 11:50:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 11 ms.
[2023-03-18 11:50:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 220 places, 435 transitions and 1600 arcs took 7 ms.
[2023-03-18 11:50:20] [INFO ] Flatten gal took : 218 ms
Total runtime 38173 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 --invariant=/tmp/741/inv_0_ --invariant=/tmp/741/inv_1_ --invariant=/tmp/741/inv_2_ --invariant=/tmp/741/inv_3_ --inv-par
FORMULA Peterson-PT-4-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-4-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-4-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679141579703

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name Peterson-PT-4-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/741/inv_0_
rfs formula name Peterson-PT-4-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/741/inv_1_
rfs formula name Peterson-PT-4-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/741/inv_2_
rfs formula name Peterson-PT-4-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/741/inv_3_
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 220 places, 435 transitions and 1600 arcs
pnml2lts-sym: Petri net Peterson_PT_4 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 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: 435->415 groups
pnml2lts-sym: Regrouping took 0.120 real 0.120 user 0.000 sys
pnml2lts-sym: state vector length is 220; there are 415 groups
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:
pnml2lts-sym: Invariant violation (/tmp/741/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/741/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/741/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/741/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 1357.490 real 5391.390 user 26.070 sys
pnml2lts-sym: max token count: 1

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="Peterson-PT-4"
export BK_EXAMINATION="ReachabilityCardinality"
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 Peterson-PT-4, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540300622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;