fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761600685
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldPPPt-PT-050B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
750.224 469102.00 509302.00 1193.30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r528-tall-171683761600685.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 ltsminxred
Input is ShieldPPPt-PT-050B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600685
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 955K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717260099271

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:41:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 16:41:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:41:40] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-06-01 16:41:40] [INFO ] Transformed 3903 places.
[2024-06-01 16:41:40] [INFO ] Transformed 3553 transitions.
[2024-06-01 16:41:40] [INFO ] Found NUPN structural information;
[2024-06-01 16:41:40] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 491 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3553 rows 3903 cols
[2024-06-01 16:41:41] [INFO ] Computed 551 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 107 ms. (92 steps per ms)
FORMULA ShieldPPPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (18 resets) in 122 ms. (731 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 16:41:41] [INFO ] Invariant cache hit.
[2024-06-01 16:41:42] [INFO ] [Real]Absence check using 551 positive place invariants in 261 ms returned sat
[2024-06-01 16:41:44] [INFO ] [Real]Absence check using state equation in 1544 ms returned sat
[2024-06-01 16:41:46] [INFO ] Deduced a trap composed of 28 places in 2217 ms of which 165 ms to minimize.
[2024-06-01 16:41:46] [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:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:41:47] [INFO ] [Real]Absence check using 551 positive place invariants in 269 ms returned sat
[2024-06-01 16:41:49] [INFO ] [Real]Absence check using state equation in 1584 ms returned sat
[2024-06-01 16:41:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:41:50] [INFO ] [Nat]Absence check using 551 positive place invariants in 272 ms returned sat
[2024-06-01 16:41:51] [INFO ] [Nat]Absence check using state equation in 1605 ms returned sat
[2024-06-01 16:41:53] [INFO ] Deduced a trap composed of 53 places in 1929 ms of which 24 ms to minimize.
[2024-06-01 16:41:55] [INFO ] Deduced a trap composed of 19 places in 1895 ms of which 19 ms to minimize.
[2024-06-01 16:41:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:41:56] [INFO ] [Real]Absence check using 551 positive place invariants in 265 ms returned sat
[2024-06-01 16:41:58] [INFO ] [Real]Absence check using state equation in 1517 ms returned sat
[2024-06-01 16:42:00] [INFO ] Deduced a trap composed of 23 places in 1828 ms of which 21 ms to minimize.
[2024-06-01 16:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:42:01] [INFO ] [Nat]Absence check using 551 positive place invariants in 263 ms returned sat
[2024-06-01 16:42:02] [INFO ] [Nat]Absence check using state equation in 1548 ms returned sat
[2024-06-01 16:42:04] [INFO ] Deduced a trap composed of 23 places in 1853 ms of which 21 ms to minimize.
[2024-06-01 16:42:06] [INFO ] Deduced a trap composed of 22 places in 1826 ms of which 20 ms to minimize.
[2024-06-01 16:42:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:42:07] [INFO ] [Real]Absence check using 551 positive place invariants in 226 ms returned sat
[2024-06-01 16:42:08] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2024-06-01 16:42:10] [INFO ] Deduced a trap composed of 17 places in 1871 ms of which 21 ms to minimize.
[2024-06-01 16:42:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:42:11] [INFO ] [Nat]Absence check using 551 positive place invariants in 240 ms returned sat
[2024-06-01 16:42:13] [INFO ] [Nat]Absence check using state equation in 1458 ms returned sat
[2024-06-01 16:42:15] [INFO ] Deduced a trap composed of 17 places in 1866 ms of which 19 ms to minimize.
[2024-06-01 16:42:17] [INFO ] Deduced a trap composed of 26 places in 1799 ms of which 18 ms to minimize.
[2024-06-01 16:42:17] [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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:42:18] [INFO ] [Real]Absence check using 551 positive place invariants in 240 ms returned sat
[2024-06-01 16:42:19] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2024-06-01 16:42:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:42:20] [INFO ] [Nat]Absence check using 551 positive place invariants in 239 ms returned sat
[2024-06-01 16:42:21] [INFO ] [Nat]Absence check using state equation in 1508 ms returned sat
[2024-06-01 16:42:23] [INFO ] Deduced a trap composed of 20 places in 1801 ms of which 20 ms to minimize.
[2024-06-01 16:42:25] [INFO ] Deduced a trap composed of 25 places in 1820 ms of which 21 ms to minimize.
[2024-06-01 16:42:25] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:42:26] [INFO ] [Real]Absence check using 551 positive place invariants in 243 ms returned sat
[2024-06-01 16:42:27] [INFO ] [Real]Absence check using state equation in 1497 ms returned sat
[2024-06-01 16:42:30] [INFO ] Deduced a trap composed of 24 places in 1872 ms of which 22 ms to minimize.
[2024-06-01 16:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:42:30] [INFO ] [Nat]Absence check using 551 positive place invariants in 242 ms returned sat
[2024-06-01 16:42:32] [INFO ] [Nat]Absence check using state equation in 1523 ms returned sat
[2024-06-01 16:42:34] [INFO ] Deduced a trap composed of 24 places in 1907 ms of which 21 ms to minimize.
[2024-06-01 16:42:36] [INFO ] Deduced a trap composed of 20 places in 1920 ms of which 21 ms to minimize.
[2024-06-01 16:42: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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:42:37] [INFO ] [Real]Absence check using 551 positive place invariants in 252 ms returned sat
[2024-06-01 16:42:38] [INFO ] [Real]Absence check using state equation in 1481 ms returned sat
[2024-06-01 16:42:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:42:39] [INFO ] [Nat]Absence check using 551 positive place invariants in 242 ms returned sat
[2024-06-01 16:42:41] [INFO ] [Nat]Absence check using state equation in 1503 ms returned sat
[2024-06-01 16:42:43] [INFO ] Deduced a trap composed of 12 places in 1833 ms of which 20 ms to minimize.
[2024-06-01 16:42:44] [INFO ] Deduced a trap composed of 19 places in 1834 ms of which 21 ms to minimize.
[2024-06-01 16:42:44] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:42:45] [INFO ] [Real]Absence check using 551 positive place invariants in 241 ms returned sat
[2024-06-01 16:42:47] [INFO ] [Real]Absence check using state equation in 1447 ms returned sat
[2024-06-01 16:42:48] [INFO ] Deduced a trap composed of 27 places in 1628 ms of which 19 ms to minimize.
[2024-06-01 16:42:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:42:49] [INFO ] [Nat]Absence check using 551 positive place invariants in 238 ms returned sat
[2024-06-01 16:42:51] [INFO ] [Nat]Absence check using state equation in 1510 ms returned sat
[2024-06-01 16:42:53] [INFO ] Deduced a trap composed of 27 places in 1632 ms of which 20 ms to minimize.
[2024-06-01 16:42:54] [INFO ] Deduced a trap composed of 25 places in 1663 ms of which 19 ms to minimize.
[2024-06-01 16:42:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 16:42:55] [INFO ] [Real]Absence check using 551 positive place invariants in 239 ms returned sat
[2024-06-01 16:42:57] [INFO ] [Real]Absence check using state equation in 1540 ms returned sat
[2024-06-01 16:42:59] [INFO ] Deduced a trap composed of 23 places in 1720 ms of which 20 ms to minimize.
[2024-06-01 16:42:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:43:00] [INFO ] [Nat]Absence check using 551 positive place invariants in 242 ms returned sat
[2024-06-01 16:43:01] [INFO ] [Nat]Absence check using state equation in 1534 ms returned sat
[2024-06-01 16:43:03] [INFO ] Deduced a trap composed of 23 places in 1602 ms of which 18 ms to minimize.
[2024-06-01 16:43:05] [INFO ] Deduced a trap composed of 21 places in 1661 ms of which 18 ms to minimize.
[2024-06-01 16:43:05] [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 8
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:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 945 transitions
Trivial Post-agglo rules discarded 945 transitions
Performed 945 trivial Post agglomeration. Transition count delta: 945
Iterating post reduction 0 with 945 rules applied. Total rules applied 945 place count 3903 transition count 2608
Reduce places removed 945 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 947 rules applied. Total rules applied 1892 place count 2958 transition count 2606
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 1899 place count 2957 transition count 2600
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1905 place count 2951 transition count 2600
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 198 Pre rules applied. Total rules applied 1905 place count 2951 transition count 2402
Deduced a syphon composed of 198 places in 18 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 4 with 396 rules applied. Total rules applied 2301 place count 2753 transition count 2402
Discarding 348 places :
Symmetric choice reduction at 4 with 348 rule applications. Total rules 2649 place count 2405 transition count 2054
Iterating global reduction 4 with 348 rules applied. Total rules applied 2997 place count 2405 transition count 2054
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 2997 place count 2405 transition count 1906
Deduced a syphon composed of 148 places in 14 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 3293 place count 2257 transition count 1906
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 4 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 4 with 1698 rules applied. Total rules applied 4991 place count 1408 transition count 1057
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5193 place count 1307 transition count 1057
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 5285 place count 1261 transition count 1057
Partial Free-agglomeration rule applied 146 times.
Drop transitions (Partial Free agglomeration) removed 146 transitions
Iterating global reduction 4 with 146 rules applied. Total rules applied 5431 place count 1261 transition count 1057
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5432 place count 1260 transition count 1056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5433 place count 1259 transition count 1056
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 5433 place count 1259 transition count 1054
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 5437 place count 1257 transition count 1054
Applied a total of 5437 rules in 1340 ms. Remains 1257 /3903 variables (removed 2646) and now considering 1054/3553 (removed 2499) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1352 ms. Remains : 1257/3903 places, 1054/3553 transitions.
// Phase 1: matrix 1054 rows 1257 cols
[2024-06-01 16:43:06] [INFO ] Computed 550 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 8757 ms. (114 steps per ms)
FORMULA ShieldPPPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3212757 steps (8 resets) in 20004 ms. (160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 16:43:35] [INFO ] Invariant cache hit.
[2024-06-01 16:43:35] [INFO ] [Real]Absence check using 550 positive place invariants in 81 ms returned sat
[2024-06-01 16:43:35] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-06-01 16:43:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 16:43:35] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:43:35] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 3 ms to minimize.
[2024-06-01 16:43:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:43:36] [INFO ] [Nat]Absence check using 550 positive place invariants in 72 ms returned sat
[2024-06-01 16:43:36] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2024-06-01 16:43:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:43:36] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:43:36] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:43:36] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:43:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 428 ms
[2024-06-01 16:43:37] [INFO ] Computed and/alt/rep : 1050/2460/1050 causal constraints (skipped 0 transitions) in 59 ms.
[2024-06-01 16:43:57] [INFO ] Added : 955 causal constraints over 191 iterations in 20129 ms.(timeout) Result :sat
Minimization took 585 ms.
[2024-06-01 16:43:57] [INFO ] [Real]Absence check using 550 positive place invariants in 76 ms returned sat
[2024-06-01 16:43:58] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-06-01 16:43:58] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:43:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:43:58] [INFO ] [Nat]Absence check using 550 positive place invariants in 72 ms returned sat
[2024-06-01 16:43:58] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2024-06-01 16:43:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:43:59] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 3 ms to minimize.
[2024-06-01 16:43:59] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:43:59] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:43:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2024-06-01 16:43:59] [INFO ] Computed and/alt/rep : 1050/2460/1050 causal constraints (skipped 0 transitions) in 52 ms.
[2024-06-01 16:44:21] [INFO ] Added : 1009 causal constraints over 202 iterations in 21806 ms.(timeout) Result :sat
Minimization took 3580 ms.
[2024-06-01 16:44:25] [INFO ] [Real]Absence check using 550 positive place invariants in 74 ms returned sat
[2024-06-01 16:44:25] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2024-06-01 16:44:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:44:25] [INFO ] [Nat]Absence check using 550 positive place invariants in 73 ms returned sat
[2024-06-01 16:44:25] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2024-06-01 16:44:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:44:26] [INFO ] Computed and/alt/rep : 1050/2460/1050 causal constraints (skipped 0 transitions) in 55 ms.
[2024-06-01 16:44:46] [INFO ] Added : 965 causal constraints over 193 iterations in 20390 ms.(timeout) Result :sat
Minimization took 1689 ms.
[2024-06-01 16:44:48] [INFO ] [Real]Absence check using 550 positive place invariants in 74 ms returned sat
[2024-06-01 16:44:48] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2024-06-01 16:44:48] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:44:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:44:48] [INFO ] [Nat]Absence check using 550 positive place invariants in 74 ms returned sat
[2024-06-01 16:44:49] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2024-06-01 16:44:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:44:49] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
[2024-06-01 16:44:49] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:44:49] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:44:49] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 3 ms to minimize.
[2024-06-01 16:44:50] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 6 ms to minimize.
[2024-06-01 16:44:50] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:44:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 899 ms
[2024-06-01 16:44:50] [INFO ] Computed and/alt/rep : 1050/2460/1050 causal constraints (skipped 0 transitions) in 48 ms.
[2024-06-01 16:45:10] [INFO ] Added : 990 causal constraints over 198 iterations in 20220 ms.(timeout) Result :sat
Minimization took 707 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1257/1257 places, 1054/1054 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1257 transition count 1052
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1255 transition count 1052
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 1252 transition count 1049
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1251 transition count 1049
Applied a total of 12 rules in 205 ms. Remains 1251 /1257 variables (removed 6) and now considering 1049/1054 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 1251/1257 places, 1049/1054 transitions.
// Phase 1: matrix 1049 rows 1251 cols
[2024-06-01 16:45:14] [INFO ] Computed 550 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 8730 ms. (114 steps per ms)
BEST_FIRST walk for 3033283 steps (8 resets) in 20004 ms. (151 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 16:45:43] [INFO ] Invariant cache hit.
[2024-06-01 16:45:43] [INFO ] [Real]Absence check using 550 positive place invariants in 84 ms returned sat
[2024-06-01 16:45:43] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-06-01 16:45:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 16:45:44] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:45:44] [INFO ] [Nat]Absence check using 550 positive place invariants in 145 ms returned sat
[2024-06-01 16:45:45] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2024-06-01 16:45:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:45:45] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-06-01 16:45:45] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:45:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2024-06-01 16:45:45] [INFO ] Computed and/alt/rep : 1045/2460/1045 causal constraints (skipped 0 transitions) in 46 ms.
[2024-06-01 16:46:06] [INFO ] Added : 990 causal constraints over 198 iterations in 20777 ms.(timeout) Result :sat
Minimization took 1834 ms.
[2024-06-01 16:46:08] [INFO ] [Real]Absence check using 550 positive place invariants in 84 ms returned sat
[2024-06-01 16:46:08] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2024-06-01 16:46:08] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:46:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:46:09] [INFO ] [Nat]Absence check using 550 positive place invariants in 84 ms returned sat
[2024-06-01 16:46:09] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2024-06-01 16:46:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:46:09] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:46:09] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:46:10] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:46:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 454 ms
[2024-06-01 16:46:10] [INFO ] Computed and/alt/rep : 1045/2460/1045 causal constraints (skipped 0 transitions) in 54 ms.
[2024-06-01 16:46:32] [INFO ] Added : 1009 causal constraints over 202 iterations in 22133 ms.(timeout) Result :sat
Minimization took 1631 ms.
[2024-06-01 16:46:34] [INFO ] [Real]Absence check using 550 positive place invariants in 84 ms returned sat
[2024-06-01 16:46:34] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2024-06-01 16:46:34] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:46:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:46:34] [INFO ] [Nat]Absence check using 550 positive place invariants in 77 ms returned sat
[2024-06-01 16:46:35] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2024-06-01 16:46:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:46:35] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:46:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2024-06-01 16:46:35] [INFO ] Computed and/alt/rep : 1045/2460/1045 causal constraints (skipped 0 transitions) in 52 ms.
[2024-06-01 16:46:52] [INFO ] Added : 994 causal constraints over 199 iterations in 16777 ms. Result :sat
Minimization took 681 ms.
[2024-06-01 16:46:53] [INFO ] [Real]Absence check using 550 positive place invariants in 82 ms returned sat
[2024-06-01 16:46:53] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2024-06-01 16:46:53] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-06-01 16:46:53] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:46:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:46:54] [INFO ] [Nat]Absence check using 550 positive place invariants in 75 ms returned sat
[2024-06-01 16:46:54] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2024-06-01 16:46:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-06-01 16:46:54] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 3 ms to minimize.
[2024-06-01 16:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2024-06-01 16:46:54] [INFO ] Computed and/alt/rep : 1045/2460/1045 causal constraints (skipped 0 transitions) in 47 ms.
[2024-06-01 16:47:15] [INFO ] Added : 995 causal constraints over 199 iterations in 20437 ms.(timeout) Result :sat
Minimization took 1560 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1049/1049 transitions.
Applied a total of 0 rules in 30 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1251/1251 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1049/1049 transitions.
Applied a total of 0 rules in 28 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2024-06-01 16:47:21] [INFO ] Invariant cache hit.
[2024-06-01 16:47:22] [INFO ] Implicit Places using invariants in 730 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 733 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1249/1251 places, 1049/1049 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1247 transition count 1047
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1247 transition count 1047
Applied a total of 4 rules in 52 ms. Remains 1247 /1249 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2024-06-01 16:47:22] [INFO ] Computed 548 invariants in 10 ms
[2024-06-01 16:47:22] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-06-01 16:47:22] [INFO ] Invariant cache hit.
[2024-06-01 16:47:24] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1247/1251 places, 1047/1049 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2682 ms. Remains : 1247/1251 places, 1047/1049 transitions.
[2024-06-01 16:47:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 8582 ms. (116 steps per ms)
BEST_FIRST walk for 3234917 steps (8 resets) in 20004 ms. (161 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 16:47:52] [INFO ] Invariant cache hit.
[2024-06-01 16:47:52] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2024-06-01 16:47:53] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-06-01 16:47:53] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:47:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:47:53] [INFO ] [Nat]Absence check using 548 positive place invariants in 74 ms returned sat
[2024-06-01 16:47:53] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 3 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 16:47:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 785 ms
[2024-06-01 16:47:54] [INFO ] Computed and/alt/rep : 1043/2447/1043 causal constraints (skipped 0 transitions) in 52 ms.
[2024-06-01 16:48:12] [INFO ] Added : 981 causal constraints over 197 iterations in 18075 ms. Result :sat
Minimization took 656 ms.
[2024-06-01 16:48:13] [INFO ] [Real]Absence check using 548 positive place invariants in 89 ms returned sat
[2024-06-01 16:48:14] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 3 ms to minimize.
[2024-06-01 16:48:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:48:14] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2024-06-01 16:48:14] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2024-06-01 16:48:14] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 3 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:48:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 400 ms
[2024-06-01 16:48:15] [INFO ] Computed and/alt/rep : 1043/2447/1043 causal constraints (skipped 0 transitions) in 49 ms.
[2024-06-01 16:48:35] [INFO ] Added : 1005 causal constraints over 202 iterations in 19952 ms. Result :sat
Minimization took 1295 ms.
[2024-06-01 16:48:36] [INFO ] [Real]Absence check using 548 positive place invariants in 75 ms returned sat
[2024-06-01 16:48:37] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:48:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:48:37] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2024-06-01 16:48:37] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2024-06-01 16:48:37] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 3 ms to minimize.
[2024-06-01 16:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-06-01 16:48:37] [INFO ] Computed and/alt/rep : 1043/2447/1043 causal constraints (skipped 0 transitions) in 46 ms.
[2024-06-01 16:48:58] [INFO ] Added : 991 causal constraints over 199 iterations in 20928 ms.(timeout) Result :sat
Minimization took 1354 ms.
[2024-06-01 16:49:00] [INFO ] [Real]Absence check using 548 positive place invariants in 79 ms returned sat
[2024-06-01 16:49:00] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-06-01 16:49:00] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 16:49:01] [INFO ] [Nat]Absence check using 548 positive place invariants in 71 ms returned sat
[2024-06-01 16:49:01] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2024-06-01 16:49:01] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-06-01 16:49:01] [INFO ] Computed and/alt/rep : 1043/2447/1043 causal constraints (skipped 0 transitions) in 50 ms.
[2024-06-01 16:49:20] [INFO ] Added : 1013 causal constraints over 204 iterations in 18543 ms. Result :sat
Minimization took 4118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ShieldPPPt-PT-050B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 467905 ms.
ITS solved all properties within timeout

BK_STOP 1717260568373

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPt-PT-050B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-050B, 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 r528-tall-171683761600685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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