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

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678855849174

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 04:50:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 04:50:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 04:50:52] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-15 04:50:52] [INFO ] Transformed 1416 places.
[2023-03-15 04:50:52] [INFO ] Transformed 1640 transitions.
[2023-03-15 04:50:52] [INFO ] Found NUPN structural information;
[2023-03-15 04:50:52] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 8 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 14) seen :8
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-02 FALSE 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) 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 6) seen :1
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1640 rows 1416 cols
[2023-03-15 04:50:53] [INFO ] Computed 40 place invariants in 32 ms
[2023-03-15 04:50:54] [INFO ] After 922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 04:50:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 56 ms returned sat
[2023-03-15 04:50:57] [INFO ] After 1553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 04:50:57] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 10 ms to minimize.
[2023-03-15 04:50:58] [INFO ] Deduced a trap composed of 88 places in 285 ms of which 2 ms to minimize.
[2023-03-15 04:50:58] [INFO ] Deduced a trap composed of 102 places in 273 ms of which 1 ms to minimize.
[2023-03-15 04:50:58] [INFO ] Deduced a trap composed of 70 places in 239 ms of which 2 ms to minimize.
[2023-03-15 04:50:58] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 2 ms to minimize.
[2023-03-15 04:50:59] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 1 ms to minimize.
[2023-03-15 04:50:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1893 ms
[2023-03-15 04:50:59] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 1 ms to minimize.
[2023-03-15 04:50:59] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 1 ms to minimize.
[2023-03-15 04:50:59] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 1 ms to minimize.
[2023-03-15 04:51:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 613 ms
[2023-03-15 04:51:00] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 11 ms to minimize.
[2023-03-15 04:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-15 04:51:00] [INFO ] After 5013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 595 ms.
[2023-03-15 04:51:01] [INFO ] After 6402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 172 ms.
Support contains 39 out of 1416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1371 edges and 1416 vertex of which 659 / 1416 are part of one of the 20 SCC in 11 ms
Free SCC test removed 639 places
Drop transitions removed 767 transitions
Reduce isomorphic transitions removed 767 transitions.
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 178 rules applied. Total rules applied 179 place count 777 transition count 695
Reduce places removed 178 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 215 rules applied. Total rules applied 394 place count 599 transition count 658
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 25 rules applied. Total rules applied 419 place count 590 transition count 642
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 17 rules applied. Total rules applied 436 place count 575 transition count 640
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 437 place count 574 transition count 640
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 437 place count 574 transition count 635
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 447 place count 569 transition count 635
Discarding 159 places :
Symmetric choice reduction at 5 with 159 rule applications. Total rules 606 place count 410 transition count 476
Iterating global reduction 5 with 159 rules applied. Total rules applied 765 place count 410 transition count 476
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 766 place count 410 transition count 475
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 766 place count 410 transition count 451
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 814 place count 386 transition count 451
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 836 place count 364 transition count 422
Iterating global reduction 6 with 22 rules applied. Total rules applied 858 place count 364 transition count 422
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 6 with 190 rules applied. Total rules applied 1048 place count 269 transition count 327
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1051 place count 269 transition count 324
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1053 place count 267 transition count 319
Iterating global reduction 7 with 2 rules applied. Total rules applied 1055 place count 267 transition count 319
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1065 place count 262 transition count 368
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1066 place count 262 transition count 367
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1071 place count 262 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1073 place count 261 transition count 373
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1074 place count 261 transition count 372
Free-agglomeration rule applied 90 times.
Iterating global reduction 9 with 90 rules applied. Total rules applied 1164 place count 261 transition count 282
Reduce places removed 90 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 501 edges and 171 vertex of which 160 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 102 rules applied. Total rules applied 1266 place count 160 transition count 271
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1280 place count 160 transition count 257
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 1287 place count 160 transition count 250
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1290 place count 157 transition count 250
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 1292 place count 157 transition count 250
Applied a total of 1292 rules in 307 ms. Remains 157 /1416 variables (removed 1259) and now considering 250/1640 (removed 1390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 157/1416 places, 250/1640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 250 rows 157 cols
[2023-03-15 04:51:01] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 04:51:01] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 04:51:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-15 04:51:02] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 04:51:02] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-15 04:51:02] [INFO ] After 50ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 04:51:02] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-15 04:51:02] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 89 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=89 )
FORMULA NoC3x3-PT-1B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 10102 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/494/inv_0_ --invariant=/tmp/494/inv_1_ --invariant=/tmp/494/inv_2_ --invariant=/tmp/494/inv_3_ --invariant=/tmp/494/inv_4_ --invariant=/tmp/494/inv_5_ --invariant=/tmp/494/inv_6_ --invariant=/tmp/494/inv_7_ --invariant=/tmp/494/inv_8_ --invariant=/tmp/494/inv_9_ --invariant=/tmp/494/inv_10_ --invariant=/tmp/494/inv_11_ --invariant=/tmp/494/inv_12_ --invariant=/tmp/494/inv_13_ --invariant=/tmp/494/inv_14_ --invariant=/tmp/494/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 7958224 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16094628 kB
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-00
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-01
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-02
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-03
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-04
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-05
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-06
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-07
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-08
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-09
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-10
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-11
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-12
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-13
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-14
Could not compute solution for formula : NoC3x3-PT-1B-ReachabilityCardinality-15

BK_STOP 1678859434816

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_0_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_1_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_2_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_3_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_4_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_5_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_6_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_7_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_8_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_9_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_10_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_11_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_12_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_13_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_14_
rfs formula name NoC3x3-PT-1B-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_15_
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 1416 places, 1640 transitions and 3639 arcs
pnml2lts-sym: Petri net NoC3x3-PT-1B analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.020 user 0.010 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: 1640->1640 groups
pnml2lts-sym: Regrouping took 1.010 real 1.000 user 0.010 sys
pnml2lts-sym: state vector length is 1416; there are 1640 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 500
Killing (9) : 500

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="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is NoC3x3-PT-1B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863539800238"
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 [ "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 ;