Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446900349.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S06J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446900349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M 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 PolyORBLF-PT-S06J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717256360477

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:39:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 15:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:39:22] [INFO ] Load time of PNML (sax parser for PT used): 499 ms
[2024-06-01 15:39:22] [INFO ] Transformed 700 places.
[2024-06-01 15:39:22] [INFO ] Transformed 10740 transitions.
[2024-06-01 15:39:22] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 705 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 9, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 9, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 15:39:22] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2024-06-01 15:39:22] [INFO ] Computed 58 invariants in 196 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 9, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 36, 60, +inf, 10, +inf, 34, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf]
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (79 resets) in 114 ms. (86 steps per ms)
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140007 steps (320 resets) in 463 ms. (301 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1] Max Struct:[+inf, 36, 60, +inf, +inf, 34, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 15:39:23] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 15:39:23] [INFO ] Invariant cache hit.
[2024-06-01 15:39:23] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2024-06-01 15:39:23] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 38 ms returned unsat
[2024-06-01 15:39:23] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2024-06-01 15:39:23] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 39 ms returned unsat
[2024-06-01 15:39:23] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2024-06-01 15:39:23] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 19 ms returned unsat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 32 ms returned unsat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 17 ms returned unsat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 20 ms returned unsat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 44 ms returned unsat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-06-01 15:39:24] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 78 ms returned sat
[2024-06-01 15:39:26] [INFO ] [Real]Absence check using state equation in 1954 ms returned sat
[2024-06-01 15:39:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:39:26] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-06-01 15:39:26] [INFO ] [Nat]Absence check using 22 positive and 36 generalized place invariants in 26 ms returned sat
[2024-06-01 15:39:28] [INFO ] [Nat]Absence check using state equation in 1658 ms returned sat
[2024-06-01 15:39:28] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 15:39:29] [INFO ] [Nat]Added 168 Read/Feed constraints in 520 ms returned sat
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 94 places in 223 ms of which 20 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:39:29] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 1 ms to minimize.
[2024-06-01 15:39:30] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:39:30] [INFO ] Deduced a trap composed of 41 places in 488 ms of which 4 ms to minimize.
[2024-06-01 15:39:31] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 1 ms to minimize.
[2024-06-01 15:39:32] [INFO ] Deduced a trap composed of 385 places in 865 ms of which 6 ms to minimize.
[2024-06-01 15:39:32] [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 7
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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 73 ms returned unsat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 44 ms returned unsat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive place invariants in 9 ms returned sat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 19 ms returned unsat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive place invariants in 20 ms returned sat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 68 ms returned unsat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive place invariants in 15 ms returned sat
[2024-06-01 15:39:32] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 44 ms returned unsat
[2024-06-01 15:39:33] [INFO ] [Real]Absence check using 22 positive place invariants in 25 ms returned sat
[2024-06-01 15:39:33] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 66 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1] Max Struct:[1, 1, 1, 4, 1, 1, 1, +inf, 1, 1, 2, 1, 4, 1]
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 694 transition count 2617
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 113 place count 641 transition count 2616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 640 transition count 2616
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 114 place count 640 transition count 2533
Deduced a syphon composed of 83 places in 3 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 280 place count 557 transition count 2533
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 424 place count 485 transition count 2461
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 436 place count 485 transition count 2449
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 448 place count 473 transition count 2449
Applied a total of 448 rules in 605 ms. Remains 473 /700 variables (removed 227) and now considering 2449/2670 (removed 221) transitions.
Running 2443 sub problems to find dead transitions.
[2024-06-01 15:39:33] [INFO ] Flow matrix only has 2413 transitions (discarded 36 similar events)
// Phase 1: matrix 2413 rows 473 cols
[2024-06-01 15:39:33] [INFO ] Computed 52 invariants in 75 ms
[2024-06-01 15:39:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
[2024-06-01 15:40:10] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:40:10] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 1 ms to minimize.
[2024-06-01 15:40:11] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 1 ms to minimize.
[2024-06-01 15:40:11] [INFO ] Deduced a trap composed of 49 places in 299 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/2886 variables, and 49 constraints, problems are : Problem set: 0 solved, 2443 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 26/33 constraints, State Equation: 0/473 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2443/1099 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 2443 unsolved
[2024-06-01 15:40:17] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:40:19] [INFO ] Deduced a trap composed of 144 places in 331 ms of which 1 ms to minimize.
[2024-06-01 15:40:29] [INFO ] Deduced a trap composed of 138 places in 475 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/2886 variables, and 52 constraints, problems are : Problem set: 0 solved, 2443 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 26/33 constraints, State Equation: 0/473 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1344/1099 constraints, Known Traps: 7/7 constraints]
After SMT, in 61060ms problems are : Problem set: 0 solved, 2443 unsolved
Search for dead transitions found 0 dead transitions in 61124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61771 ms. Remains : 473/700 places, 2449/2670 transitions.
[2024-06-01 15:40:34] [INFO ] Flow matrix only has 2413 transitions (discarded 36 similar events)

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBLF-PT-S06J06T06"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S06J06T06, 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 r516-tajo-171654446900349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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