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.r009-oct2-167813597300021.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-01b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597300021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 293K Mar 5 18:22 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 ASLink-PT-01b-UpperBounds-00
FORMULA_NAME ASLink-PT-01b-UpperBounds-01
FORMULA_NAME ASLink-PT-01b-UpperBounds-02
FORMULA_NAME ASLink-PT-01b-UpperBounds-03
FORMULA_NAME ASLink-PT-01b-UpperBounds-04
FORMULA_NAME ASLink-PT-01b-UpperBounds-05
FORMULA_NAME ASLink-PT-01b-UpperBounds-06
FORMULA_NAME ASLink-PT-01b-UpperBounds-07
FORMULA_NAME ASLink-PT-01b-UpperBounds-08
FORMULA_NAME ASLink-PT-01b-UpperBounds-09
FORMULA_NAME ASLink-PT-01b-UpperBounds-10
FORMULA_NAME ASLink-PT-01b-UpperBounds-11
FORMULA_NAME ASLink-PT-01b-UpperBounds-12
FORMULA_NAME ASLink-PT-01b-UpperBounds-13
FORMULA_NAME ASLink-PT-01b-UpperBounds-14
FORMULA_NAME ASLink-PT-01b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678602284483

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:24:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 06:24:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:24:47] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-12 06:24:47] [INFO ] Transformed 846 places.
[2023-03-12 06:24:47] [INFO ] Transformed 1148 transitions.
[2023-03-12 06:24:47] [INFO ] Found NUPN structural information;
[2023-03-12 06:24:47] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1148 rows 846 cols
[2023-03-12 06:24:47] [INFO ] Computed 82 place invariants in 38 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :13
FORMULA ASLink-PT-01b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
FORMULA ASLink-PT-01b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-01b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 06:24:47] [INFO ] Invariant cache hit.
[2023-03-12 06:24:48] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-12 06:24:48] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 64 ms returned sat
[2023-03-12 06:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:24:49] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2023-03-12 06:24:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:24:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-12 06:24:49] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 21 ms returned sat
[2023-03-12 06:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:24:50] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2023-03-12 06:24:51] [INFO ] Deduced a trap composed of 144 places in 729 ms of which 9 ms to minimize.
[2023-03-12 06:24:51] [INFO ] Deduced a trap composed of 156 places in 692 ms of which 2 ms to minimize.
[2023-03-12 06:24:52] [INFO ] Deduced a trap composed of 186 places in 478 ms of which 15 ms to minimize.
[2023-03-12 06:24:53] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 5 ms to minimize.
[2023-03-12 06:24:53] [INFO ] Deduced a trap composed of 34 places in 562 ms of which 1 ms to minimize.
[2023-03-12 06:24:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3640 ms
[2023-03-12 06:24:54] [INFO ] Computed and/alt/rep : 932/2112/932 causal constraints (skipped 215 transitions) in 118 ms.
[2023-03-12 06:24:55] [INFO ] Deduced a trap composed of 15 places in 753 ms of which 1 ms to minimize.
[2023-03-12 06:24:55] [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 0
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 846 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1147/1147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 845 transition count 959
Reduce places removed 188 places and 1 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 198 rules applied. Total rules applied 386 place count 657 transition count 948
Reduce places removed 4 places and 1 transitions.
Graph (complete) has 1975 edges and 653 vertex of which 652 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 391 place count 652 transition count 947
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 393 place count 650 transition count 945
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 395 place count 648 transition count 943
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 397 place count 646 transition count 941
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 400 place count 644 transition count 939
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 401 place count 643 transition count 939
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 189 Pre rules applied. Total rules applied 401 place count 643 transition count 750
Deduced a syphon composed of 189 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 8 with 391 rules applied. Total rules applied 792 place count 441 transition count 750
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 11 rules applied. Total rules applied 803 place count 440 transition count 740
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 813 place count 430 transition count 740
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 813 place count 430 transition count 736
Deduced a syphon composed of 4 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 825 place count 422 transition count 736
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 825 place count 422 transition count 732
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 833 place count 418 transition count 732
Discarding 24 places :
Symmetric choice reduction at 10 with 24 rule applications. Total rules 857 place count 394 transition count 708
Iterating global reduction 10 with 24 rules applied. Total rules applied 881 place count 394 transition count 708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 882 place count 394 transition count 707
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 10 Pre rules applied. Total rules applied 882 place count 394 transition count 697
Deduced a syphon composed of 10 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 21 rules applied. Total rules applied 903 place count 383 transition count 697
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 903 place count 383 transition count 696
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 906 place count 381 transition count 696
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 908 place count 379 transition count 681
Iterating global reduction 11 with 2 rules applied. Total rules applied 910 place count 379 transition count 681
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 910 place count 379 transition count 680
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 912 place count 378 transition count 680
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 913 place count 377 transition count 672
Iterating global reduction 11 with 1 rules applied. Total rules applied 914 place count 377 transition count 672
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 915 place count 376 transition count 664
Iterating global reduction 11 with 1 rules applied. Total rules applied 916 place count 376 transition count 664
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 917 place count 375 transition count 656
Iterating global reduction 11 with 1 rules applied. Total rules applied 918 place count 375 transition count 656
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 919 place count 374 transition count 648
Iterating global reduction 11 with 1 rules applied. Total rules applied 920 place count 374 transition count 648
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 921 place count 373 transition count 640
Iterating global reduction 11 with 1 rules applied. Total rules applied 922 place count 373 transition count 640
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 923 place count 372 transition count 632
Iterating global reduction 11 with 1 rules applied. Total rules applied 924 place count 372 transition count 632
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 925 place count 371 transition count 624
Iterating global reduction 11 with 1 rules applied. Total rules applied 926 place count 371 transition count 624
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 927 place count 370 transition count 616
Iterating global reduction 11 with 1 rules applied. Total rules applied 928 place count 370 transition count 616
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 929 place count 369 transition count 608
Iterating global reduction 11 with 1 rules applied. Total rules applied 930 place count 369 transition count 608
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 931 place count 368 transition count 600
Iterating global reduction 11 with 1 rules applied. Total rules applied 932 place count 368 transition count 600
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 933 place count 367 transition count 592
Iterating global reduction 11 with 1 rules applied. Total rules applied 934 place count 367 transition count 592
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 935 place count 366 transition count 584
Iterating global reduction 11 with 1 rules applied. Total rules applied 936 place count 366 transition count 584
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 937 place count 365 transition count 576
Iterating global reduction 11 with 1 rules applied. Total rules applied 938 place count 365 transition count 576
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 939 place count 364 transition count 568
Iterating global reduction 11 with 1 rules applied. Total rules applied 940 place count 364 transition count 568
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 941 place count 363 transition count 560
Iterating global reduction 11 with 1 rules applied. Total rules applied 942 place count 363 transition count 560
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 943 place count 362 transition count 552
Iterating global reduction 11 with 1 rules applied. Total rules applied 944 place count 362 transition count 552
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 11 with 84 rules applied. Total rules applied 1028 place count 320 transition count 510
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1029 place count 319 transition count 509
Ensure Unique test removed 1 places
Iterating global reduction 11 with 2 rules applied. Total rules applied 1031 place count 318 transition count 509
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1032 place count 317 transition count 508
Iterating global reduction 11 with 1 rules applied. Total rules applied 1033 place count 317 transition count 508
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 1035 place count 317 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1036 place count 316 transition count 506
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1038 place count 315 transition count 514
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1040 place count 315 transition count 512
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1042 place count 313 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1043 place count 312 transition count 511
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 3 rules applied. Total rules applied 1046 place count 310 transition count 510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1047 place count 309 transition count 510
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 3 Pre rules applied. Total rules applied 1047 place count 309 transition count 507
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 7 rules applied. Total rules applied 1054 place count 305 transition count 507
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 16 with 2 rules applied. Total rules applied 1056 place count 303 transition count 507
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 1056 place count 303 transition count 506
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1058 place count 302 transition count 506
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 17 with 6 rules applied. Total rules applied 1064 place count 299 transition count 503
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1065 place count 298 transition count 502
Iterating global reduction 17 with 1 rules applied. Total rules applied 1066 place count 298 transition count 502
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 1067 place count 298 transition count 501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1068 place count 297 transition count 501
Applied a total of 1068 rules in 593 ms. Remains 297 /846 variables (removed 549) and now considering 501/1147 (removed 646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 593 ms. Remains : 297/846 places, 501/1147 transitions.
// Phase 1: matrix 501 rows 297 cols
[2023-03-12 06:24:55] [INFO ] Computed 54 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 21324 resets, run finished after 1728 ms. (steps per millisecond=578 ) properties (out of 1) seen :1
FORMULA ASLink-PT-01b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10048 ms.
ITS solved all properties within timeout

BK_STOP 1678602297827

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 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="ASLink-PT-01b"
export BK_EXAMINATION="UpperBounds"
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 ASLink-PT-01b, 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 r009-oct2-167813597300021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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