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

About the Execution of ITS-Tools for ShieldPPPt-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
668.764 183462.00 208765.00 377.80 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.r356-tall-171683761600669.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 itstools
Input is ShieldPPPt-PT-040B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761600669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 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 762K 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-040B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717020390222

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-29 22:06:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 22:06:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 22:06:31] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-29 22:06:31] [INFO ] Transformed 3123 places.
[2024-05-29 22:06:31] [INFO ] Transformed 2843 transitions.
[2024-05-29 22:06:31] [INFO ] Found NUPN structural information;
[2024-05-29 22:06:31] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 389 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 2843 rows 3123 cols
[2024-05-29 22:06:31] [INFO ] Computed 441 invariants in 56 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 108 ms. (91 steps per ms)
FORMULA ShieldPPPt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 138 ms. (719 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-29 22:06:32] [INFO ] Invariant cache hit.
[2024-05-29 22:06:33] [INFO ] [Real]Absence check using 441 positive place invariants in 185 ms returned sat
[2024-05-29 22:06:34] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2024-05-29 22:06:35] [INFO ] Deduced a trap composed of 25 places in 1310 ms of which 128 ms to minimize.
[2024-05-29 22:06:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:06:36] [INFO ] [Nat]Absence check using 441 positive place invariants in 196 ms returned sat
[2024-05-29 22:06:37] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2024-05-29 22:06:38] [INFO ] Deduced a trap composed of 25 places in 1089 ms of which 14 ms to minimize.
[2024-05-29 22:06:39] [INFO ] Deduced a trap composed of 21 places in 1119 ms of which 15 ms to minimize.
[2024-05-29 22:06:41] [INFO ] Deduced a trap composed of 22 places in 1164 ms of which 15 ms to minimize.
[2024-05-29 22:06:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-29 22:06:41] [INFO ] [Real]Absence check using 441 positive place invariants in 183 ms returned sat
[2024-05-29 22:06:42] [INFO ] [Real]Absence check using state equation in 1065 ms returned sat
[2024-05-29 22:06:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:06:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 173 ms returned sat
[2024-05-29 22:06:44] [INFO ] [Nat]Absence check using state equation in 1077 ms returned sat
[2024-05-29 22:06:46] [INFO ] Deduced a trap composed of 21 places in 1420 ms of which 18 ms to minimize.
[2024-05-29 22:06:47] [INFO ] Deduced a trap composed of 23 places in 1413 ms of which 17 ms to minimize.
[2024-05-29 22:06:49] [INFO ] Deduced a trap composed of 25 places in 1388 ms of which 19 ms to minimize.
[2024-05-29 22:06:49] [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-05-29 22:06:49] [INFO ] [Real]Absence check using 441 positive place invariants in 172 ms returned sat
[2024-05-29 22:06:50] [INFO ] [Real]Absence check using state equation in 1023 ms returned sat
[2024-05-29 22:06:52] [INFO ] Deduced a trap composed of 30 places in 1468 ms of which 18 ms to minimize.
[2024-05-29 22:06:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:06:53] [INFO ] [Nat]Absence check using 441 positive place invariants in 175 ms returned sat
[2024-05-29 22:06:54] [INFO ] [Nat]Absence check using state equation in 1049 ms returned sat
[2024-05-29 22:06:55] [INFO ] Deduced a trap composed of 30 places in 1473 ms of which 18 ms to minimize.
[2024-05-29 22:06:57] [INFO ] Deduced a trap composed of 18 places in 1493 ms of which 18 ms to minimize.
[2024-05-29 22:06:58] [INFO ] Deduced a trap composed of 22 places in 1401 ms of which 18 ms to minimize.
[2024-05-29 22:06:58] [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-05-29 22:06:59] [INFO ] [Real]Absence check using 441 positive place invariants in 175 ms returned sat
[2024-05-29 22:07:00] [INFO ] [Real]Absence check using state equation in 1091 ms returned sat
[2024-05-29 22:07:02] [INFO ] Deduced a trap composed of 21 places in 1339 ms of which 16 ms to minimize.
[2024-05-29 22:07:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:07:02] [INFO ] [Nat]Absence check using 441 positive place invariants in 172 ms returned sat
[2024-05-29 22:07:03] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2024-05-29 22:07:05] [INFO ] Deduced a trap composed of 21 places in 1331 ms of which 17 ms to minimize.
[2024-05-29 22:07:06] [INFO ] Deduced a trap composed of 22 places in 1337 ms of which 18 ms to minimize.
[2024-05-29 22:07:08] [INFO ] Deduced a trap composed of 18 places in 1257 ms of which 17 ms to minimize.
[2024-05-29 22:07:08] [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-05-29 22:07:08] [INFO ] [Real]Absence check using 441 positive place invariants in 176 ms returned sat
[2024-05-29 22:07:09] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2024-05-29 22:07:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:07:10] [INFO ] [Nat]Absence check using 441 positive place invariants in 180 ms returned sat
[2024-05-29 22:07:11] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2024-05-29 22:07:13] [INFO ] Deduced a trap composed of 18 places in 1491 ms of which 18 ms to minimize.
[2024-05-29 22:07:14] [INFO ] Deduced a trap composed of 13 places in 1457 ms of which 18 ms to minimize.
[2024-05-29 22:07:16] [INFO ] Deduced a trap composed of 21 places in 1368 ms of which 17 ms to minimize.
[2024-05-29 22:07:16] [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-05-29 22:07:16] [INFO ] [Real]Absence check using 441 positive place invariants in 178 ms returned sat
[2024-05-29 22:07:17] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2024-05-29 22:07:19] [INFO ] Deduced a trap composed of 31 places in 1528 ms of which 17 ms to minimize.
[2024-05-29 22:07:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:07:20] [INFO ] [Nat]Absence check using 441 positive place invariants in 181 ms returned sat
[2024-05-29 22:07:21] [INFO ] [Nat]Absence check using state equation in 1098 ms returned sat
[2024-05-29 22:07:23] [INFO ] Deduced a trap composed of 31 places in 1523 ms of which 18 ms to minimize.
[2024-05-29 22:07:24] [INFO ] Deduced a trap composed of 25 places in 1501 ms of which 18 ms to minimize.
[2024-05-29 22:07:26] [INFO ] Deduced a trap composed of 21 places in 1459 ms of which 17 ms to minimize.
[2024-05-29 22:07:26] [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-05-29 22:07:26] [INFO ] [Real]Absence check using 441 positive place invariants in 169 ms returned sat
[2024-05-29 22:07:27] [INFO ] [Real]Absence check using state equation in 1069 ms returned sat
[2024-05-29 22:07:28] [INFO ] Deduced a trap composed of 22 places in 883 ms of which 13 ms to minimize.
[2024-05-29 22:07:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:07:29] [INFO ] [Nat]Absence check using 441 positive place invariants in 176 ms returned sat
[2024-05-29 22:07:30] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2024-05-29 22:07:31] [INFO ] Deduced a trap composed of 22 places in 900 ms of which 13 ms to minimize.
[2024-05-29 22:07:32] [INFO ] Deduced a trap composed of 29 places in 874 ms of which 13 ms to minimize.
[2024-05-29 22:07:33] [INFO ] Deduced a trap composed of 33 places in 868 ms of which 13 ms to minimize.
[2024-05-29 22:07:34] [INFO ] Deduced a trap composed of 19 places in 833 ms of which 13 ms to minimize.
[2024-05-29 22:07:34] [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-05-29 22:07:35] [INFO ] [Real]Absence check using 441 positive place invariants in 174 ms returned sat
[2024-05-29 22:07:36] [INFO ] [Real]Absence check using state equation in 1095 ms returned sat
[2024-05-29 22:07:37] [INFO ] Deduced a trap composed of 35 places in 1395 ms of which 18 ms to minimize.
[2024-05-29 22:07:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:07:38] [INFO ] [Nat]Absence check using 441 positive place invariants in 175 ms returned sat
[2024-05-29 22:07:39] [INFO ] [Nat]Absence check using state equation in 1106 ms returned sat
[2024-05-29 22:07:41] [INFO ] Deduced a trap composed of 35 places in 1412 ms of which 20 ms to minimize.
[2024-05-29 22:07:42] [INFO ] Deduced a trap composed of 34 places in 1376 ms of which 17 ms to minimize.
[2024-05-29 22:07:44] [INFO ] Deduced a trap composed of 13 places in 1342 ms of which 17 ms to minimize.
[2024-05-29 22:07: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 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-05-29 22:07:44] [INFO ] [Real]Absence check using 441 positive place invariants in 174 ms returned sat
[2024-05-29 22:07:45] [INFO ] [Real]Absence check using state equation in 1096 ms returned sat
[2024-05-29 22:07:47] [INFO ] Deduced a trap composed of 29 places in 1474 ms of which 19 ms to minimize.
[2024-05-29 22:07:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:07:48] [INFO ] [Nat]Absence check using 441 positive place invariants in 175 ms returned sat
[2024-05-29 22:07:49] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2024-05-29 22:07:50] [INFO ] Deduced a trap composed of 29 places in 1468 ms of which 18 ms to minimize.
[2024-05-29 22:07:52] [INFO ] Deduced a trap composed of 21 places in 1449 ms of which 20 ms to minimize.
[2024-05-29 22:07:53] [INFO ] Deduced a trap composed of 22 places in 1436 ms of which 19 ms to minimize.
[2024-05-29 22:07:53] [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)
[2024-05-29 22:07:54] [INFO ] [Real]Absence check using 441 positive place invariants in 175 ms returned sat
[2024-05-29 22:07:55] [INFO ] [Real]Absence check using state equation in 1090 ms returned sat
[2024-05-29 22:07:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:07:56] [INFO ] [Nat]Absence check using 441 positive place invariants in 183 ms returned sat
[2024-05-29 22:07:57] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2024-05-29 22:07:58] [INFO ] Deduced a trap composed of 13 places in 1516 ms of which 16 ms to minimize.
[2024-05-29 22:08:00] [INFO ] Deduced a trap composed of 22 places in 1528 ms of which 19 ms to minimize.
[2024-05-29 22:08:02] [INFO ] Deduced a trap composed of 29 places in 1509 ms of which 19 ms to minimize.
[2024-05-29 22:08:02] [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 9
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, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 756 transitions
Trivial Post-agglo rules discarded 756 transitions
Performed 756 trivial Post agglomeration. Transition count delta: 756
Iterating post reduction 0 with 756 rules applied. Total rules applied 756 place count 3123 transition count 2087
Reduce places removed 756 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 758 rules applied. Total rules applied 1514 place count 2367 transition count 2085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1515 place count 2366 transition count 2085
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 1515 place count 2366 transition count 1925
Deduced a syphon composed of 160 places in 13 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 1835 place count 2206 transition count 1925
Discarding 279 places :
Symmetric choice reduction at 3 with 279 rule applications. Total rules 2114 place count 1927 transition count 1646
Iterating global reduction 3 with 279 rules applied. Total rules applied 2393 place count 1927 transition count 1646
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 2393 place count 1927 transition count 1527
Deduced a syphon composed of 119 places in 9 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 2631 place count 1808 transition count 1527
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 6 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 3 with 1356 rules applied. Total rules applied 3987 place count 1130 transition count 849
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 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4189 place count 1029 transition count 849
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 4215 place count 1016 transition count 849
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 4220 place count 1016 transition count 844
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 4225 place count 1011 transition count 844
Partial Free-agglomeration rule applied 119 times.
Drop transitions (Partial Free agglomeration) removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 4344 place count 1011 transition count 844
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4345 place count 1010 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4346 place count 1009 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4346 place count 1009 transition count 841
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 4350 place count 1007 transition count 841
Applied a total of 4350 rules in 1027 ms. Remains 1007 /3123 variables (removed 2116) and now considering 841/2843 (removed 2002) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1045 ms. Remains : 1007/3123 places, 841/2843 transitions.
// Phase 1: matrix 841 rows 1007 cols
[2024-05-29 22:08:03] [INFO ] Computed 440 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 7304 ms. (136 steps per ms)
FORMULA ShieldPPPt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (8 resets) in 19436 ms. (205 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-29 22:08:29] [INFO ] Invariant cache hit.
[2024-05-29 22:08:30] [INFO ] [Real]Absence check using 440 positive place invariants in 56 ms returned sat
[2024-05-29 22:08:30] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-05-29 22:08:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 22:08:30] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-29 22:08:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:08:30] [INFO ] [Nat]Absence check using 440 positive place invariants in 58 ms returned sat
[2024-05-29 22:08:30] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-05-29 22:08:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-29 22:08:30] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-29 22:08:31] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-29 22:08:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2024-05-29 22:08:31] [INFO ] Computed and/alt/rep : 837/1963/837 causal constraints (skipped 0 transitions) in 45 ms.
[2024-05-29 22:08:46] [INFO ] Added : 803 causal constraints over 162 iterations in 15117 ms. Result :sat
Minimization took 772 ms.
[2024-05-29 22:08:47] [INFO ] [Real]Absence check using 440 positive place invariants in 58 ms returned sat
[2024-05-29 22:08:47] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2024-05-29 22:08:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:08:47] [INFO ] [Nat]Absence check using 440 positive place invariants in 56 ms returned sat
[2024-05-29 22:08:47] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2024-05-29 22:08:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-29 22:08:47] [INFO ] Computed and/alt/rep : 837/1963/837 causal constraints (skipped 0 transitions) in 41 ms.
[2024-05-29 22:08:59] [INFO ] Added : 796 causal constraints over 160 iterations in 11655 ms. Result :sat
Minimization took 582 ms.
[2024-05-29 22:09:00] [INFO ] [Real]Absence check using 440 positive place invariants in 57 ms returned sat
[2024-05-29 22:09:00] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2024-05-29 22:09:00] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-29 22:09:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:09:00] [INFO ] [Nat]Absence check using 440 positive place invariants in 64 ms returned sat
[2024-05-29 22:09:01] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2024-05-29 22:09:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-29 22:09:01] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-29 22:09:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-05-29 22:09:01] [INFO ] Computed and/alt/rep : 837/1963/837 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-29 22:09:15] [INFO ] Added : 806 causal constraints over 162 iterations in 14377 ms. Result :sat
Minimization took 1659 ms.
[2024-05-29 22:09:17] [INFO ] [Real]Absence check using 440 positive place invariants in 56 ms returned sat
[2024-05-29 22:09:17] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2024-05-29 22:09:17] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-29 22:09:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:09:17] [INFO ] [Nat]Absence check using 440 positive place invariants in 60 ms returned sat
[2024-05-29 22:09:18] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-05-29 22:09:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-29 22:09:18] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 22:09:18] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-05-29 22:09:18] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-29 22:09:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 419 ms
[2024-05-29 22:09:18] [INFO ] Computed and/alt/rep : 837/1963/837 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-29 22:09:30] [INFO ] Added : 780 causal constraints over 157 iterations in 11385 ms. Result :sat
Minimization took 1243 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ShieldPPPt-PT-040B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-00 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 4 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 )
[2024-05-29 22:09:33] [INFO ] Flatten gal took : 96 ms
[2024-05-29 22:09:33] [INFO ] Flatten gal took : 54 ms
[2024-05-29 22:09:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10982929369806069049.gal : 30 ms
[2024-05-29 22:09:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11719946520686819935.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10982929369806069049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11719946520686819935.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 182289 ms.

BK_STOP 1717020573684

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//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//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-040B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPt-PT-040B, 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 r356-tall-171683761600669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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