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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 26 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678729023834

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=HirschbergSinclair-PT-35
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 17:37:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:37:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:37:06] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-13 17:37:06] [INFO ] Transformed 998 places.
[2023-03-13 17:37:06] [INFO ] Transformed 922 transitions.
[2023-03-13 17:37:06] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 867 ms. (steps per millisecond=11 ) properties (out of 16) seen :9
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 922 rows 998 cols
[2023-03-13 17:37:08] [INFO ] Computed 76 place invariants in 35 ms
[2023-03-13 17:37:09] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 17:37:09] [INFO ] [Nat]Absence check using 70 positive place invariants in 61 ms returned sat
[2023-03-13 17:37:09] [INFO ] [Nat]Absence check using 70 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-13 17:37:12] [INFO ] After 3072ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-13 17:37:13] [INFO ] Deduced a trap composed of 17 places in 533 ms of which 11 ms to minimize.
[2023-03-13 17:37:14] [INFO ] Deduced a trap composed of 17 places in 585 ms of which 3 ms to minimize.
[2023-03-13 17:37:14] [INFO ] Deduced a trap composed of 60 places in 566 ms of which 3 ms to minimize.
[2023-03-13 17:37:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1917 ms
[2023-03-13 17:37:16] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 2 ms to minimize.
[2023-03-13 17:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 472 ms
[2023-03-13 17:37:17] [INFO ] Deduced a trap composed of 58 places in 515 ms of which 2 ms to minimize.
[2023-03-13 17:37:17] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 1 ms to minimize.
[2023-03-13 17:37:18] [INFO ] Deduced a trap composed of 108 places in 382 ms of which 1 ms to minimize.
[2023-03-13 17:37:19] [INFO ] Deduced a trap composed of 64 places in 530 ms of which 4 ms to minimize.
[2023-03-13 17:37:19] [INFO ] Deduced a trap composed of 124 places in 452 ms of which 1 ms to minimize.
[2023-03-13 17:37:20] [INFO ] Deduced a trap composed of 30 places in 418 ms of which 1 ms to minimize.
[2023-03-13 17:37:20] [INFO ] Deduced a trap composed of 45 places in 362 ms of which 3 ms to minimize.
[2023-03-13 17:37:21] [INFO ] Deduced a trap composed of 30 places in 406 ms of which 1 ms to minimize.
[2023-03-13 17:37:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4799 ms
[2023-03-13 17:37:21] [INFO ] After 11694ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 1853 ms.
[2023-03-13 17:37:23] [INFO ] After 14239ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 83 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 958 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Discarding 40 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 317 rules applied. Total rules applied 318 place count 958 transition count 605
Reduce places removed 310 places and 0 transitions.
Graph (complete) has 1138 edges and 648 vertex of which 579 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.2 ms
Discarding 69 places :
Also discarding 0 output transitions
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 1 with 336 rules applied. Total rules applied 654 place count 579 transition count 580
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 2 with 94 rules applied. Total rules applied 748 place count 554 transition count 511
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 750 place count 552 transition count 509
Iterating global reduction 3 with 2 rules applied. Total rules applied 752 place count 552 transition count 509
Free-agglomeration rule (complex) applied 47 times.
Iterating global reduction 3 with 47 rules applied. Total rules applied 799 place count 552 transition count 462
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 846 place count 505 transition count 462
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 874 place count 477 transition count 434
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 15 rules applied. Total rules applied 889 place count 474 transition count 422
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 901 place count 462 transition count 422
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 901 place count 462 transition count 402
Deduced a syphon composed of 20 places in 9 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 941 place count 442 transition count 402
Applied a total of 941 rules in 289 ms. Remains 442 /998 variables (removed 556) and now considering 402/922 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 442/998 places, 402/922 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 402 rows 442 cols
[2023-03-13 17:37:24] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-13 17:37:24] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:37:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-13 17:37:24] [INFO ] [Nat]Absence check using 6 positive and 34 generalized place invariants in 79 ms returned sat
[2023-03-13 17:37:24] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:37:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-13 17:37:24] [INFO ] After 294ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 17:37:25] [INFO ] After 567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 294 ms.
[2023-03-13 17:37:25] [INFO ] After 1364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 27 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 402/402 transitions.
Graph (complete) has 806 edges and 442 vertex of which 433 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 433 transition count 360
Reduce places removed 37 places and 0 transitions.
Graph (complete) has 688 edges and 396 vertex of which 384 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 83 place count 384 transition count 358
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 97 place count 382 transition count 346
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 97 place count 382 transition count 326
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 137 place count 362 transition count 326
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 358 transition count 322
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 358 transition count 322
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 358 transition count 321
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 648 edges and 357 vertex of which 355 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 355 transition count 321
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 355 transition count 319
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 151 place count 354 transition count 318
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 354 transition count 318
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 157 place count 354 transition count 313
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 162 place count 349 transition count 313
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 346 transition count 310
Applied a total of 165 rules in 135 ms. Remains 346 /442 variables (removed 96) and now considering 310/402 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 346/442 places, 310/402 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 533842 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533842 steps, saw 120079 distinct states, run finished after 3013 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 310 rows 346 cols
[2023-03-13 17:37:28] [INFO ] Computed 36 place invariants in 4 ms
[2023-03-13 17:37:28] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:37:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 17:37:28] [INFO ] [Nat]Absence check using 11 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-13 17:37:29] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:37:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-13 17:37:29] [INFO ] After 187ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 17:37:29] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-13 17:37:29] [INFO ] After 756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 27 out of 346 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 310/310 transitions.
Applied a total of 0 rules in 20 ms. Remains 346 /346 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 346/346 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 346/346 places, 310/310 transitions.
Applied a total of 0 rules in 27 ms. Remains 346 /346 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-13 17:37:29] [INFO ] Invariant cache hit.
[2023-03-13 17:37:29] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-13 17:37:29] [INFO ] Invariant cache hit.
[2023-03-13 17:37:30] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-13 17:37:31] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1918 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 345/346 places, 310/310 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 345 transition count 304
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 339 transition count 304
Applied a total of 12 rules in 21 ms. Remains 339 /345 variables (removed 6) and now considering 304/310 (removed 6) transitions.
// Phase 1: matrix 304 rows 339 cols
[2023-03-13 17:37:31] [INFO ] Computed 35 place invariants in 3 ms
[2023-03-13 17:37:31] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-13 17:37:31] [INFO ] Invariant cache hit.
[2023-03-13 17:37:32] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-13 17:37:33] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 339/346 places, 304/310 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3645 ms. Remains : 339/346 places, 304/310 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 571406 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 571406 steps, saw 125114 distinct states, run finished after 3003 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 17:37:36] [INFO ] Invariant cache hit.
[2023-03-13 17:37:36] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:37:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 17:37:36] [INFO ] [Nat]Absence check using 10 positive and 25 generalized place invariants in 44 ms returned sat
[2023-03-13 17:37:36] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:37:36] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-13 17:37:36] [INFO ] After 112ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 17:37:36] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-13 17:37:37] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 27 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 304/304 transitions.
Applied a total of 0 rules in 14 ms. Remains 339 /339 variables (removed 0) and now considering 304/304 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 339/339 places, 304/304 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 304/304 transitions.
Applied a total of 0 rules in 14 ms. Remains 339 /339 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2023-03-13 17:37:37] [INFO ] Invariant cache hit.
[2023-03-13 17:37:37] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-13 17:37:37] [INFO ] Invariant cache hit.
[2023-03-13 17:37:37] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-13 17:37:38] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2023-03-13 17:37:38] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-13 17:37:38] [INFO ] Invariant cache hit.
[2023-03-13 17:37:39] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2248 ms. Remains : 339/339 places, 304/304 transitions.
Graph (complete) has 354 edges and 339 vertex of which 337 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 14 places
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 209 rules applied. Total rules applied 210 place count 323 transition count 109
Reduce places removed 195 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 204 rules applied. Total rules applied 414 place count 128 transition count 100
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 423 place count 119 transition count 100
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 423 place count 119 transition count 75
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 476 place count 91 transition count 75
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 479 place count 90 transition count 73
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 482 place count 88 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 87 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 483 place count 87 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 485 place count 86 transition count 71
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 6 with 4 rules applied. Total rules applied 489 place count 84 transition count 69
Applied a total of 489 rules in 27 ms. Remains 84 /339 variables (removed 255) and now considering 69/304 (removed 235) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 84 cols
[2023-03-13 17:37:39] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-13 17:37:39] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:37:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 17:37:39] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-13 17:37:39] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:37:39] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 17:37:39] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 17:37:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-13 17:37:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 339 places, 304 transitions and 1171 arcs took 4 ms.
[2023-03-13 17:37:39] [INFO ] Flatten gal took : 86 ms
Total runtime 33440 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/560/inv_0_ --inv-par
FORMULA HirschbergSinclair-PT-35-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678729075797

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 HirschbergSinclair-PT-35-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/560/inv_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 339 places, 304 transitions and 1171 arcs
pnml2lts-sym: Petri net leader 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: 304->299 groups
pnml2lts-sym: Regrouping took 0.120 real 0.120 user 0.000 sys
pnml2lts-sym: state vector length is 339; there are 299 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:
pnml2lts-sym: Invariant violation (/tmp/560/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 14.270 real 56.940 user 0.050 sys
pnml2lts-sym: max token count: 3

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="HirschbergSinclair-PT-35"
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 HirschbergSinclair-PT-35, 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 r201-smll-167840347800478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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