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 |
421.084 | 5912.00 | 18884.00 | 71.30 | TTTFTFTTFFTTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654352100654.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
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 r246-tall-171654352100654
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 07:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 07:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 355K May 18 16:43 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-2024-00
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-7A-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716710308219
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
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-26 07:58:29] [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]
[2024-05-26 07:58:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 07:58:29] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-26 07:58:29] [INFO ] Transformed 801 places.
[2024-05-26 07:58:29] [INFO ] Transformed 1544 transitions.
[2024-05-26 07:58:29] [INFO ] Found NUPN structural information;
[2024-05-26 07:58:29] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 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-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2301 ms. (17 steps per ms) remains 2/12 properties
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 308 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 2/2 properties
[2024-05-26 07:58:30] [INFO ] Flatten gal took : 396 ms
[2024-05-26 07:58:30] [INFO ] Flatten gal took : 81 ms
[2024-05-26 07:58:30] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
[2024-05-26 07:58:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1427896006385602136.gal : 49 ms
// Phase 1: matrix 1355 rows 801 cols
[2024-05-26 07:58:30] [INFO ] Computed 111 invariants in 43 ms
[2024-05-26 07:58:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11928121211991006537.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1427896006385602136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11928121211991006537.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-26 07:58:30] [INFO ] State equation strengthened by 38 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality11928121211991006537.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 378/412 variables, 39/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 378/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 54
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :54 after 154
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :154 after 172
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :172 after 343
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :343 after 26506
At refinement iteration 6 (OVERLAPS) 324/736 variables, 43/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 324/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :26506 after 2.29969e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 65/801 variables, 28/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/801 variables, 65/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.29969e+06 after 3.24409e+07
At refinement iteration 11 (INCLUDED_ONLY) 0/801 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.24409e+07 after 5.01197e+09
At refinement iteration 12 (OVERLAPS) 1355/2156 variables, 801/1713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2156 variables, 38/1751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2156 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2156 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2156/2156 variables, and 1751 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1077 ms.
Refiners :[Domain max(s): 801/801 constraints, Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 801/801 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 378/412 variables, 39/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.01197e+09 after 1.17518e+11
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 378/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 324/736 variables, 43/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 324/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 07:58:32] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 1/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 65/801 variables, 28/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/801 variables, 65/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/801 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1355/2156 variables, 801/1714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2156 variables, 38/1752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2156 variables, 2/1754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.17518e+11 after 3.1869e+13
At refinement iteration 16 (INCLUDED_ONLY) 0/2156 variables, 0/1754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2156 variables, 0/1754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2156/2156 variables, and 1754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1195 ms.
Refiners :[Domain max(s): 801/801 constraints, Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 801/801 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2500ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 478 ms.
Support contains 30 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Graph (trivial) has 709 edges and 801 vertex of which 97 / 801 are part of one of the 8 SCC in 4 ms
Free SCC test removed 89 places
Drop transitions (Empty/Sink Transition effects.) removed 178 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 196 transitions.
Discarding 172 places :
Symmetric choice reduction at 0 with 172 rule applications. Total rules 173 place count 540 transition count 988
Ensure Unique test removed 41 places
Iterating global reduction 0 with 213 rules applied. Total rules applied 386 place count 499 transition count 988
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 60 rules applied. Total rules applied 446 place count 499 transition count 928
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 450 place count 495 transition count 928
Performed 132 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 132 places in 2 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 714 place count 363 transition count 772
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 793 place count 363 transition count 693
Performed 14 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 821 place count 349 transition count 673
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 831 place count 349 transition count 663
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 859 place count 335 transition count 671
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 860 place count 335 transition count 670
Drop transitions (Redundant composition of simpler transitions.) removed 114 transitions
Redundant transition composition rules discarded 114 transitions
Iterating global reduction 5 with 114 rules applied. Total rules applied 974 place count 335 transition count 556
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 10 rules applied. Total rules applied 984 place count 326 transition count 555
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 986 place count 325 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 987 place count 324 transition count 554
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 987 place count 324 transition count 548
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 999 place count 318 transition count 548
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 8 with 2 rules applied. Total rules applied 1001 place count 317 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1003 place count 316 transition count 547
Free-agglomeration rule applied 46 times with reduction of 22 identical transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 1049 place count 316 transition count 479
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 8 with 75 rules applied. Total rules applied 1124 place count 270 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1133 place count 270 transition count 441
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1135 place count 270 transition count 439
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1139 place count 268 transition count 437
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 10 with 17 rules applied. Total rules applied 1156 place count 268 transition count 464
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 22 rules applied. Total rules applied 1178 place count 251 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 11 with 25 rules applied. Total rules applied 1203 place count 251 transition count 434
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 11 with 31 rules applied. Total rules applied 1234 place count 251 transition count 434
Applied a total of 1234 rules in 312 ms. Remains 251 /801 variables (removed 550) and now considering 434/1437 (removed 1003) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 251/801 places, 434/1437 transitions.
SDD proceeding with computation,2 properties remain. new max is 16384
RANDOM walk for 10112 steps (1 resets) in 55 ms. (180 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-7A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 4766 ms.
BK_STOP 1716710314131
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-5568"
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 r246-tall-171654352100654"
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 '
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 ;