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.r201-smll-167840347400157.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 GPUForwardProgress-PT-40b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347400157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.8K Feb 25 14:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 14:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 25 14:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 14:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 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 199K 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 GPUForwardProgress-PT-40b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678609695710

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=GPUForwardProgress-PT-40b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:28:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 08:28:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:28:19] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-12 08:28:19] [INFO ] Transformed 796 places.
[2023-03-12 08:28:19] [INFO ] Transformed 837 transitions.
[2023-03-12 08:28:19] [INFO ] Found NUPN structural information;
[2023-03-12 08:28:19] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
FORMULA GPUForwardProgress-PT-40b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 837 rows 796 cols
[2023-03-12 08:28:19] [INFO ] Computed 42 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 30 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 15) seen :8
FORMULA GPUForwardProgress-PT-40b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
[2023-03-12 08:28:20] [INFO ] Invariant cache hit.
[2023-03-12 08:28:20] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 94 ms returned sat
[2023-03-12 08:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:21] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-12 08:28:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:28:22] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 43 ms returned sat
[2023-03-12 08:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:22] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2023-03-12 08:28:23] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 116 ms.
[2023-03-12 08:28:26] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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)
[2023-03-12 08:28:26] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 74 ms returned sat
[2023-03-12 08:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:27] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-12 08:28:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:28:27] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 37 ms returned sat
[2023-03-12 08:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:28] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2023-03-12 08:28:28] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 66 ms.
[2023-03-12 08:28:31] [INFO ] Added : 181 causal constraints over 37 iterations in 2883 ms. Result :sat
Minimization took 272 ms.
[2023-03-12 08:28:31] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 63 ms returned sat
[2023-03-12 08:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:32] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2023-03-12 08:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:28:32] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 61 ms returned sat
[2023-03-12 08:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:33] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-12 08:28:33] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 107 ms.
[2023-03-12 08:28:37] [INFO ] Added : 197 causal constraints over 40 iterations in 3678 ms. Result :sat
Minimization took 253 ms.
[2023-03-12 08:28:37] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 62 ms returned sat
[2023-03-12 08:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:38] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-12 08:28:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:28:38] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 63 ms returned sat
[2023-03-12 08:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:39] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2023-03-12 08:28:39] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 83 ms.
[2023-03-12 08:28:43] [INFO ] Added : 238 causal constraints over 48 iterations in 4096 ms. Result :unknown
[2023-03-12 08:28:43] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 57 ms returned sat
[2023-03-12 08:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:44] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2023-03-12 08:28:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:28:44] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 53 ms returned sat
[2023-03-12 08:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:45] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2023-03-12 08:28:45] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 81 ms.
[2023-03-12 08:28:47] [INFO ] Added : 126 causal constraints over 26 iterations in 2047 ms. Result :sat
Minimization took 210 ms.
[2023-03-12 08:28:48] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 62 ms returned sat
[2023-03-12 08:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:48] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2023-03-12 08:28:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:28:48] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 56 ms returned sat
[2023-03-12 08:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:49] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2023-03-12 08:28:49] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 90 ms.
[2023-03-12 08:28:52] [INFO ] Added : 191 causal constraints over 39 iterations in 2777 ms. Result :sat
Minimization took 240 ms.
[2023-03-12 08:28:52] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 60 ms returned sat
[2023-03-12 08:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:53] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-12 08:28:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:28:53] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 54 ms returned sat
[2023-03-12 08:28:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:28:54] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-12 08:28:54] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 81 ms.
[2023-03-12 08:28:56] [INFO ] Added : 162 causal constraints over 33 iterations in 2439 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-40b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 796 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 836/836 transitions.
Graph (trivial) has 712 edges and 796 vertex of which 7 / 796 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1199 edges and 790 vertex of which 745 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.5 ms
Discarding 45 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 453 transitions
Trivial Post-agglo rules discarded 453 transitions
Performed 453 trivial Post agglomeration. Transition count delta: 453
Iterating post reduction 0 with 456 rules applied. Total rules applied 458 place count 744 transition count 369
Reduce places removed 453 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 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 1 with 494 rules applied. Total rules applied 952 place count 291 transition count 328
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 953 place count 290 transition count 328
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 953 place count 290 transition count 249
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 1111 place count 211 transition count 249
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1154 place count 168 transition count 206
Iterating global reduction 3 with 43 rules applied. Total rules applied 1197 place count 168 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1197 place count 168 transition count 204
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1201 place count 166 transition count 204
Graph (complete) has 324 edges and 166 vertex of which 17 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.1 ms
Discarding 149 places :
Also discarding 148 output transitions
Drop transitions removed 148 transitions
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 9 rules applied. Total rules applied 1210 place count 17 transition count 48
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 4 with 50 rules applied. Total rules applied 1260 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1261 place count 8 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1266 place count 5 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1267 place count 5 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1268 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1269 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1270 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1270 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1272 place count 2 transition count 1
Applied a total of 1272 rules in 189 ms. Remains 2 /796 variables (removed 794) and now considering 1/836 (removed 835) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 2/796 places, 1/836 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-12 08:28:57] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 306 ms. (steps per millisecond=3267 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-40b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 38431 ms.
ITS solved all properties within timeout

BK_STOP 1678609738839

--------------------
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 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="GPUForwardProgress-PT-40b"
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 GPUForwardProgress-PT-40b, 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 r201-smll-167840347400157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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