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-171774435600127.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r623-tall-171774435600127
=====================================================================

--------------------
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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717779434118

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-07 16:57:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 16:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 16:57:15] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-07 16:57:15] [INFO ] Transformed 1189 places.
[2024-06-07 16:57:16] [INFO ] Transformed 2245 transitions.
[2024-06-07 16:57:16] [INFO ] Found NUPN structural information;
[2024-06-07 16:57:16] [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:57:16] [INFO ] Parsed PT model containing 1189 places and 2245 transitions and 11210 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BlocksWorld-PT-06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 2245/2245 transitions.
Applied a total of 0 rules in 153 ms. Remains 1189 /1189 variables (removed 0) and now considering 2245/2245 (removed 0) transitions.
// Phase 1: matrix 2245 rows 1189 cols
[2024-06-07 16:57:16] [INFO ] Computed 67 invariants in 47 ms
[2024-06-07 16:57:17] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-06-07 16:57:17] [INFO ] Invariant cache hit.
[2024-06-07 16:57:18] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-07 16:57:19] [INFO ] Implicit Places using invariants and state equation in 2493 ms returned []
Implicit Place search using SMT with State Equation took 3356 ms to find 0 implicit places.
[2024-06-07 16:57:19] [INFO ] Invariant cache hit.
[2024-06-07 16:57:20] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 66 transitions.
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 1189/1189 places, 2179/2245 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 1156 transition count 2179
Applied a total of 33 rules in 42 ms. Remains 1156 /1189 variables (removed 33) and now considering 2179/2179 (removed 0) transitions.
// Phase 1: matrix 2179 rows 1156 cols
[2024-06-07 16:57:20] [INFO ] Computed 67 invariants in 18 ms
[2024-06-07 16:57:21] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-06-07 16:57:21] [INFO ] Invariant cache hit.
[2024-06-07 16:57:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:22] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2129 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1156/1189 places, 2179/2245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6622 ms. Remains : 1156/1189 places, 2179/2245 transitions.
Support contains 100 out of 1156 places after structural reductions.
[2024-06-07 16:57:23] [INFO ] Flatten gal took : 218 ms
[2024-06-07 16:57:23] [INFO ] Flatten gal took : 131 ms
[2024-06-07 16:57:23] [INFO ] Input system was already deterministic with 2179 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 30) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-06-07 16:57:24] [INFO ] Invariant cache hit.
[2024-06-07 16:57:25] [INFO ] [Real]Absence check using 67 positive place invariants in 42 ms returned sat
[2024-06-07 16:57:25] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2024-06-07 16:57:26] [INFO ] [Nat]Absence check using 67 positive place invariants in 30 ms returned sat
[2024-06-07 16:57:27] [INFO ] After 1024ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :7
[2024-06-07 16:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:57:27] [INFO ] After 387ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :11 sat :7
[2024-06-07 16:57:28] [INFO ] Deduced a trap composed of 66 places in 696 ms of which 7 ms to minimize.
[2024-06-07 16:57:29] [INFO ] Deduced a trap composed of 124 places in 597 ms of which 1 ms to minimize.
[2024-06-07 16:57:29] [INFO ] Deduced a trap composed of 300 places in 483 ms of which 1 ms to minimize.
[2024-06-07 16:57:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2028 ms
[2024-06-07 16:57:30] [INFO ] Deduced a trap composed of 96 places in 730 ms of which 3 ms to minimize.
[2024-06-07 16:57:31] [INFO ] Deduced a trap composed of 150 places in 712 ms of which 1 ms to minimize.
[2024-06-07 16:57:32] [INFO ] Deduced a trap composed of 96 places in 704 ms of which 1 ms to minimize.
[2024-06-07 16:57:32] [INFO ] Deduced a trap composed of 150 places in 696 ms of which 1 ms to minimize.
[2024-06-07 16:57:33] [INFO ] Deduced a trap composed of 96 places in 697 ms of which 1 ms to minimize.
[2024-06-07 16:57:34] [INFO ] Deduced a trap composed of 96 places in 672 ms of which 1 ms to minimize.
[2024-06-07 16:57:35] [INFO ] Deduced a trap composed of 96 places in 684 ms of which 1 ms to minimize.
[2024-06-07 16:57:35] [INFO ] Deduced a trap composed of 66 places in 673 ms of which 1 ms to minimize.
[2024-06-07 16:57:36] [INFO ] Deduced a trap composed of 150 places in 667 ms of which 0 ms to minimize.
[2024-06-07 16:57:37] [INFO ] Deduced a trap composed of 234 places in 651 ms of which 1 ms to minimize.
[2024-06-07 16:57:38] [INFO ] Deduced a trap composed of 96 places in 678 ms of which 1 ms to minimize.
[2024-06-07 16:57:38] [INFO ] Deduced a trap composed of 96 places in 669 ms of which 1 ms to minimize.
[2024-06-07 16:57:39] [INFO ] Deduced a trap composed of 96 places in 703 ms of which 1 ms to minimize.
[2024-06-07 16:57:40] [INFO ] Deduced a trap composed of 96 places in 693 ms of which 3 ms to minimize.
[2024-06-07 16:57:41] [INFO ] Deduced a trap composed of 96 places in 680 ms of which 1 ms to minimize.
[2024-06-07 16:57:41] [INFO ] Deduced a trap composed of 66 places in 686 ms of which 1 ms to minimize.
[2024-06-07 16:57:42] [INFO ] Deduced a trap composed of 234 places in 684 ms of which 1 ms to minimize.
[2024-06-07 16:57:43] [INFO ] Deduced a trap composed of 96 places in 701 ms of which 1 ms to minimize.
[2024-06-07 16:57:44] [INFO ] Deduced a trap composed of 216 places in 710 ms of which 1 ms to minimize.
[2024-06-07 16:57:44] [INFO ] Deduced a trap composed of 234 places in 683 ms of which 1 ms to minimize.
[2024-06-07 16:57:45] [INFO ] Deduced a trap composed of 96 places in 700 ms of which 1 ms to minimize.
[2024-06-07 16:57:46] [INFO ] Deduced a trap composed of 96 places in 699 ms of which 1 ms to minimize.
[2024-06-07 16:57:47] [INFO ] Deduced a trap composed of 96 places in 694 ms of which 1 ms to minimize.
[2024-06-07 16:57:47] [INFO ] Deduced a trap composed of 66 places in 695 ms of which 1 ms to minimize.
[2024-06-07 16:57:48] [INFO ] Deduced a trap composed of 124 places in 675 ms of which 1 ms to minimize.
[2024-06-07 16:57:49] [INFO ] Deduced a trap composed of 96 places in 682 ms of which 1 ms to minimize.
[2024-06-07 16:57:50] [INFO ] Deduced a trap composed of 306 places in 706 ms of which 1 ms to minimize.
[2024-06-07 16:57:50] [INFO ] Deduced a trap composed of 96 places in 693 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
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:57:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 16:57:50] [INFO ] After 25272ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:17
Fused 18 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 25 ms.
Support contains 100 out of 1156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1156/1156 places, 2179/2179 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 1156 transition count 2178
Applied a total of 1 rules in 2787 ms. Remains 1156 /1156 variables (removed 0) and now considering 2178/2179 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2787 ms. Remains : 1156/1156 places, 2178/2179 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2178 rows 1156 cols
[2024-06-07 16:57:54] [INFO ] Computed 67 invariants in 17 ms
[2024-06-07 16:57:54] [INFO ] [Real]Absence check using 67 positive place invariants in 24 ms returned sat
[2024-06-07 16:57:54] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 16:57:54] [INFO ] [Nat]Absence check using 67 positive place invariants in 30 ms returned sat
[2024-06-07 16:57:55] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 16:57:56] [INFO ] Deduced a trap composed of 96 places in 694 ms of which 2 ms to minimize.
[2024-06-07 16:57:57] [INFO ] Deduced a trap composed of 96 places in 696 ms of which 1 ms to minimize.
[2024-06-07 16:57:58] [INFO ] Deduced a trap composed of 196 places in 691 ms of which 1 ms to minimize.
[2024-06-07 16:57:58] [INFO ] Deduced a trap composed of 294 places in 705 ms of which 1 ms to minimize.
[2024-06-07 16:57:59] [INFO ] Deduced a trap composed of 216 places in 701 ms of which 1 ms to minimize.
[2024-06-07 16:58:00] [INFO ] Deduced a trap composed of 96 places in 698 ms of which 1 ms to minimize.
[2024-06-07 16:58:01] [INFO ] Deduced a trap composed of 276 places in 695 ms of which 1 ms to minimize.
[2024-06-07 16:58:01] [INFO ] Deduced a trap composed of 250 places in 678 ms of which 1 ms to minimize.
[2024-06-07 16:58:02] [INFO ] Deduced a trap composed of 96 places in 682 ms of which 2 ms to minimize.
[2024-06-07 16:58:03] [INFO ] Deduced a trap composed of 66 places in 655 ms of which 1 ms to minimize.
[2024-06-07 16:58:04] [INFO ] Deduced a trap composed of 96 places in 702 ms of which 1 ms to minimize.
[2024-06-07 16:58:04] [INFO ] Deduced a trap composed of 196 places in 682 ms of which 1 ms to minimize.
[2024-06-07 16:58:05] [INFO ] Deduced a trap composed of 234 places in 676 ms of which 1 ms to minimize.
[2024-06-07 16:58:06] [INFO ] Deduced a trap composed of 96 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:58:07] [INFO ] Deduced a trap composed of 306 places in 680 ms of which 1 ms to minimize.
[2024-06-07 16:58:07] [INFO ] Deduced a trap composed of 96 places in 667 ms of which 1 ms to minimize.
[2024-06-07 16:58:08] [INFO ] Deduced a trap composed of 124 places in 680 ms of which 1 ms to minimize.
[2024-06-07 16:58:09] [INFO ] Deduced a trap composed of 174 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:58:10] [INFO ] Deduced a trap composed of 96 places in 678 ms of which 1 ms to minimize.
[2024-06-07 16:58:10] [INFO ] Deduced a trap composed of 96 places in 696 ms of which 1 ms to minimize.
[2024-06-07 16:58:11] [INFO ] Deduced a trap composed of 96 places in 686 ms of which 1 ms to minimize.
[2024-06-07 16:58:12] [INFO ] Deduced a trap composed of 96 places in 688 ms of which 1 ms to minimize.
[2024-06-07 16:58:13] [INFO ] Deduced a trap composed of 234 places in 676 ms of which 1 ms to minimize.
[2024-06-07 16:58:13] [INFO ] Deduced a trap composed of 96 places in 681 ms of which 1 ms to minimize.
[2024-06-07 16:58:14] [INFO ] Deduced a trap composed of 150 places in 657 ms of which 1 ms to minimize.
[2024-06-07 16:58:15] [INFO ] Deduced a trap composed of 174 places in 671 ms of which 1 ms to minimize.
[2024-06-07 16:58:16] [INFO ] Deduced a trap composed of 96 places in 666 ms of which 2 ms to minimize.
[2024-06-07 16:58:16] [INFO ] Deduced a trap composed of 96 places in 664 ms of which 0 ms to minimize.
[2024-06-07 16:58:17] [INFO ] Deduced a trap composed of 286 places in 656 ms of which 1 ms to minimize.
[2024-06-07 16:58:18] [INFO ] Deduced a trap composed of 264 places in 664 ms of which 1 ms to minimize.
[2024-06-07 16:58:19] [INFO ] Deduced a trap composed of 96 places in 673 ms of which 1 ms to minimize.
[2024-06-07 16:58:19] [INFO ] Deduced a trap composed of 196 places in 668 ms of which 1 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
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:58:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 16:58:19] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 67 out of 1156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1156/1156 places, 2178/2178 transitions.
Applied a total of 0 rules in 1887 ms. Remains 1156 /1156 variables (removed 0) and now considering 2178/2178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1888 ms. Remains : 1156/1156 places, 2178/2178 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 181972 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181972 steps, saw 155386 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-07 16:58:25] [INFO ] Invariant cache hit.
[2024-06-07 16:58:25] [INFO ] [Real]Absence check using 67 positive place invariants in 29 ms returned sat
[2024-06-07 16:58:25] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 16:58:25] [INFO ] [Nat]Absence check using 67 positive place invariants in 25 ms returned sat
[2024-06-07 16:58:26] [INFO ] After 771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 16:58:27] [INFO ] Deduced a trap composed of 96 places in 673 ms of which 1 ms to minimize.
[2024-06-07 16:58:28] [INFO ] Deduced a trap composed of 66 places in 673 ms of which 3 ms to minimize.
[2024-06-07 16:58:28] [INFO ] Deduced a trap composed of 96 places in 673 ms of which 1 ms to minimize.
[2024-06-07 16:58:29] [INFO ] Deduced a trap composed of 96 places in 701 ms of which 2 ms to minimize.
[2024-06-07 16:58:30] [INFO ] Deduced a trap composed of 216 places in 664 ms of which 3 ms to minimize.
[2024-06-07 16:58:31] [INFO ] Deduced a trap composed of 96 places in 682 ms of which 1 ms to minimize.
[2024-06-07 16:58:31] [INFO ] Deduced a trap composed of 196 places in 696 ms of which 1 ms to minimize.
[2024-06-07 16:58:32] [INFO ] Deduced a trap composed of 96 places in 680 ms of which 1 ms to minimize.
[2024-06-07 16:58:33] [INFO ] Deduced a trap composed of 66 places in 684 ms of which 1 ms to minimize.
[2024-06-07 16:58:34] [INFO ] Deduced a trap composed of 174 places in 681 ms of which 1 ms to minimize.
[2024-06-07 16:58:34] [INFO ] Deduced a trap composed of 96 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:58:35] [INFO ] Deduced a trap composed of 96 places in 700 ms of which 1 ms to minimize.
[2024-06-07 16:58:36] [INFO ] Deduced a trap composed of 96 places in 666 ms of which 2 ms to minimize.
[2024-06-07 16:58:37] [INFO ] Deduced a trap composed of 174 places in 693 ms of which 1 ms to minimize.
[2024-06-07 16:58:37] [INFO ] Deduced a trap composed of 276 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:58:38] [INFO ] Deduced a trap composed of 124 places in 685 ms of which 1 ms to minimize.
[2024-06-07 16:58:39] [INFO ] Deduced a trap composed of 96 places in 696 ms of which 2 ms to minimize.
[2024-06-07 16:58:40] [INFO ] Deduced a trap composed of 66 places in 691 ms of which 1 ms to minimize.
[2024-06-07 16:58:40] [INFO ] Deduced a trap composed of 96 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:58:41] [INFO ] Deduced a trap composed of 174 places in 675 ms of which 1 ms to minimize.
[2024-06-07 16:58:42] [INFO ] Deduced a trap composed of 66 places in 684 ms of which 1 ms to minimize.
[2024-06-07 16:58:43] [INFO ] Deduced a trap composed of 96 places in 680 ms of which 1 ms to minimize.
[2024-06-07 16:58:43] [INFO ] Deduced a trap composed of 96 places in 671 ms of which 1 ms to minimize.
[2024-06-07 16:58:44] [INFO ] Deduced a trap composed of 96 places in 681 ms of which 1 ms to minimize.
[2024-06-07 16:58:45] [INFO ] Deduced a trap composed of 174 places in 686 ms of which 1 ms to minimize.
[2024-06-07 16:58:46] [INFO ] Deduced a trap composed of 96 places in 671 ms of which 1 ms to minimize.
[2024-06-07 16:58:46] [INFO ] Deduced a trap composed of 96 places in 655 ms of which 1 ms to minimize.
[2024-06-07 16:58:47] [INFO ] Deduced a trap composed of 96 places in 653 ms of which 1 ms to minimize.
[2024-06-07 16:58:48] [INFO ] Deduced a trap composed of 66 places in 650 ms of which 1 ms to minimize.
[2024-06-07 16:58:48] [INFO ] Deduced a trap composed of 96 places in 655 ms of which 1 ms to minimize.
[2024-06-07 16:58:49] [INFO ] Deduced a trap composed of 300 places in 662 ms of which 1 ms to minimize.
[2024-06-07 16:58:50] [INFO ] Deduced a trap composed of 150 places in 645 ms of which 1 ms to minimize.
[2024-06-07 16:58:51] [INFO ] Deduced a trap composed of 96 places in 665 ms of which 1 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
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:58:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-06-07 16:58:51] [INFO ] After 25324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 67 out of 1156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1156/1156 places, 2178/2178 transitions.
Applied a total of 0 rules in 1869 ms. Remains 1156 /1156 variables (removed 0) and now considering 2178/2178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1869 ms. Remains : 1156/1156 places, 2178/2178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1156/1156 places, 2178/2178 transitions.
Applied a total of 0 rules in 1873 ms. Remains 1156 /1156 variables (removed 0) and now considering 2178/2178 (removed 0) transitions.
[2024-06-07 16:58:54] [INFO ] Invariant cache hit.
[2024-06-07 16:58:55] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-06-07 16:58:55] [INFO ] Invariant cache hit.
[2024-06-07 16:58:56] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2024-06-07 16:58:56] [INFO ] Redundant transitions in 155 ms returned []
[2024-06-07 16:58:56] [INFO ] Invariant cache hit.
[2024-06-07 16:58:57] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4844 ms. Remains : 1156/1156 places, 2178/2178 transitions.
Applied a total of 0 rules in 1870 ms. Remains 1156 /1156 variables (removed 0) and now considering 2178/2178 (removed 0) transitions.
Running SMT prover for 3 properties.
[2024-06-07 16:58:59] [INFO ] Invariant cache hit.
[2024-06-07 16:58:59] [INFO ] [Real]Absence check using 67 positive place invariants in 26 ms returned sat
[2024-06-07 16:58:59] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-07 16:59:00] [INFO ] [Nat]Absence check using 67 positive place invariants in 27 ms returned sat
[2024-06-07 16:59:00] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 16:59:01] [INFO ] Deduced a trap composed of 96 places in 729 ms of which 1 ms to minimize.
[2024-06-07 16:59:02] [INFO ] Deduced a trap composed of 66 places in 683 ms of which 1 ms to minimize.
[2024-06-07 16:59:03] [INFO ] Deduced a trap composed of 96 places in 698 ms of which 1 ms to minimize.
[2024-06-07 16:59:03] [INFO ] Deduced a trap composed of 96 places in 704 ms of which 1 ms to minimize.
[2024-06-07 16:59:04] [INFO ] Deduced a trap composed of 216 places in 692 ms of which 1 ms to minimize.
[2024-06-07 16:59:05] [INFO ] Deduced a trap composed of 96 places in 703 ms of which 1 ms to minimize.
[2024-06-07 16:59:06] [INFO ] Deduced a trap composed of 196 places in 701 ms of which 1 ms to minimize.
[2024-06-07 16:59:06] [INFO ] Deduced a trap composed of 96 places in 696 ms of which 1 ms to minimize.
[2024-06-07 16:59:07] [INFO ] Deduced a trap composed of 66 places in 692 ms of which 1 ms to minimize.
[2024-06-07 16:59:08] [INFO ] Deduced a trap composed of 174 places in 648 ms of which 1 ms to minimize.
[2024-06-07 16:59:09] [INFO ] Deduced a trap composed of 96 places in 682 ms of which 1 ms to minimize.
[2024-06-07 16:59:09] [INFO ] Deduced a trap composed of 96 places in 689 ms of which 1 ms to minimize.
[2024-06-07 16:59:10] [INFO ] Deduced a trap composed of 96 places in 677 ms of which 2 ms to minimize.
[2024-06-07 16:59:11] [INFO ] Deduced a trap composed of 174 places in 685 ms of which 1 ms to minimize.
[2024-06-07 16:59:12] [INFO ] Deduced a trap composed of 276 places in 684 ms of which 1 ms to minimize.
[2024-06-07 16:59:12] [INFO ] Deduced a trap composed of 124 places in 683 ms of which 1 ms to minimize.
[2024-06-07 16:59:13] [INFO ] Deduced a trap composed of 96 places in 704 ms of which 1 ms to minimize.
[2024-06-07 16:59:14] [INFO ] Deduced a trap composed of 66 places in 692 ms of which 1 ms to minimize.
[2024-06-07 16:59:15] [INFO ] Deduced a trap composed of 96 places in 697 ms of which 1 ms to minimize.
[2024-06-07 16:59:15] [INFO ] Deduced a trap composed of 174 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:59:16] [INFO ] Deduced a trap composed of 66 places in 695 ms of which 1 ms to minimize.
[2024-06-07 16:59:17] [INFO ] Deduced a trap composed of 96 places in 690 ms of which 1 ms to minimize.
[2024-06-07 16:59:18] [INFO ] Deduced a trap composed of 96 places in 685 ms of which 1 ms to minimize.
[2024-06-07 16:59:18] [INFO ] Deduced a trap composed of 96 places in 697 ms of which 1 ms to minimize.
[2024-06-07 16:59:19] [INFO ] Deduced a trap composed of 174 places in 691 ms of which 1 ms to minimize.
[2024-06-07 16:59:20] [INFO ] Deduced a trap composed of 96 places in 668 ms of which 1 ms to minimize.
[2024-06-07 16:59:21] [INFO ] Deduced a trap composed of 96 places in 691 ms of which 1 ms to minimize.
[2024-06-07 16:59:21] [INFO ] Deduced a trap composed of 96 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:59:22] [INFO ] Deduced a trap composed of 66 places in 697 ms of which 1 ms to minimize.
[2024-06-07 16:59:23] [INFO ] Deduced a trap composed of 96 places in 699 ms of which 1 ms to minimize.
[2024-06-07 16:59:24] [INFO ] Deduced a trap composed of 300 places in 676 ms of which 1 ms to minimize.
[2024-06-07 16:59:24] [INFO ] Deduced a trap composed of 150 places in 682 ms of which 1 ms to minimize.
[2024-06-07 16:59:25] [INFO ] Deduced a trap composed of 96 places in 684 ms of which 2 ms to minimize.
[2024-06-07 16:59:26] [INFO ] Deduced a trap composed of 96 places in 683 ms of which 1 ms to minimize.
[2024-06-07 16:59:27] [INFO ] Deduced a trap composed of 196 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:59:27] [INFO ] Deduced a trap composed of 96 places in 682 ms of which 1 ms to minimize.
[2024-06-07 16:59:28] [INFO ] Deduced a trap composed of 96 places in 685 ms of which 1 ms to minimize.
[2024-06-07 16:59:29] [INFO ] Deduced a trap composed of 150 places in 684 ms of which 1 ms to minimize.
[2024-06-07 16:59:30] [INFO ] Deduced a trap composed of 294 places in 685 ms of which 1 ms to minimize.
[2024-06-07 16:59:30] [INFO ] Deduced a trap composed of 96 places in 687 ms of which 1 ms to minimize.
[2024-06-07 16:59:31] [INFO ] Deduced a trap composed of 216 places in 684 ms of which 1 ms to minimize.
[2024-06-07 16:59:32] [INFO ] Deduced a trap composed of 96 places in 694 ms of which 1 ms to minimize.
[2024-06-07 16:59:33] [INFO ] Deduced a trap composed of 96 places in 696 ms of which 1 ms to minimize.
[2024-06-07 16:59:33] [INFO ] Deduced a trap composed of 96 places in 697 ms of which 1 ms to minimize.
[2024-06-07 16:59:34] [INFO ] Deduced a trap composed of 300 places in 698 ms of which 1 ms to minimize.
[2024-06-07 16:59:35] [INFO ] Deduced a trap composed of 96 places in 701 ms of which 1 ms to minimize.
[2024-06-07 16:59:36] [INFO ] Deduced a trap composed of 96 places in 697 ms of which 2 ms to minimize.
[2024-06-07 16:59:36] [INFO ] Deduced a trap composed of 250 places in 688 ms of which 1 ms to minimize.
[2024-06-07 16:59:37] [INFO ] Deduced a trap composed of 300 places in 695 ms of which 1 ms to minimize.
[2024-06-07 16:59:38] [INFO ] Deduced a trap composed of 96 places in 679 ms of which 1 ms to minimize.
[2024-06-07 16:59:39] [INFO ] Deduced a trap composed of 96 places in 695 ms of which 2 ms to minimize.
[2024-06-07 16:59:39] [INFO ] Deduced a trap composed of 300 places in 689 ms of which 2 ms to minimize.
[2024-06-07 16:59:40] [INFO ] Deduced a trap composed of 96 places in 683 ms of which 1 ms to minimize.
[2024-06-07 16:59:41] [INFO ] Deduced a trap composed of 96 places in 690 ms of which 5 ms to minimize.
[2024-06-07 16:59:42] [INFO ] Deduced a trap composed of 96 places in 705 ms of which 1 ms to minimize.
[2024-06-07 16:59:42] [INFO ] Deduced a trap composed of 96 places in 695 ms of which 1 ms to minimize.
[2024-06-07 16:59:43] [INFO ] Deduced a trap composed of 96 places in 700 ms of which 1 ms to minimize.
[2024-06-07 16:59:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 57 trap constraints in 42838 ms
[2024-06-07 16:59:45] [INFO ] Deduced a trap composed of 124 places in 703 ms of which 1 ms to minimize.
[2024-06-07 16:59:46] [INFO ] Deduced a trap composed of 66 places in 700 ms of which 1 ms to minimize.
[2024-06-07 16:59:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1510 ms
[2024-06-07 16:59:46] [INFO ] After 46038ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2024-06-07 16:59:46] [INFO ] After 46278ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Successfully simplified 15 atomic propositions for a total of 14 simplifications.
FORMULA BlocksWorld-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(((p1&&X(F(p2)))||G(F(p2))))))))'
Support contains 67 out of 1156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1156/1156 places, 2179/2179 transitions.
Applied a total of 0 rules in 24 ms. Remains 1156 /1156 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
// Phase 1: matrix 2179 rows 1156 cols
[2024-06-07 16:59:46] [INFO ] Computed 67 invariants in 16 ms
[2024-06-07 16:59:47] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-06-07 16:59:47] [INFO ] Invariant cache hit.
[2024-06-07 16:59:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:59:48] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2343 ms to find 0 implicit places.
[2024-06-07 16:59:48] [INFO ] Invariant cache hit.
[2024-06-07 16:59:49] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3243 ms. Remains : 1156/1156 places, 2179/2179 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s2 (ADD s3 s6 s9 s12 s15 s18 s21 s24 s27 s30 s33 s36 s39 s42 s45 s48 s51 s54 s57 s60 s63 s66 s69 s72 s75 s78 s81 s84 s87 s90 s93 s96 s99)), p2:(GT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 2694 ms.
Stack based approach found an accepted trace after 38081 steps with 7 reset with depth 3 and stack size 3 in 1039 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-02 finished in 7387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 1156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1156/1156 places, 2179/2179 transitions.
Applied a total of 0 rules in 287 ms. Remains 1156 /1156 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
[2024-06-07 16:59:54] [INFO ] Invariant cache hit.
[2024-06-07 16:59:54] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-06-07 16:59:54] [INFO ] Invariant cache hit.
[2024-06-07 16:59:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 16:59:56] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
[2024-06-07 16:59:56] [INFO ] Redundant transitions in 98 ms returned []
[2024-06-07 16:59:56] [INFO ] Invariant cache hit.
[2024-06-07 16:59:57] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3531 ms. Remains : 1156/1156 places, 2179/2179 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s0 s4 s7 s10 s13 s16 s19 s22 s25 s28 s31 s34 s37 s40 s43 s46 s49 s52 s55 s58 s61 s64 s67 s70 s73 s76 s79 s82 s85 s88 s91 s94 s97))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2357 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-05 finished in 5965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p0)))))'
Support contains 1 out of 1156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1156/1156 places, 2179/2179 transitions.
Applied a total of 0 rules in 26 ms. Remains 1156 /1156 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
[2024-06-07 16:59:59] [INFO ] Invariant cache hit.
[2024-06-07 17:00:00] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-06-07 17:00:00] [INFO ] Invariant cache hit.
[2024-06-07 17:00:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:00:02] [INFO ] Implicit Places using invariants and state equation in 1731 ms returned []
Implicit Place search using SMT with State Equation took 2446 ms to find 0 implicit places.
[2024-06-07 17:00:02] [INFO ] Invariant cache hit.
[2024-06-07 17:00:03] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3323 ms. Remains : 1156/1156 places, 2179/2179 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s95)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 2341 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-10 finished in 5773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1156/1156 places, 2179/2179 transitions.
Applied a total of 0 rules in 140 ms. Remains 1156 /1156 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
[2024-06-07 17:00:05] [INFO ] Invariant cache hit.
[2024-06-07 17:00:06] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-06-07 17:00:06] [INFO ] Invariant cache hit.
[2024-06-07 17:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:00:08] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 2370 ms to find 0 implicit places.
[2024-06-07 17:00:08] [INFO ] Redundant transitions in 41 ms returned []
[2024-06-07 17:00:08] [INFO ] Invariant cache hit.
[2024-06-07 17:00:08] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3404 ms. Remains : 1156/1156 places, 2179/2179 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s75 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2286 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-12 finished in 5757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 1156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1156/1156 places, 2179/2179 transitions.
Applied a total of 0 rules in 28 ms. Remains 1156 /1156 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
[2024-06-07 17:00:11] [INFO ] Invariant cache hit.
[2024-06-07 17:00:12] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-06-07 17:00:12] [INFO ] Invariant cache hit.
[2024-06-07 17:00:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:00:13] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2477 ms to find 0 implicit places.
[2024-06-07 17:00:13] [INFO ] Invariant cache hit.
[2024-06-07 17:00:14] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3361 ms. Remains : 1156/1156 places, 2179/2179 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GT 2 s3) (GT s68 s25))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-13 finished in 3523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(!p0)))))'
Support contains 1 out of 1156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1156/1156 places, 2179/2179 transitions.
Applied a total of 0 rules in 31 ms. Remains 1156 /1156 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
[2024-06-07 17:00:14] [INFO ] Invariant cache hit.
[2024-06-07 17:00:15] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-06-07 17:00:15] [INFO ] Invariant cache hit.
[2024-06-07 17:00:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 17:00:17] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 2535 ms to find 0 implicit places.
[2024-06-07 17:00:17] [INFO ] Invariant cache hit.
[2024-06-07 17:00:18] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3417 ms. Remains : 1156/1156 places, 2179/2179 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, true, p0, true]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s87)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-14 finished in 3583 ms.
All properties solved by simple procedures.
Total runtime 182790 ms.

BK_STOP 1717779619553

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-171774435600127"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;