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-171654351900581.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-2B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351900581
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 548K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716694368197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-26 03:32:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 03:32:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:32:49] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-05-26 03:32:49] [INFO ] Transformed 2003 places.
[2024-05-26 03:32:49] [INFO ] Transformed 2292 transitions.
[2024-05-26 03:32:49] [INFO ] Found NUPN structural information;
[2024-05-26 03:32:49] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2292 rows 2003 cols
[2024-05-26 03:32:49] [INFO ] Computed 66 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (16 resets) in 64 ms. (153 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-26 03:32:50] [INFO ] Invariant cache hit.
[2024-05-26 03:32:50] [INFO ] [Real]Absence check using 66 positive place invariants in 59 ms returned sat
[2024-05-26 03:32:51] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-26 03:32:52] [INFO ] Deduced a trap composed of 28 places in 490 ms of which 51 ms to minimize.
[2024-05-26 03:32:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:32:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 72 ms returned sat
[2024-05-26 03:32:53] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2024-05-26 03:32:53] [INFO ] Deduced a trap composed of 28 places in 310 ms of which 7 ms to minimize.
[2024-05-26 03:32:54] [INFO ] Deduced a trap composed of 37 places in 364 ms of which 6 ms to minimize.
[2024-05-26 03:32:54] [INFO ] Deduced a trap composed of 56 places in 323 ms of which 5 ms to minimize.
[2024-05-26 03:32:55] [INFO ] Deduced a trap composed of 70 places in 352 ms of which 6 ms to minimize.
[2024-05-26 03:32:55] [INFO ] Deduced a trap composed of 76 places in 268 ms of which 4 ms to minimize.
[2024-05-26 03:32:55] [INFO ] Deduced a trap composed of 80 places in 330 ms of which 4 ms to minimize.
[2024-05-26 03:32:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2478 ms
[2024-05-26 03:32:55] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 112 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-26 03:32:57] [INFO ] [Real]Absence check using 66 positive place invariants in 60 ms returned sat
[2024-05-26 03:32:58] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2024-05-26 03:32:58] [INFO ] Deduced a trap composed of 75 places in 367 ms of which 7 ms to minimize.
[2024-05-26 03:32:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:32:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 57 ms returned sat
[2024-05-26 03:33:00] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2024-05-26 03:33:00] [INFO ] Deduced a trap composed of 75 places in 289 ms of which 5 ms to minimize.
[2024-05-26 03:33:00] [INFO ] Deduced a trap composed of 45 places in 296 ms of which 6 ms to minimize.
[2024-05-26 03:33:01] [INFO ] Deduced a trap composed of 74 places in 234 ms of which 5 ms to minimize.
[2024-05-26 03:33:01] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 4 ms to minimize.
[2024-05-26 03:33:01] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 4 ms to minimize.
[2024-05-26 03:33:01] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 3 ms to minimize.
[2024-05-26 03:33:02] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 2 ms to minimize.
[2024-05-26 03:33:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2039 ms
[2024-05-26 03:33:02] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 126 ms.
[2024-05-26 03:33:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 03:33:04] [INFO ] [Real]Absence check using 66 positive place invariants in 53 ms returned sat
[2024-05-26 03:33:05] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-05-26 03:33:05] [INFO ] Deduced a trap composed of 84 places in 436 ms of which 8 ms to minimize.
[2024-05-26 03:33:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:33:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 57 ms returned sat
[2024-05-26 03:33:06] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2024-05-26 03:33:07] [INFO ] Deduced a trap composed of 84 places in 439 ms of which 8 ms to minimize.
[2024-05-26 03:33:07] [INFO ] Deduced a trap composed of 53 places in 370 ms of which 6 ms to minimize.
[2024-05-26 03:33:08] [INFO ] Deduced a trap composed of 104 places in 363 ms of which 7 ms to minimize.
[2024-05-26 03:33:08] [INFO ] Deduced a trap composed of 72 places in 243 ms of which 4 ms to minimize.
[2024-05-26 03:33:08] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 3 ms to minimize.
[2024-05-26 03:33:09] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-05-26 03:33:09] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 3 ms to minimize.
[2024-05-26 03:33:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2474 ms
[2024-05-26 03:33:09] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 116 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-26 03:33:11] [INFO ] [Real]Absence check using 66 positive place invariants in 55 ms returned sat
[2024-05-26 03:33:11] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2024-05-26 03:33:12] [INFO ] Deduced a trap composed of 28 places in 286 ms of which 6 ms to minimize.
[2024-05-26 03:33:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 03:33:12] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2024-05-26 03:33:13] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2024-05-26 03:33:13] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 5 ms to minimize.
[2024-05-26 03:33:14] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 5 ms to minimize.
[2024-05-26 03:33:14] [INFO ] Deduced a trap composed of 91 places in 249 ms of which 4 ms to minimize.
[2024-05-26 03:33:14] [INFO ] Deduced a trap composed of 168 places in 245 ms of which 4 ms to minimize.
[2024-05-26 03:33:15] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 5 ms to minimize.
[2024-05-26 03:33:15] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 4 ms to minimize.
[2024-05-26 03:33:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1910 ms
[2024-05-26 03:33:15] [INFO ] Computed and/alt/rep : 2240/4929/2240 causal constraints (skipped 51 transitions) in 116 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1629 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 15 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 0 with 413 rules applied. Total rules applied 414 place count 1931 transition count 1816
Reduce places removed 404 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 405 rules applied. Total rules applied 819 place count 1527 transition count 1815
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 820 place count 1526 transition count 1815
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 820 place count 1526 transition count 1791
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 868 place count 1502 transition count 1791
Discarding 348 places :
Symmetric choice reduction at 3 with 348 rule applications. Total rules 1216 place count 1154 transition count 1443
Iterating global reduction 3 with 348 rules applied. Total rules applied 1564 place count 1154 transition count 1443
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1564 place count 1154 transition count 1402
Deduced a syphon composed of 41 places in 8 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1646 place count 1113 transition count 1402
Discarding 131 places :
Symmetric choice reduction at 3 with 131 rule applications. Total rules 1777 place count 982 transition count 1231
Iterating global reduction 3 with 131 rules applied. Total rules applied 1908 place count 982 transition count 1231
Discarding 122 places :
Symmetric choice reduction at 3 with 122 rule applications. Total rules 2030 place count 860 transition count 1096
Iterating global reduction 3 with 122 rules applied. Total rules applied 2152 place count 860 transition count 1096
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 2199 place count 813 transition count 1013
Iterating global reduction 3 with 47 rules applied. Total rules applied 2246 place count 813 transition count 1013
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 17 rules applied. Total rules applied 2263 place count 811 transition count 998
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2265 place count 809 transition count 998
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 2299 place count 775 transition count 964
Iterating global reduction 5 with 34 rules applied. Total rules applied 2333 place count 775 transition count 964
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 2337 place count 773 transition count 962
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2339 place count 771 transition count 962
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 2362 place count 748 transition count 916
Iterating global reduction 7 with 23 rules applied. Total rules applied 2385 place count 748 transition count 916
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 2408 place count 725 transition count 893
Iterating global reduction 7 with 23 rules applied. Total rules applied 2431 place count 725 transition count 893
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 29 rules applied. Total rules applied 2460 place count 722 transition count 867
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2463 place count 719 transition count 867
Performed 301 Post agglomeration using F-continuation condition.Transition count delta: 301
Deduced a syphon composed of 301 places in 1 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 9 with 602 rules applied. Total rules applied 3065 place count 418 transition count 566
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 3077 place count 406 transition count 554
Iterating global reduction 9 with 12 rules applied. Total rules applied 3089 place count 406 transition count 554
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 3098 place count 397 transition count 536
Iterating global reduction 9 with 9 rules applied. Total rules applied 3107 place count 397 transition count 536
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3109 place count 395 transition count 532
Iterating global reduction 9 with 2 rules applied. Total rules applied 3111 place count 395 transition count 532
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 3143 place count 379 transition count 555
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 3166 place count 379 transition count 532
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 30 rules applied. Total rules applied 3196 place count 356 transition count 525
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3197 place count 356 transition count 524
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3198 place count 355 transition count 524
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3199 place count 355 transition count 524
Applied a total of 3199 rules in 709 ms. Remains 355 /2003 variables (removed 1648) and now considering 524/2292 (removed 1768) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 355/2003 places, 524/2292 transitions.
// Phase 1: matrix 524 rows 355 cols
[2024-05-26 03:33:18] [INFO ] Computed 53 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (13924 resets) in 3808 ms. (262 steps per ms)
FORMULA NoC3x3-PT-2B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-2B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (789 resets) in 1164 ms. (858 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-26 03:33:23] [INFO ] Flatten gal took : 105 ms
[2024-05-26 03:33:23] [INFO ] Flatten gal took : 56 ms
[2024-05-26 03:33:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8490263365001752681.gal : 24 ms
[2024-05-26 03:33:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17063389455804182774.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/ReachabilityCardinality8490263365001752681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17063389455804182774.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 34247 ms.

BK_STOP 1716694403669

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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-2B"
export BK_EXAMINATION="UpperBounds"
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-2B, examination is UpperBounds"
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-171654351900581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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