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

About the Execution of ITS-Tools for NoC3x3-PT-7A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1512.344 26084.00 71786.00 342.90 TTTFTTTFTFTFFFTF 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.r261-smll-167863536200326.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 itstools
Input is NoC3x3-PT-7A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536200326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:20 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.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 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 355K 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-7A-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678893198324

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7A
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-15 15:13:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 15:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 15:13:21] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2023-03-15 15:13:21] [INFO ] Transformed 801 places.
[2023-03-15 15:13:21] [INFO ] Transformed 1544 transitions.
[2023-03-15 15:13:21] [INFO ] Found NUPN structural information;
[2023-03-15 15:13:21] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 15:13:22] [INFO ] Flatten gal took : 435 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 986 ms. (steps per millisecond=10 ) properties (out of 12) seen :7
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-15 15:13:23] [INFO ] Flatten gal took : 216 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
[2023-03-15 15:13:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10943873601051092386.gal : 113 ms
[2023-03-15 15:13:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality858684641602344978.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10943873601051092386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality858684641602344978.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 15:13:23] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
// Phase 1: matrix 1355 rows 801 cols
[2023-03-15 15:13:23] [INFO ] Computed 111 place invariants in 50 ms
Loading property file /tmp/ReachabilityCardinality858684641602344978.prop.
[2023-03-15 15:13:24] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :2 after 9
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :9 after 22
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :22 after 54
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :54 after 154
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :154 after 172
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :172 after 343
Invariant property NoC3x3-PT-7A-ReachabilityCardinality-11 does not hold.
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :343 after 26506
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :26506 after 940474
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :940474 after 2.35952e+06
[2023-03-15 15:13:24] [INFO ] [Nat]Absence check using 82 positive place invariants in 35 ms returned sat
[2023-03-15 15:13:24] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 13 ms returned sat
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2.35952e+06 after 8.36393e+07
[2023-03-15 15:13:25] [INFO ] After 863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 15:13:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 15:13:26] [INFO ] After 401ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 15:13:26] [INFO ] After 1077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 418 ms.
[2023-03-15 15:13:27] [INFO ] After 3033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 428 ms.
Support contains 53 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Graph (trivial) has 654 edges and 801 vertex of which 64 / 801 are part of one of the 7 SCC in 36 ms
Free SCC test removed 57 places
Drop transitions removed 113 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 121 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 744 transition count 1314
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 7 place count 742 transition count 1312
Discarding 164 places :
Symmetric choice reduction at 2 with 164 rule applications. Total rules 171 place count 578 transition count 1069
Ensure Unique test removed 34 places
Iterating global reduction 2 with 198 rules applied. Total rules applied 369 place count 544 transition count 1069
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 57 rules applied. Total rules applied 426 place count 544 transition count 1012
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 432 place count 538 transition count 1012
Performed 116 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 116 places in 3 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 664 place count 422 transition count 875
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 736 place count 422 transition count 803
Performed 9 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 754 place count 413 transition count 790
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 760 place count 413 transition count 784
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 792 place count 397 transition count 794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 794 place count 397 transition count 792
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 7 with 137 rules applied. Total rules applied 931 place count 397 transition count 655
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 12 rules applied. Total rules applied 943 place count 388 transition count 652
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 946 place count 385 transition count 652
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 946 place count 385 transition count 643
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 964 place count 376 transition count 643
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 9 with 4 rules applied. Total rules applied 968 place count 374 transition count 641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 970 place count 373 transition count 641
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 975 place count 373 transition count 636
Free-agglomeration rule applied 51 times with reduction of 21 identical transitions.
Iterating global reduction 9 with 51 rules applied. Total rules applied 1026 place count 373 transition count 564
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 76 rules applied. Total rules applied 1102 place count 322 transition count 539
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 1116 place count 322 transition count 525
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1119 place count 322 transition count 522
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1125 place count 319 transition count 519
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 11 with 23 rules applied. Total rules applied 1148 place count 319 transition count 544
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 28 rules applied. Total rules applied 1176 place count 296 transition count 539
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 12 with 26 rules applied. Total rules applied 1202 place count 296 transition count 513
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 12 with 25 rules applied. Total rules applied 1227 place count 296 transition count 513
Applied a total of 1227 rules in 768 ms. Remains 296 /801 variables (removed 505) and now considering 513/1437 (removed 924) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 769 ms. Remains : 296/801 places, 513/1437 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 5) seen :4
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 15:13:28] [INFO ] Flow matrix only has 509 transitions (discarded 4 similar events)
// Phase 1: matrix 509 rows 296 cols
[2023-03-15 15:13:28] [INFO ] Computed 68 place invariants in 10 ms
[2023-03-15 15:13:29] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:13:29] [INFO ] [Nat]Absence check using 59 positive place invariants in 38 ms returned sat
[2023-03-15 15:13:29] [INFO ] [Nat]Absence check using 59 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-15 15:13:30] [INFO ] After 765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:13:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-15 15:13:30] [INFO ] After 58ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 15:13:30] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-15 15:13:30] [INFO ] After 1167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 13 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 513/513 transitions.
Graph (trivial) has 121 edges and 296 vertex of which 18 / 296 are part of one of the 5 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 23 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 33 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 283 transition count 478
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 281 transition count 478
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 281 transition count 476
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 279 transition count 476
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 22 place count 266 transition count 459
Ensure Unique test removed 8 places
Iterating global reduction 2 with 21 rules applied. Total rules applied 43 place count 258 transition count 459
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 2 with 16 rules applied. Total rules applied 59 place count 258 transition count 443
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 254 transition count 443
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 71 place count 250 transition count 439
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 77 place count 247 transition count 440
Free-agglomeration rule applied 4 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 247 transition count 434
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 90 place count 243 transition count 429
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 93 place count 243 transition count 437
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 98 place count 240 transition count 435
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 105 place count 240 transition count 428
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 120 place count 240 transition count 428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 122 place count 240 transition count 426
Applied a total of 122 rules in 233 ms. Remains 240 /296 variables (removed 56) and now considering 426/513 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 240/296 places, 426/513 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 632038 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632038 steps, saw 546957 distinct states, run finished after 3002 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 426 rows 240 cols
[2023-03-15 15:13:33] [INFO ] Computed 60 place invariants in 13 ms
[2023-03-15 15:13:33] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:13:33] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-15 15:13:33] [INFO ] [Nat]Absence check using 57 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-15 15:13:34] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:13:34] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-15 15:13:34] [INFO ] After 43ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 15:13:34] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-03-15 15:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-03-15 15:13:34] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 15:13:34] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 13 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 426/426 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 240/240 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 426/426 transitions.
Applied a total of 0 rules in 12 ms. Remains 240 /240 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2023-03-15 15:13:34] [INFO ] Invariant cache hit.
[2023-03-15 15:13:34] [INFO ] Implicit Places using invariants in 344 ms returned [173, 197, 214, 239]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 347 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 236/240 places, 426/426 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 2 place count 236 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 234 transition count 424
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 6 place count 233 transition count 423
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 233 transition count 420
Applied a total of 9 rules in 29 ms. Remains 233 /236 variables (removed 3) and now considering 420/426 (removed 6) transitions.
// Phase 1: matrix 420 rows 233 cols
[2023-03-15 15:13:34] [INFO ] Computed 56 place invariants in 3 ms
[2023-03-15 15:13:35] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-15 15:13:35] [INFO ] Invariant cache hit.
[2023-03-15 15:13:35] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 15:13:35] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/240 places, 420/426 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1373 ms. Remains : 233/240 places, 420/426 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 868390 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 868390 steps, saw 749464 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 15:13:38] [INFO ] Invariant cache hit.
[2023-03-15 15:13:39] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:13:39] [INFO ] [Nat]Absence check using 56 positive place invariants in 16 ms returned sat
[2023-03-15 15:13:39] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:13:39] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 15:13:39] [INFO ] After 46ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 15:13:39] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-03-15 15:13:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-15 15:13:39] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 15:13:39] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 13 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 420/420 transitions.
Applied a total of 0 rules in 12 ms. Remains 233 /233 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 233/233 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 420/420 transitions.
Applied a total of 0 rules in 11 ms. Remains 233 /233 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-15 15:13:39] [INFO ] Invariant cache hit.
[2023-03-15 15:13:40] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-15 15:13:40] [INFO ] Invariant cache hit.
[2023-03-15 15:13:40] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 15:13:40] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2023-03-15 15:13:40] [INFO ] Redundant transitions in 63 ms returned [380, 381]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 418 rows 233 cols
[2023-03-15 15:13:40] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-15 15:13:41] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 233/233 places, 418/420 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 417
Applied a total of 2 rules in 35 ms. Remains 232 /233 variables (removed 1) and now considering 417/418 (removed 1) transitions.
// Phase 1: matrix 417 rows 232 cols
[2023-03-15 15:13:41] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-15 15:13:41] [INFO ] Implicit Places using invariants in 193 ms returned [231]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 231/233 places, 417/420 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 230 transition count 416
Applied a total of 2 rules in 10 ms. Remains 230 /231 variables (removed 1) and now considering 416/417 (removed 1) transitions.
// Phase 1: matrix 416 rows 230 cols
[2023-03-15 15:13:42] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-15 15:13:42] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-15 15:13:42] [INFO ] Invariant cache hit.
[2023-03-15 15:13:42] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-15 15:13:43] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 230/233 places, 416/420 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3369 ms. Remains : 230/233 places, 416/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Finished Best-First random walk after 3058 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=339 )
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 21706 ms.

BK_STOP 1678893224408

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-7A"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-7A, 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 r261-smll-167863536200326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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