Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r623-tall-171774435500126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BlocksWorld-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r623-tall-171774435500126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 253K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 378K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 23K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 149K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 627K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 689K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 817K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.5M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 35K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 86K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:26 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 BlocksWorld-PT-06-UpperBounds-00
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-01
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-02
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-03
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-04
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-05
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-06
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-07
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-08
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-09
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-10
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-11
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-12
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-13
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-14
FORMULA_NAME BlocksWorld-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717779335114

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-07 16:55:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 16:55:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 16:55:36] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2024-06-07 16:55:36] [INFO ] Transformed 1189 places.
[2024-06-07 16:55:37] [INFO ] Transformed 2245 transitions.
[2024-06-07 16:55:37] [INFO ] Found NUPN structural information;
[2024-06-07 16:55:37] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32]
[2024-06-07 16:55:37] [INFO ] Parsed PT model containing 1189 places and 2245 transitions and 11210 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
// Phase 1: matrix 2245 rows 1189 cols
[2024-06-07 16:55:37] [INFO ] Computed 67 invariants in 57 ms
FORMULA BlocksWorld-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=15 ) properties (out of 15) seen :119
FORMULA BlocksWorld-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :192
FORMULA BlocksWorld-PT-06-UpperBounds-06 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-05 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-01 33 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :62
[2024-06-07 16:55:38] [INFO ] Invariant cache hit.
[2024-06-07 16:55:38] [INFO ] [Real]Absence check using 67 positive place invariants in 31 ms returned unsat
[2024-06-07 16:55:38] [INFO ] [Real]Absence check using 67 positive place invariants in 50 ms returned sat
[2024-06-07 16:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-07 16:55:39] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2024-06-07 16:55:39] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-07 16:55:40] [INFO ] [Real]Added 59 Read/Feed constraints in 517 ms returned sat
[2024-06-07 16:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 16:55:40] [INFO ] [Nat]Absence check using 67 positive place invariants in 51 ms returned sat
[2024-06-07 16:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-07 16:55:41] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2024-06-07 16:55:41] [INFO ] [Nat]Added 59 Read/Feed constraints in 336 ms returned sat
[2024-06-07 16:55:42] [INFO ] Deduced a trap composed of 34 places in 801 ms of which 4 ms to minimize.
[2024-06-07 16:55:43] [INFO ] Deduced a trap composed of 280 places in 967 ms of which 2 ms to minimize.
[2024-06-07 16:55:44] [INFO ] Deduced a trap composed of 369 places in 825 ms of which 16 ms to minimize.
[2024-06-07 16:55:45] [INFO ] Deduced a trap composed of 388 places in 772 ms of which 2 ms to minimize.
[2024-06-07 16:55:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-06-07 16:55:45] [INFO ] [Real]Absence check using 67 positive place invariants in 46 ms returned sat
[2024-06-07 16:55:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-07 16:55:46] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2024-06-07 16:55:46] [INFO ] [Real]Added 59 Read/Feed constraints in 505 ms returned sat
[2024-06-07 16:55:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 16:55:46] [INFO ] [Nat]Absence check using 67 positive place invariants in 47 ms returned sat
[2024-06-07 16:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-07 16:55:47] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-06-07 16:55:47] [INFO ] [Nat]Added 59 Read/Feed constraints in 345 ms returned sat
[2024-06-07 16:55:48] [INFO ] Deduced a trap composed of 34 places in 745 ms of which 1 ms to minimize.
[2024-06-07 16:55:49] [INFO ] Deduced a trap composed of 280 places in 812 ms of which 2 ms to minimize.
[2024-06-07 16:55:50] [INFO ] Deduced a trap composed of 369 places in 778 ms of which 1 ms to minimize.
[2024-06-07 16:55:51] [INFO ] Deduced a trap composed of 388 places in 774 ms of which 2 ms to minimize.
[2024-06-07 16:55:52] [INFO ] Deduced a trap composed of 297 places in 806 ms of which 1 ms to minimize.
[2024-06-07 16:55:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-06-07 16:55:52] [INFO ] [Real]Absence check using 67 positive place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1089, 1089, 1] Max seen :[1, 32, 32, 1]
FORMULA BlocksWorld-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1089 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 2245/2245 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1189 transition count 2244
Applied a total of 1 rules in 443 ms. Remains 1189 /1189 variables (removed 0) and now considering 2244/2245 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 1189/1189 places, 2244/2245 transitions.
// Phase 1: matrix 2244 rows 1189 cols
[2024-06-07 16:55:53] [INFO ] Computed 67 invariants in 19 ms
Finished random walk after 591517 steps, including 1 resets, run visited all 2 properties in 30001 ms. (steps per millisecond=19 )
Finished Best-First random walk after 177769 steps, including 0 resets, run visited all 2 properties in 5001 ms. (steps per millisecond=35 )
Finished Best-First random walk after 196673 steps, including 0 resets, run visited all 2 properties in 5001 ms. (steps per millisecond=39 )
[2024-06-07 16:56:33] [INFO ] Invariant cache hit.
[2024-06-07 16:56:33] [INFO ] [Real]Absence check using 67 positive place invariants in 55 ms returned sat
[2024-06-07 16:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-07 16:56:33] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2024-06-07 16:56:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-07 16:56:34] [INFO ] [Real]Added 58 Read/Feed constraints in 496 ms returned sat
[2024-06-07 16:56:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 16:56:34] [INFO ] [Nat]Absence check using 67 positive place invariants in 44 ms returned sat
[2024-06-07 16:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-07 16:56:35] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2024-06-07 16:56:35] [INFO ] [Nat]Added 58 Read/Feed constraints in 449 ms returned sat
[2024-06-07 16:56:36] [INFO ] Deduced a trap composed of 250 places in 815 ms of which 1 ms to minimize.
[2024-06-07 16:56:37] [INFO ] Deduced a trap composed of 294 places in 811 ms of which 1 ms to minimize.
[2024-06-07 16:56:38] [INFO ] Deduced a trap composed of 377 places in 769 ms of which 2 ms to minimize.
[2024-06-07 16:56:39] [INFO ] Deduced a trap composed of 280 places in 795 ms of which 1 ms to minimize.
[2024-06-07 16:56:40] [INFO ] Deduced a trap composed of 374 places in 776 ms of which 2 ms to minimize.
[2024-06-07 16:56:41] [INFO ] Deduced a trap composed of 126 places in 795 ms of which 2 ms to minimize.
[2024-06-07 16:56:42] [INFO ] Deduced a trap composed of 376 places in 722 ms of which 1 ms to minimize.
[2024-06-07 16:56:43] [INFO ] Deduced a trap composed of 264 places in 763 ms of which 1 ms to minimize.
[2024-06-07 16:56:45] [INFO ] Deduced a trap composed of 344 places in 755 ms of which 2 ms to minimize.
[2024-06-07 16:56:45] [INFO ] Deduced a trap composed of 388 places in 784 ms of which 2 ms to minimize.
[2024-06-07 16:56:48] [INFO ] Deduced a trap composed of 66 places in 732 ms of which 2 ms to minimize.
[2024-06-07 16:56:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 12865 ms
[2024-06-07 16:56:48] [INFO ] [Real]Absence check using 67 positive place invariants in 47 ms returned sat
[2024-06-07 16:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-07 16:56:49] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2024-06-07 16:56:49] [INFO ] [Real]Added 58 Read/Feed constraints in 492 ms returned sat
[2024-06-07 16:56:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 16:56:49] [INFO ] [Nat]Absence check using 67 positive place invariants in 44 ms returned sat
[2024-06-07 16:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-07 16:56:50] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2024-06-07 16:56:50] [INFO ] [Nat]Added 58 Read/Feed constraints in 440 ms returned sat
[2024-06-07 16:56:51] [INFO ] Deduced a trap composed of 250 places in 762 ms of which 2 ms to minimize.
[2024-06-07 16:56:52] [INFO ] Deduced a trap composed of 294 places in 791 ms of which 3 ms to minimize.
[2024-06-07 16:56:53] [INFO ] Deduced a trap composed of 377 places in 756 ms of which 1 ms to minimize.
[2024-06-07 16:56:54] [INFO ] Deduced a trap composed of 280 places in 843 ms of which 1 ms to minimize.
[2024-06-07 16:56:55] [INFO ] Deduced a trap composed of 374 places in 764 ms of which 1 ms to minimize.
[2024-06-07 16:56:56] [INFO ] Deduced a trap composed of 126 places in 782 ms of which 2 ms to minimize.
[2024-06-07 16:56:57] [INFO ] Deduced a trap composed of 376 places in 760 ms of which 1 ms to minimize.
[2024-06-07 16:56:58] [INFO ] Deduced a trap composed of 264 places in 762 ms of which 1 ms to minimize.
[2024-06-07 16:57:00] [INFO ] Deduced a trap composed of 344 places in 756 ms of which 1 ms to minimize.
[2024-06-07 16:57:01] [INFO ] Deduced a trap composed of 388 places in 786 ms of which 2 ms to minimize.
[2024-06-07 16:57:03] [INFO ] Deduced a trap composed of 66 places in 718 ms of which 1 ms to minimize.
[2024-06-07 16:57:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 12835 ms
Current structural bounds on expressions (after SMT) : [32, 32] Max seen :[32, 32]
FORMULA BlocksWorld-PT-06-UpperBounds-04 32 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BlocksWorld-PT-06-UpperBounds-02 32 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 87176 ms.

BK_STOP 1717779424659

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is BlocksWorld-PT-06, 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 r623-tall-171774435500126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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