fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r265-smll-167863539800239
Last Updated
May 14, 2023

About the Execution of LTSMin+red for NoC3x3-PT-1B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
556.163 204217.00 750784.00 736.90 TTTFTTFFTTFTTFTF normal

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-167863539800239.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 NoC3x3-PT-1B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539800239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K Feb 26 09:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 09:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 362K 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 NoC3x3-PT-1B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678856052366

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 04:54:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 04:54:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 04:54:15] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2023-03-15 04:54:15] [INFO ] Transformed 1416 places.
[2023-03-15 04:54:15] [INFO ] Transformed 1640 transitions.
[2023-03-15 04:54:15] [INFO ] Found NUPN structural information;
[2023-03-15 04:54:15] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 16) seen :8
FORMULA NoC3x3-PT-1B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1640 rows 1416 cols
[2023-03-15 04:54:17] [INFO ] Computed 40 place invariants in 33 ms
[2023-03-15 04:54:18] [INFO ] After 1041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-15 04:54:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 53 ms returned sat
[2023-03-15 04:54:21] [INFO ] After 1851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 04:54:21] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 12 ms to minimize.
[2023-03-15 04:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-15 04:54:22] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2023-03-15 04:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-15 04:54:23] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2023-03-15 04:54:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 04:54:23] [INFO ] After 4050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1095 ms.
[2023-03-15 04:54:24] [INFO ] After 6129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA NoC3x3-PT-1B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 277 ms.
Support contains 132 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1127 edges and 1416 vertex of which 315 / 1416 are part of one of the 13 SCC in 22 ms
Free SCC test removed 302 places
Drop transitions removed 355 transitions
Reduce isomorphic transitions removed 355 transitions.
Drop transitions removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 302 place count 1114 transition count 984
Reduce places removed 301 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 331 rules applied. Total rules applied 633 place count 813 transition count 954
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 10 rules applied. Total rules applied 643 place count 805 transition count 952
Reduce places removed 1 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 3 with 101 rules applied. Total rules applied 744 place count 804 transition count 852
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 136 rules applied. Total rules applied 880 place count 704 transition count 816
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 883 place count 701 transition count 816
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 883 place count 701 transition count 807
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 901 place count 692 transition count 807
Discarding 138 places :
Symmetric choice reduction at 6 with 138 rule applications. Total rules 1039 place count 554 transition count 669
Iterating global reduction 6 with 138 rules applied. Total rules applied 1177 place count 554 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1178 place count 554 transition count 668
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 1178 place count 554 transition count 651
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1212 place count 537 transition count 651
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 1229 place count 520 transition count 629
Iterating global reduction 7 with 17 rules applied. Total rules applied 1246 place count 520 transition count 629
Performed 107 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 7 with 214 rules applied. Total rules applied 1460 place count 413 transition count 521
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1463 place count 413 transition count 518
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1464 place count 412 transition count 516
Iterating global reduction 8 with 1 rules applied. Total rules applied 1465 place count 412 transition count 516
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 1499 place count 395 transition count 581
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1506 place count 395 transition count 574
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 1519 place count 395 transition count 561
Free-agglomeration rule applied 49 times.
Iterating global reduction 9 with 49 rules applied. Total rules applied 1568 place count 395 transition count 512
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 53 rules applied. Total rules applied 1621 place count 346 transition count 508
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1624 place count 346 transition count 505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1625 place count 345 transition count 505
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 1631 place count 345 transition count 505
Applied a total of 1631 rules in 432 ms. Remains 345 /1416 variables (removed 1071) and now considering 505/1640 (removed 1135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 345/1416 places, 505/1640 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :1
FORMULA NoC3x3-PT-1B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 04:54:25] [INFO ] Flow matrix only has 504 transitions (discarded 1 similar events)
// Phase 1: matrix 504 rows 345 cols
[2023-03-15 04:54:25] [INFO ] Computed 39 place invariants in 4 ms
[2023-03-15 04:54:25] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 04:54:25] [INFO ] [Nat]Absence check using 39 positive place invariants in 22 ms returned sat
[2023-03-15 04:54:26] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-15 04:54:26] [INFO ] After 188ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:26] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2023-03-15 04:54:26] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2023-03-15 04:54:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-15 04:54:26] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2023-03-15 04:54:26] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2023-03-15 04:54:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-03-15 04:54:26] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-15 04:54:27] [INFO ] After 1391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 105 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 505/505 transitions.
Graph (trivial) has 55 edges and 345 vertex of which 12 / 345 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions removed 13 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 338 transition count 489
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 336 transition count 488
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 335 transition count 487
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 8 place count 335 transition count 481
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 20 place count 329 transition count 481
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 327 transition count 479
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 327 transition count 479
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 50 place count 314 transition count 466
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 61 place count 314 transition count 455
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 313 transition count 454
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 313 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 310 transition count 462
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 82 place count 310 transition count 449
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 310 transition count 448
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 91 place count 310 transition count 440
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 102 place count 302 transition count 437
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 104 place count 302 transition count 435
Applied a total of 104 rules in 119 ms. Remains 302 /345 variables (removed 43) and now considering 435/505 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 302/345 places, 435/505 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 255744 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255744 steps, saw 120124 distinct states, run finished after 3003 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 04:54:30] [INFO ] Flow matrix only has 434 transitions (discarded 1 similar events)
// Phase 1: matrix 434 rows 302 cols
[2023-03-15 04:54:30] [INFO ] Computed 39 place invariants in 3 ms
[2023-03-15 04:54:30] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 04:54:30] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-15 04:54:31] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 04:54:31] [INFO ] After 192ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:31] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-15 04:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-15 04:54:31] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2023-03-15 04:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-15 04:54:31] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2023-03-15 04:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-15 04:54:31] [INFO ] After 544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-15 04:54:31] [INFO ] After 1175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 105 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 435/435 transitions.
Applied a total of 0 rules in 12 ms. Remains 302 /302 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 302/302 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 435/435 transitions.
Applied a total of 0 rules in 19 ms. Remains 302 /302 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-15 04:54:32] [INFO ] Flow matrix only has 434 transitions (discarded 1 similar events)
[2023-03-15 04:54:32] [INFO ] Invariant cache hit.
[2023-03-15 04:54:32] [INFO ] Implicit Places using invariants in 162 ms returned [150, 266]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 165 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 300/302 places, 435/435 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 300 transition count 433
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 298 transition count 431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 297 transition count 430
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 297 transition count 426
Applied a total of 12 rules in 21 ms. Remains 297 /300 variables (removed 3) and now considering 426/435 (removed 9) transitions.
[2023-03-15 04:54:32] [INFO ] Flow matrix only has 425 transitions (discarded 1 similar events)
// Phase 1: matrix 425 rows 297 cols
[2023-03-15 04:54:32] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-15 04:54:32] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-15 04:54:32] [INFO ] Flow matrix only has 425 transitions (discarded 1 similar events)
[2023-03-15 04:54:32] [INFO ] Invariant cache hit.
[2023-03-15 04:54:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 04:54:32] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 297/302 places, 426/435 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 800 ms. Remains : 297/302 places, 426/435 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 297040 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 297040 steps, saw 151840 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 04:54:36] [INFO ] Flow matrix only has 425 transitions (discarded 1 similar events)
[2023-03-15 04:54:36] [INFO ] Invariant cache hit.
[2023-03-15 04:54:36] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 04:54:36] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2023-03-15 04:54:36] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 04:54:36] [INFO ] After 164ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2023-03-15 04:54:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-15 04:54:37] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2023-03-15 04:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-15 04:54:37] [INFO ] After 471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 162 ms.
[2023-03-15 04:54:37] [INFO ] After 1082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 105 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 426/426 transitions.
Applied a total of 0 rules in 9 ms. Remains 297 /297 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 297/297 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 426/426 transitions.
Applied a total of 0 rules in 8 ms. Remains 297 /297 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2023-03-15 04:54:37] [INFO ] Flow matrix only has 425 transitions (discarded 1 similar events)
[2023-03-15 04:54:37] [INFO ] Invariant cache hit.
[2023-03-15 04:54:37] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-15 04:54:37] [INFO ] Flow matrix only has 425 transitions (discarded 1 similar events)
[2023-03-15 04:54:37] [INFO ] Invariant cache hit.
[2023-03-15 04:54:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-15 04:54:37] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-15 04:54:37] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-15 04:54:37] [INFO ] Flow matrix only has 425 transitions (discarded 1 similar events)
[2023-03-15 04:54:37] [INFO ] Invariant cache hit.
[2023-03-15 04:54:38] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 297/297 places, 426/426 transitions.
Graph (trivial) has 31 edges and 297 vertex of which 3 / 297 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 729 edges and 295 vertex of which 294 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 294 transition count 418
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 290 transition count 417
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 289 transition count 416
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 25 place count 283 transition count 410
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 283 transition count 406
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 283 transition count 403
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 36 place count 283 transition count 399
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 40 place count 279 transition count 399
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 48 place count 279 transition count 399
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 279 transition count 398
Applied a total of 49 rules in 53 ms. Remains 279 /297 variables (removed 18) and now considering 398/426 (removed 28) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 398 rows 279 cols
[2023-03-15 04:54:38] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-15 04:54:38] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 04:54:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-15 04:54:38] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 04:54:38] [INFO ] After 143ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2023-03-15 04:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-15 04:54:39] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2023-03-15 04:54:39] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2023-03-15 04:54:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-15 04:54:39] [INFO ] After 480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-15 04:54:39] [INFO ] After 1046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-15 04:54:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2023-03-15 04:54:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 297 places, 426 transitions and 1232 arcs took 5 ms.
[2023-03-15 04:54:39] [INFO ] Flatten gal took : 153 ms
Total runtime 24642 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 --inv-bin-par --invariant=/tmp/569/inv_0_ --invariant=/tmp/569/inv_1_ --invariant=/tmp/569/inv_2_ --inv-par
FORMULA NoC3x3-PT-1B-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA NoC3x3-PT-1B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA NoC3x3-PT-1B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678856256583

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name NoC3x3-PT-1B-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/569/inv_0_
rfs formula name NoC3x3-PT-1B-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/569/inv_1_
rfs formula name NoC3x3-PT-1B-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/569/inv_2_
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 297 places, 426 transitions and 1232 arcs
pnml2lts-sym: Petri net NoC3x3_PT_1B 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: 426->389 groups
pnml2lts-sym: Regrouping took 0.100 real 0.100 user 0.000 sys
pnml2lts-sym: state vector length is 297; there are 389 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/569/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/569/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/569/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 174.780 real 698.070 user 0.120 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="NoC3x3-PT-1B"
export BK_EXAMINATION="ReachabilityFireability"
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 NoC3x3-PT-1B, examination is ReachabilityFireability"
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-167863539800239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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