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.r601-tall-171774424100277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BlocksWorld-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774424100277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 64M
-rw-r--r-- 1 mcc users 1.6M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.0M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.7M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 36K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.9M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.7M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.1M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 95K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 228K 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 5.8M 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-15-UpperBounds-00
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-01
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-02
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-03
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-04
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-05
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-06
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-07
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-08
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-09
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-10
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-11
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-12
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-13
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-14
FORMULA_NAME BlocksWorld-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717787303415

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 19:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-07 19:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 19:08:25] [INFO ] Load time of PNML (sax parser for PT used): 480 ms
[2024-06-07 19:08:25] [INFO ] Transformed 6161 places.
[2024-06-07 19:08:25] [INFO ] Transformed 12013 transitions.
[2024-06-07 19:08:25] [INFO ] Found NUPN structural information;
[2024-06-07 19:08:25] [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, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66, pred_on_table_67, pred_on_table_68, pred_on_table_69, pred_on_table_70, pred_on_table_71, pred_on_table_72, pred_on_table_73, pred_on_table_74, pred_on_table_75, pred_on_table_76]
[2024-06-07 19:08:25] [INFO ] Parsed PT model containing 6161 places and 12013 transitions and 60038 arcs in 671 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 29 ms.
Reduction of identical properties reduced properties to check from 16 to 11
Current structural bounds on expressions (Initially) : Max Seen:[0, 5, 1, 72, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 5, 1, 72, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 12013 rows 6161 cols
[2024-06-07 19:08:25] [INFO ] Computed 155 invariants in 206 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 5, 1, 72, 1, 0, 0, 0, 0, 0, 0] Max Struct:[77, 77, 1, 5929, 1, 1, 1, 1, 1, 1, 1]
FORMULA BlocksWorld-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 2457 ms. (4 steps per ms)
FORMULA BlocksWorld-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2060 ms. (19 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 57, 75, 0] Max Struct:[77, 77, 5929, 1]
[2024-06-07 19:08:30] [INFO ] Invariant cache hit.
[2024-06-07 19:08:31] [INFO ] [Real]Absence check using 155 positive place invariants in 163 ms returned unsat
[2024-06-07 19:08:32] [INFO ] [Real]Absence check using 155 positive place invariants in 274 ms returned sat
[2024-06-07 19:08:36] [INFO ] [Real]Absence check using state equation in 4167 ms returned unknown
[2024-06-07 19:08:37] [INFO ] [Real]Absence check using 155 positive place invariants in 680 ms returned sat
[2024-06-07 19:08:41] [INFO ] [Real]Absence check using state equation in 3692 ms returned unknown
[2024-06-07 19:08:42] [INFO ] [Real]Absence check using 155 positive place invariants in 210 ms returned sat
[2024-06-07 19:08:46] [INFO ] [Real]Absence check using state equation in 4162 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 57, 75, 0] Max Struct:[1, 77, 5929, 1]
FORMULA BlocksWorld-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[57, 75, 0] Max Struct:[77, 5929, 1]
Support contains 6006 out of 6161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6161/6161 places, 12013/12013 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 6161 transition count 12012
Applied a total of 1 rules in 3936 ms. Remains 6161 /6161 variables (removed 0) and now considering 12012/12013 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3952 ms. Remains : 6161/6161 places, 12012/12013 transitions.
// Phase 1: matrix 12012 rows 6161 cols
[2024-06-07 19:08:50] [INFO ] Computed 155 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[57, 75, 0] Max Struct:[77, 5929, 1]
RANDOM walk for 141327 steps (0 resets) in 30001 ms. (4 steps per ms)
FORMULA BlocksWorld-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-03 77 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-04 77 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-05 77 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-06 77 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BlocksWorld-PT-15-UpperBounds-01 77 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 629512 steps (1 resets) in 10002 ms. (62 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[5929]
[2024-06-07 19:09:30] [INFO ] Invariant cache hit.
[2024-06-07 19:09:32] [INFO ] [Real]Absence check using 155 positive place invariants in 808 ms returned sat
[2024-06-07 19:09:43] [INFO ] [Real]Absence check using state equation in 11247 ms returned sat
[2024-06-07 19:09:43] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-06-07 19:09:47] [INFO ] [Real]Added 144 Read/Feed constraints in 4075 ms returned sat
[2024-06-07 19:09:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 19:09:49] [INFO ] [Nat]Absence check using 155 positive place invariants in 797 ms returned sat
[2024-06-07 19:10:02] [INFO ] [Nat]Absence check using state equation in 12850 ms returned sat
[2024-06-07 19:10:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-07 19:10:10] [INFO ] [Nat]Added 144 Read/Feed constraints in 7457 ms returned sat
[2024-06-07 19:10:24] [INFO ] Deduced a trap composed of 78 places in 14148 ms of which 286 ms to minimize.
[2024-06-07 19:10:39] [INFO ] Deduced a trap composed of 1759 places in 14211 ms of which 48 ms to minimize.
[2024-06-07 19:10:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[5929]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[5929]
Support contains 5929 out of 6161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6161/6161 places, 12012/12012 transitions.
Applied a total of 0 rules in 4643 ms. Remains 6161 /6161 variables (removed 0) and now considering 12012/12012 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4651 ms. Remains : 6161/6161 places, 12012/12012 transitions.
[2024-06-07 19:10:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[76] Max Struct:[5929]
RANDOM walk for 135799 steps (0 resets) in 30001 ms. (4 steps per ms)
BEST_FIRST walk for 36067 steps (0 resets) in 5001 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[5929]
[2024-06-07 19:11:19] [INFO ] Invariant cache hit.
[2024-06-07 19:11:20] [INFO ] [Real]Absence check using 155 positive place invariants in 769 ms returned sat
[2024-06-07 19:11:33] [INFO ] [Real]Absence check using state equation in 13445 ms returned sat
[2024-06-07 19:11:34] [INFO ] State equation strengthened by 144 read => feed constraints.
[2024-06-07 19:11:38] [INFO ] [Real]Added 144 Read/Feed constraints in 4481 ms returned sat
[2024-06-07 19:11:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 19:11:40] [INFO ] [Nat]Absence check using 155 positive place invariants in 801 ms returned sat
[2024-06-07 19:11:53] [INFO ] [Nat]Absence check using state equation in 12627 ms returned sat
[2024-06-07 19:11:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-07 19:11:59] [INFO ] [Nat]Added 144 Read/Feed constraints in 6397 ms returned sat
[2024-06-07 19:12:16] [INFO ] Deduced a trap composed of 445 places in 16622 ms of which 47 ms to minimize.
[2024-06-07 19:12:36] [INFO ] Deduced a trap composed of 154 places in 15389 ms of which 46 ms to minimize.
[2024-06-07 19:12:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[5929]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[5929]
Support contains 5929 out of 6161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6161/6161 places, 12012/12012 transitions.
Applied a total of 0 rules in 4004 ms. Remains 6161 /6161 variables (removed 0) and now considering 12012/12012 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4006 ms. Remains : 6161/6161 places, 12012/12012 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6161/6161 places, 12012/12012 transitions.
Applied a total of 0 rules in 4191 ms. Remains 6161 /6161 variables (removed 0) and now considering 12012/12012 (removed 0) transitions.
[2024-06-07 19:12:44] [INFO ] Invariant cache hit.
[2024-06-07 19:12:47] [INFO ] Implicit Places using invariants in 3111 ms returned []
Implicit Place search using SMT only with invariants took 3114 ms to find 0 implicit places.
Running 12007 sub problems to find dead transitions.
[2024-06-07 19:12:47] [INFO ] Invariant cache hit.
[2024-06-07 19:12:47] [INFO ] State equation strengthened by 144 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2260 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2884 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3196 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3352 is UNSAT
Problem TDEAD3430 is UNSAT
Problem TDEAD3508 is UNSAT
Problem TDEAD3586 is UNSAT
Problem TDEAD3664 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3820 is UNSAT
Problem TDEAD3898 is UNSAT
Problem TDEAD3976 is UNSAT
Problem TDEAD4054 is UNSAT
Problem TDEAD4132 is UNSAT
Problem TDEAD4210 is UNSAT
Problem TDEAD4288 is UNSAT
Problem TDEAD4366 is UNSAT
Problem TDEAD4444 is UNSAT
Problem TDEAD4522 is UNSAT
Problem TDEAD4600 is UNSAT
Problem TDEAD4678 is UNSAT
Problem TDEAD4756 is UNSAT
Problem TDEAD4834 is UNSAT
Problem TDEAD4990 is UNSAT
Problem TDEAD5068 is UNSAT
Problem TDEAD5146 is UNSAT
Problem TDEAD5302 is UNSAT
Problem TDEAD5380 is UNSAT
Problem TDEAD5458 is UNSAT
Problem TDEAD5536 is UNSAT
Problem TDEAD5614 is UNSAT
Problem TDEAD5692 is UNSAT
Problem TDEAD5770 is UNSAT
Problem TDEAD5848 is UNSAT
Problem TDEAD5926 is UNSAT
Problem TDEAD6004 is UNSAT
Problem TDEAD6082 is UNSAT
Problem TDEAD6160 is UNSAT
Problem TDEAD6312 is UNSAT
Problem TDEAD6462 is UNSAT
Problem TDEAD6610 is UNSAT
Problem TDEAD6756 is UNSAT
Problem TDEAD6900 is UNSAT
Problem TDEAD7042 is UNSAT
Problem TDEAD7320 is UNSAT
Problem TDEAD7456 is UNSAT
Problem TDEAD7590 is UNSAT
Problem TDEAD7722 is UNSAT
Problem TDEAD7852 is UNSAT
Problem TDEAD7980 is UNSAT
Problem TDEAD8106 is UNSAT
Problem TDEAD8230 is UNSAT
Problem TDEAD8352 is UNSAT
Problem TDEAD8472 is UNSAT
Problem TDEAD8590 is UNSAT
Problem TDEAD8706 is UNSAT
Problem TDEAD8820 is UNSAT
Problem TDEAD8932 is UNSAT
Problem TDEAD9042 is UNSAT
Problem TDEAD9150 is UNSAT
Problem TDEAD9256 is UNSAT
Problem TDEAD9360 is UNSAT
Problem TDEAD9462 is UNSAT
Problem TDEAD9562 is UNSAT
Problem TDEAD9660 is UNSAT
Problem TDEAD9756 is UNSAT
Problem TDEAD9850 is UNSAT
Problem TDEAD10032 is UNSAT
Problem TDEAD10120 is UNSAT
Problem TDEAD10206 is UNSAT
Problem TDEAD10290 is UNSAT
Problem TDEAD10372 is UNSAT
Problem TDEAD10452 is UNSAT
Problem TDEAD10530 is UNSAT
Problem TDEAD10606 is UNSAT
Problem TDEAD10680 is UNSAT
Problem TDEAD10752 is UNSAT
Problem TDEAD10822 is UNSAT
Problem TDEAD10890 is UNSAT
Problem TDEAD10956 is UNSAT
Problem TDEAD11020 is UNSAT
Problem TDEAD11082 is UNSAT
Problem TDEAD11142 is UNSAT
Problem TDEAD11200 is UNSAT
Problem TDEAD11256 is UNSAT
Problem TDEAD11310 is UNSAT
Problem TDEAD11362 is UNSAT
Problem TDEAD11412 is UNSAT
Problem TDEAD11460 is UNSAT
Problem TDEAD11506 is UNSAT
Problem TDEAD11550 is UNSAT
Problem TDEAD11592 is UNSAT
Problem TDEAD11632 is UNSAT
Problem TDEAD11670 is UNSAT
Problem TDEAD11706 is UNSAT
Problem TDEAD11772 is UNSAT
Problem TDEAD11802 is UNSAT
Problem TDEAD11830 is UNSAT
Problem TDEAD11880 is UNSAT
Problem TDEAD11902 is UNSAT
Problem TDEAD11922 is UNSAT
Problem TDEAD11940 is UNSAT
Problem TDEAD11956 is UNSAT
Problem TDEAD11970 is UNSAT
Problem TDEAD11982 is UNSAT
Problem TDEAD11992 is UNSAT
Problem TDEAD12000 is UNSAT
Problem TDEAD12006 is UNSAT
Problem TDEAD12010 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/6156 variables, 146/146 constraints. Problems are: Problem set: 146 solved, 11861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6156/18173 variables, and 146 constraints, problems are : Problem set: 146 solved, 11861 unsolved in 30269 ms.
Refiners :[Positive P Invariants (semi-flows): 146/155 constraints, State Equation: 0/6161 constraints, ReadFeed: 0/144 constraints, PredecessorRefiner: 11934/6006 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 146 solved, 11861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6083 variables, 5/5 constraints. Problems are: Problem set: 146 solved, 11861 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6083/18173 variables, and 5 constraints, problems are : Problem set: 146 solved, 11861 unsolved in 30141 ms.
Refiners :[Positive P Invariants (semi-flows): 5/155 constraints, State Equation: 0/6161 constraints, ReadFeed: 0/144 constraints, PredecessorRefiner: 5928/6006 constraints, Known Traps: 0/0 constraints]
After SMT, in 179817ms problems are : Problem set: 146 solved, 11861 unsolved
Search for dead transitions found 146 dead transitions in 179962ms
Found 146 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 146 transitions
Dead transitions reduction (with SMT) removed 146 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 6161/6161 places, 11866/12012 transitions.
Deduced a syphon composed of 73 places in 10 ms
Applied a total of 0 rules in 3878 ms. Remains 6161 /6161 variables (removed 0) and now considering 11866/11866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 191219 ms. Remains : 6161/6161 places, 11866/12012 transitions.
Deduced a syphon composed of 73 places in 13 ms
Reduce places removed 73 places and 0 transitions.
// Phase 1: matrix 11866 rows 6088 cols
[2024-06-07 19:15:51] [INFO ] Computed 155 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[76] Max Struct:[5856]
RANDOM walk for 140213 steps (0 resets) in 30001 ms. (4 steps per ms)
BEST_FIRST walk for 35623 steps (0 resets) in 5001 ms. (7 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[5856]
[2024-06-07 19:16:26] [INFO ] Invariant cache hit.
[2024-06-07 19:16:27] [INFO ] [Real]Absence check using 155 positive place invariants in 658 ms returned sat
[2024-06-07 19:16:39] [INFO ] [Real]Absence check using state equation in 11813 ms returned sat
[2024-06-07 19:16:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-07 19:16:40] [INFO ] [Real]Added 8 Read/Feed constraints in 873 ms returned sat
[2024-06-07 19:16:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 19:16:42] [INFO ] [Nat]Absence check using 155 positive place invariants in 570 ms returned sat
[2024-06-07 19:16:51] [INFO ] [Nat]Absence check using state equation in 8962 ms returned sat
[2024-06-07 19:16:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 937 ms returned sat
[2024-06-07 19:17:05] [INFO ] Deduced a trap composed of 228 places in 13190 ms of which 37 ms to minimize.
[2024-06-07 19:17:19] [INFO ] Deduced a trap composed of 154 places in 13391 ms of which 38 ms to minimize.
[2024-06-07 19:17:32] [INFO ] Deduced a trap composed of 300 places in 12762 ms of which 42 ms to minimize.
[2024-06-07 19:17: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[5856]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[5856]
Support contains 5856 out of 6088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6088/6088 places, 11866/11866 transitions.
Applied a total of 0 rules in 3758 ms. Remains 6088 /6088 variables (removed 0) and now considering 11866/11866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3760 ms. Remains : 6088/6088 places, 11866/11866 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6088/6088 places, 11866/11866 transitions.
Applied a total of 0 rules in 3642 ms. Remains 6088 /6088 variables (removed 0) and now considering 11866/11866 (removed 0) transitions.
[2024-06-07 19:17:39] [INFO ] Invariant cache hit.
[2024-06-07 19:17:42] [INFO ] Implicit Places using invariants in 2352 ms returned []
Implicit Place search using SMT only with invariants took 2357 ms to find 0 implicit places.
Running 11861 sub problems to find dead transitions.
[2024-06-07 19:17:42] [INFO ] Invariant cache hit.
[2024-06-07 19:17:42] [INFO ] State equation strengthened by 8 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/6083 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 11861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6083/17954 variables, and 146 constraints, problems are : Problem set: 0 solved, 11861 unsolved in 30192 ms.
Refiners :[Positive P Invariants (semi-flows): 146/155 constraints, State Equation: 0/6088 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 11861/5933 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6083 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 11861 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6083/17954 variables, and 146 constraints, problems are : Problem set: 0 solved, 11861 unsolved in 30135 ms.
Refiners :[Positive P Invariants (semi-flows): 146/155 constraints, State Equation: 0/6088 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 5928/5933 constraints, Known Traps: 0/0 constraints]
After SMT, in 186199ms problems are : Problem set: 0 solved, 11861 unsolved
Search for dead transitions found 0 dead transitions in 186328ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192361 ms. Remains : 6088/6088 places, 11866/11866 transitions.
RANDOM walk for 40000 steps (8 resets) in 14638 ms. (2 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7091 ms. (5 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 5780 ms. (6 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 163057 steps, run timeout after 21001 ms. (steps per millisecond=7 ) properties seen :0 out of 2
Probabilistic random walk after 163057 steps, saw 137278 distinct states, run finished after 21008 ms. (steps per millisecond=7 ) properties seen :0
[2024-06-07 19:21:16] [INFO ] Invariant cache hit.
[2024-06-07 19:21:16] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5856 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6087/17954 variables, and 154 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2308 ms.
Refiners :[Positive P Invariants (semi-flows): 154/155 constraints, State Equation: 0/6088 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5856 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6087/17954 variables, and 154 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 154/155 constraints, State Equation: 0/6088 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5031ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 5856 out of 6088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6088/6088 places, 11866/11866 transitions.
Applied a total of 0 rules in 4117 ms. Remains 6088 /6088 variables (removed 0) and now considering 11866/11866 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4125 ms. Remains : 6088/6088 places, 11866/11866 transitions.
RANDOM walk for 40000 steps (8 resets) in 8806 ms. (4 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4793 ms. (8 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 90795 steps, run timeout after 9003 ms. (steps per millisecond=10 ) properties seen :0 out of 1
Probabilistic random walk after 90795 steps, saw 73824 distinct states, run finished after 9005 ms. (steps per millisecond=10 ) properties seen :0
[2024-06-07 19:21:38] [INFO ] Invariant cache hit.
[2024-06-07 19:21:38] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5856 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/6087 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6087 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/6088 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6088 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11866/17954 variables, 6088/6243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17954 variables, 8/6251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17954 variables, 0/6251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/17954 variables, 0/6251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17954/17954 variables, and 6251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8711 ms.
Refiners :[Positive P Invariants (semi-flows): 155/155 constraints, State Equation: 6088/6088 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5856 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 231/6087 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 19:22:03] [INFO ] Deduced a trap composed of 154 places in 13675 ms of which 47 ms to minimize.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 6087/17954 variables, and 155 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15381 ms.
Refiners :[Positive P Invariants (semi-flows): 154/155 constraints, State Equation: 0/6088 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints]
After SMT, in 24560ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BlocksWorld-PT-15-UpperBounds-07 76 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 818483 ms.
ITS solved all properties within timeout

BK_STOP 1717788123271

--------------------
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="BlocksWorld-PT-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BlocksWorld-PT-15, 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 r601-tall-171774424100277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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