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.r245-tall-171654350400653.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 greatspnxred
Input is NoC3x3-PT-7A, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350400653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-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 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716696437176

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 04:07:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 04:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:07:18] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-26 04:07:18] [INFO ] Transformed 801 places.
[2024-05-26 04:07:18] [INFO ] Transformed 1544 transitions.
[2024-05-26 04:07:18] [INFO ] Found NUPN structural information;
[2024-05-26 04:07:18] [INFO ] Parsed PT model containing 801 places and 1544 transitions and 4519 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 107 transitions
Reduce redundant transitions removed 107 transitions.
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]
[2024-05-26 04:07:18] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
// Phase 1: matrix 1355 rows 801 cols
[2024-05-26 04:07:18] [INFO ] Computed 111 invariants in 50 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 (2 resets) in 82 ms. (120 steps per ms)
FORMULA NoC3x3-PT-7A-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-7A-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 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 04:07:18] [INFO ] Flow matrix only has 1355 transitions (discarded 82 similar events)
[2024-05-26 04:07:18] [INFO ] Invariant cache hit.
[2024-05-26 04:07:19] [INFO ] [Real]Absence check using 82 positive place invariants in 32 ms returned sat
[2024-05-26 04:07:19] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-26 04:07:19] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2024-05-26 04:07:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-26 04:07:19] [INFO ] [Real]Added 38 Read/Feed constraints in 17 ms returned sat
[2024-05-26 04:07:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:07:20] [INFO ] [Nat]Absence check using 82 positive place invariants in 35 ms returned sat
[2024-05-26 04:07:20] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-26 04:07:20] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2024-05-26 04:07:20] [INFO ] [Nat]Added 38 Read/Feed constraints in 9 ms returned sat
[2024-05-26 04:07:20] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 89 ms.
[2024-05-26 04:07:24] [INFO ] Added : 340 causal constraints over 68 iterations in 4373 ms. Result :unknown
[2024-05-26 04:07:24] [INFO ] [Real]Absence check using 82 positive place invariants in 26 ms returned sat
[2024-05-26 04:07:25] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-26 04:07:25] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2024-05-26 04:07:25] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-05-26 04:07:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:07:25] [INFO ] [Nat]Absence check using 82 positive place invariants in 27 ms returned sat
[2024-05-26 04:07:25] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-26 04:07:25] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2024-05-26 04:07:25] [INFO ] [Nat]Added 38 Read/Feed constraints in 11 ms returned sat
[2024-05-26 04:07:25] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 74 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-26 04:07:30] [INFO ] [Real]Absence check using 82 positive place invariants in 27 ms returned sat
[2024-05-26 04:07:30] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-26 04:07:30] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-05-26 04:07:30] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2024-05-26 04:07:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:07:31] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2024-05-26 04:07:31] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-26 04:07:31] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2024-05-26 04:07:31] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-05-26 04:07:31] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 69 ms.
[2024-05-26 04:07:35] [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 2
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 04:07:36] [INFO ] [Real]Absence check using 82 positive place invariants in 29 ms returned sat
[2024-05-26 04:07:36] [INFO ] [Real]Absence check using 82 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-26 04:07:36] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-05-26 04:07:36] [INFO ] [Real]Added 38 Read/Feed constraints in 7 ms returned sat
[2024-05-26 04:07:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 04:07:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 29 ms returned sat
[2024-05-26 04:07:36] [INFO ] [Nat]Absence check using 82 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-26 04:07:36] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2024-05-26 04:07:36] [INFO ] [Nat]Added 38 Read/Feed constraints in 10 ms returned sat
[2024-05-26 04:07:37] [INFO ] Computed and/alt/rep : 1239/4104/1238 causal constraints (skipped 116 transitions) in 75 ms.
[2024-05-26 04:07:41] [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 3
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)
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:[1, 1, 1, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1437/1437 transitions.
Graph (trivial) has 750 edges and 801 vertex of which 110 / 801 are part of one of the 9 SCC in 4 ms
Free SCC test removed 101 places
Drop transitions (Empty/Sink Transition effects.) removed 204 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 222 transitions.
Discarding 177 places :
Symmetric choice reduction at 0 with 177 rule applications. Total rules 178 place count 523 transition count 954
Ensure Unique test removed 42 places
Iterating global reduction 0 with 219 rules applied. Total rules applied 397 place count 481 transition count 954
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 77 rules applied. Total rules applied 474 place count 481 transition count 877
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 488 place count 467 transition count 877
Performed 134 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 134 places in 1 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 756 place count 333 transition count 720
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 2 with 83 rules applied. Total rules applied 839 place count 333 transition count 637
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 869 place count 318 transition count 616
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 880 place count 318 transition count 605
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 908 place count 304 transition count 613
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 4 with 102 rules applied. Total rules applied 1010 place count 304 transition count 511
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1019 place count 295 transition count 511
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1019 place count 295 transition count 504
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1033 place count 288 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1037 place count 286 transition count 502
Free-agglomeration rule applied 42 times with reduction of 23 identical transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1079 place count 286 transition count 437
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 71 rules applied. Total rules applied 1150 place count 244 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1158 place count 244 transition count 400
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1160 place count 244 transition count 398
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1163 place count 242 transition count 397
Free-agglomeration rule (complex) applied 16 times with reduction of 2 identical transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1179 place count 242 transition count 436
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1202 place count 226 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 1236 place count 226 transition count 395
Partial Free-agglomeration rule applied 35 times.
Drop transitions (Partial Free agglomeration) removed 35 transitions
Iterating global reduction 8 with 35 rules applied. Total rules applied 1271 place count 226 transition count 395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1272 place count 225 transition count 394
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1275 place count 222 transition count 394
Applied a total of 1275 rules in 275 ms. Remains 222 /801 variables (removed 579) and now considering 394/1437 (removed 1043) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 222/801 places, 394/1437 transitions.
// Phase 1: matrix 394 rows 222 cols
[2024-05-26 04:07:42] [INFO ] Computed 57 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 0] Max Struct:[1, 1, 1, 1]
FORMULA NoC3x3-PT-7A-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7A-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 3721 ms. (268 steps per ms)
FORMULA NoC3x3-PT-7A-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 936 ms. (1067 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 28639 ms.
ITS solved all properties within timeout

BK_STOP 1716696467003

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NoC3x3-PT-7A, 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 r245-tall-171654350400653"
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 [ "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 ;