About the Execution of 2023-gold for StigmergyCommit-PT-09a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 972.331 | 62367.00 | 81730.00 | 697.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.r417-tall-171690555800126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is StigmergyCommit-PT-09a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555800126
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 11 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 51M 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 StigmergyCommit-PT-09a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717119328160
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-09a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 01:35:29] [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-31 01:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 01:35:31] [INFO ] Load time of PNML (sax parser for PT used): 2169 ms
[2024-05-31 01:35:31] [INFO ] Transformed 364 places.
[2024-05-31 01:35:32] [INFO ] Transformed 50444 transitions.
[2024-05-31 01:35:32] [INFO ] Found NUPN structural information;
[2024-05-31 01:35:32] [INFO ] Parsed PT model containing 364 places and 50444 transitions and 999956 arcs in 2556 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Normalized transition count is 2490 out of 2520 initially.
// Phase 1: matrix 2490 rows 364 cols
[2024-05-31 01:35:32] [INFO ] Computed 11 invariants in 47 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1000 ms. (steps per millisecond=10 ) properties (out of 16) seen :7
FORMULA StigmergyCommit-PT-09a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
[2024-05-31 01:35:33] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2024-05-31 01:35:33] [INFO ] Computed 11 invariants in 21 ms
[2024-05-31 01:35:34] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-05-31 01:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:34] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2024-05-31 01:35:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:35:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 01:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:35] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2024-05-31 01:35:35] [INFO ] State equation strengthened by 2185 read => feed constraints.
[2024-05-31 01:35:35] [INFO ] [Nat]Added 2185 Read/Feed constraints in 339 ms returned sat
[2024-05-31 01:35:36] [INFO ] Deduced a trap composed of 18 places in 795 ms of which 8 ms to minimize.
[2024-05-31 01:35:37] [INFO ] Deduced a trap composed of 18 places in 647 ms of which 1 ms to minimize.
[2024-05-31 01:35:38] [INFO ] Deduced a trap composed of 16 places in 520 ms of which 0 ms to minimize.
[2024-05-31 01:35:38] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 2 ms to minimize.
[2024-05-31 01:35:39] [INFO ] Deduced a trap composed of 17 places in 473 ms of which 1 ms to minimize.
[2024-05-31 01:35:39] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 0 ms to minimize.
[2024-05-31 01:35:40] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 1 ms to minimize.
[2024-05-31 01:35:40] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:35:40] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 01:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:40] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2024-05-31 01:35:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:35:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 01:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:41] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-05-31 01:35:41] [INFO ] [Nat]Added 2185 Read/Feed constraints in 316 ms returned sat
[2024-05-31 01:35:42] [INFO ] Deduced a trap composed of 16 places in 743 ms of which 2 ms to minimize.
[2024-05-31 01:35:42] [INFO ] Deduced a trap composed of 19 places in 598 ms of which 0 ms to minimize.
[2024-05-31 01:35:43] [INFO ] Deduced a trap composed of 19 places in 521 ms of which 1 ms to minimize.
[2024-05-31 01:35:43] [INFO ] Deduced a trap composed of 18 places in 427 ms of which 1 ms to minimize.
[2024-05-31 01:35:44] [INFO ] Deduced a trap composed of 18 places in 441 ms of which 1 ms to minimize.
[2024-05-31 01:35:44] [INFO ] Deduced a trap composed of 17 places in 387 ms of which 1 ms to minimize.
[2024-05-31 01:35:45] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 0 ms to minimize.
[2024-05-31 01:35:45] [INFO ] Deduced a trap composed of 16 places in 372 ms of which 0 ms to minimize.
[2024-05-31 01:35:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:35:45] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 01:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:46] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2024-05-31 01:35:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:35:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 01:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:46] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-05-31 01:35:47] [INFO ] [Nat]Added 2185 Read/Feed constraints in 430 ms returned sat
[2024-05-31 01:35:48] [INFO ] Deduced a trap composed of 19 places in 745 ms of which 1 ms to minimize.
[2024-05-31 01:35:48] [INFO ] Deduced a trap composed of 18 places in 760 ms of which 1 ms to minimize.
[2024-05-31 01:35:49] [INFO ] Deduced a trap composed of 16 places in 603 ms of which 1 ms to minimize.
[2024-05-31 01:35:50] [INFO ] Deduced a trap composed of 17 places in 573 ms of which 1 ms to minimize.
[2024-05-31 01:35:50] [INFO ] Deduced a trap composed of 18 places in 612 ms of which 1 ms to minimize.
[2024-05-31 01:35:51] [INFO ] Deduced a trap composed of 16 places in 512 ms of which 0 ms to minimize.
[2024-05-31 01:35:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:35:51] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 01:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:52] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-05-31 01:35:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:35:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 01:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:52] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2024-05-31 01:35:52] [INFO ] [Nat]Added 2185 Read/Feed constraints in 312 ms returned sat
[2024-05-31 01:35:53] [INFO ] Deduced a trap composed of 19 places in 731 ms of which 1 ms to minimize.
[2024-05-31 01:35:54] [INFO ] Deduced a trap composed of 19 places in 626 ms of which 1 ms to minimize.
[2024-05-31 01:35:54] [INFO ] Deduced a trap composed of 18 places in 514 ms of which 3 ms to minimize.
[2024-05-31 01:35:55] [INFO ] Deduced a trap composed of 17 places in 399 ms of which 0 ms to minimize.
[2024-05-31 01:35:55] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2024-05-31 01:35:56] [INFO ] Deduced a trap composed of 16 places in 387 ms of which 0 ms to minimize.
[2024-05-31 01:35:56] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 1 ms to minimize.
[2024-05-31 01:35:57] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 0 ms to minimize.
[2024-05-31 01:35:57] [INFO ] Deduced a trap composed of 17 places in 759 ms of which 1 ms to minimize.
[2024-05-31 01:35:57] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:35:57] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 01:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:58] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-05-31 01:35:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:35:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 01:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:35:58] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2024-05-31 01:35:59] [INFO ] [Nat]Added 2185 Read/Feed constraints in 311 ms returned sat
[2024-05-31 01:36:00] [INFO ] Deduced a trap composed of 17 places in 739 ms of which 0 ms to minimize.
[2024-05-31 01:36:00] [INFO ] Deduced a trap composed of 18 places in 622 ms of which 1 ms to minimize.
[2024-05-31 01:36:01] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 0 ms to minimize.
[2024-05-31 01:36:01] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 0 ms to minimize.
[2024-05-31 01:36:02] [INFO ] Deduced a trap composed of 17 places in 450 ms of which 5 ms to minimize.
[2024-05-31 01:36:02] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 1 ms to minimize.
[2024-05-31 01:36:03] [INFO ] Deduced a trap composed of 16 places in 372 ms of which 0 ms to minimize.
[2024-05-31 01:36:03] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 1 ms to minimize.
[2024-05-31 01:36:03] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:36:03] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 01:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:36:04] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-31 01:36:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 01:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:36:04] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2024-05-31 01:36:05] [INFO ] [Nat]Added 2185 Read/Feed constraints in 296 ms returned sat
[2024-05-31 01:36:05] [INFO ] Deduced a trap composed of 17 places in 698 ms of which 0 ms to minimize.
[2024-05-31 01:36:06] [INFO ] Deduced a trap composed of 16 places in 569 ms of which 1 ms to minimize.
[2024-05-31 01:36:07] [INFO ] Deduced a trap composed of 16 places in 470 ms of which 0 ms to minimize.
[2024-05-31 01:36:07] [INFO ] Deduced a trap composed of 16 places in 465 ms of which 1 ms to minimize.
[2024-05-31 01:36:08] [INFO ] Deduced a trap composed of 17 places in 408 ms of which 1 ms to minimize.
[2024-05-31 01:36:08] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 1 ms to minimize.
[2024-05-31 01:36:08] [INFO ] Deduced a trap composed of 17 places in 358 ms of which 0 ms to minimize.
[2024-05-31 01:36:09] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 0 ms to minimize.
[2024-05-31 01:36:09] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 4185 ms
[2024-05-31 01:36:09] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 01:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:36:09] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-05-31 01:36:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:36:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 01:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:36:10] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2024-05-31 01:36:10] [INFO ] [Nat]Added 2185 Read/Feed constraints in 339 ms returned sat
[2024-05-31 01:36:11] [INFO ] Deduced a trap composed of 18 places in 755 ms of which 0 ms to minimize.
[2024-05-31 01:36:12] [INFO ] Deduced a trap composed of 16 places in 652 ms of which 1 ms to minimize.
[2024-05-31 01:36:12] [INFO ] Deduced a trap composed of 16 places in 483 ms of which 0 ms to minimize.
[2024-05-31 01:36:13] [INFO ] Deduced a trap composed of 17 places in 437 ms of which 1 ms to minimize.
[2024-05-31 01:36:13] [INFO ] Deduced a trap composed of 16 places in 368 ms of which 0 ms to minimize.
[2024-05-31 01:36:14] [INFO ] Deduced a trap composed of 17 places in 356 ms of which 1 ms to minimize.
[2024-05-31 01:36:14] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 1 ms to minimize.
[2024-05-31 01:36:15] [INFO ] Deduced a trap composed of 18 places in 390 ms of which 1 ms to minimize.
[2024-05-31 01:36:15] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:36:15] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 01:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:36:15] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2024-05-31 01:36:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:36:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 01:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:36:16] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2024-05-31 01:36:16] [INFO ] [Nat]Added 2185 Read/Feed constraints in 332 ms returned sat
[2024-05-31 01:36:17] [INFO ] Deduced a trap composed of 18 places in 742 ms of which 0 ms to minimize.
[2024-05-31 01:36:17] [INFO ] Deduced a trap composed of 16 places in 613 ms of which 0 ms to minimize.
[2024-05-31 01:36:18] [INFO ] Deduced a trap composed of 17 places in 567 ms of which 1 ms to minimize.
[2024-05-31 01:36:19] [INFO ] Deduced a trap composed of 17 places in 584 ms of which 1 ms to minimize.
[2024-05-31 01:36:19] [INFO ] Deduced a trap composed of 18 places in 566 ms of which 1 ms to minimize.
[2024-05-31 01:36:20] [INFO ] Deduced a trap composed of 19 places in 523 ms of which 0 ms to minimize.
[2024-05-31 01:36:20] [INFO ] Deduced a trap composed of 19 places in 461 ms of which 1 ms to minimize.
[2024-05-31 01:36:20] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 01:36:21] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 01:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 01:36:21] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2024-05-31 01:36:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 01:36:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 01:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 01:36:21] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-05-31 01:36:22] [INFO ] [Nat]Added 2185 Read/Feed constraints in 346 ms returned sat
[2024-05-31 01:36:23] [INFO ] Deduced a trap composed of 17 places in 761 ms of which 0 ms to minimize.
[2024-05-31 01:36:23] [INFO ] Deduced a trap composed of 17 places in 629 ms of which 1 ms to minimize.
[2024-05-31 01:36:24] [INFO ] Deduced a trap composed of 16 places in 479 ms of which 1 ms to minimize.
[2024-05-31 01:36:24] [INFO ] Deduced a trap composed of 19 places in 401 ms of which 4 ms to minimize.
[2024-05-31 01:36:25] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 0 ms to minimize.
[2024-05-31 01:36:25] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 4 ms to minimize.
[2024-05-31 01:36:26] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 2 ms to minimize.
[2024-05-31 01:36:26] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 1 ms to minimize.
[2024-05-31 01:36:26] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 1 ms to minimize.
[2024-05-31 01:36: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Graph (complete) has 873 edges and 364 vertex of which 354 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.27 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 354 transition count 2420
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 108 rules applied. Total rules applied 199 place count 295 transition count 2371
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 209 place count 285 transition count 2371
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 209 place count 285 transition count 2304
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 343 place count 218 transition count 2304
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 394 place count 167 transition count 2253
Iterating global reduction 3 with 51 rules applied. Total rules applied 445 place count 167 transition count 2253
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 493 place count 119 transition count 2205
Iterating global reduction 3 with 48 rules applied. Total rules applied 541 place count 119 transition count 2205
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Iterating post reduction 3 with 1031 rules applied. Total rules applied 1572 place count 119 transition count 1174
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1580 place count 111 transition count 1166
Iterating global reduction 4 with 8 rules applied. Total rules applied 1588 place count 111 transition count 1166
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1595 place count 104 transition count 1159
Iterating global reduction 4 with 7 rules applied. Total rules applied 1602 place count 104 transition count 1159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1608 place count 104 transition count 1153
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1642 place count 87 transition count 1136
Drop transitions removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1656 place count 87 transition count 1122
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1665 place count 78 transition count 1113
Iterating global reduction 6 with 9 rules applied. Total rules applied 1674 place count 78 transition count 1113
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1683 place count 69 transition count 1104
Iterating global reduction 6 with 9 rules applied. Total rules applied 1692 place count 69 transition count 1104
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1701 place count 60 transition count 1095
Iterating global reduction 6 with 9 rules applied. Total rules applied 1710 place count 60 transition count 1095
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1713 place count 60 transition count 1092
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1719 place count 60 transition count 1092
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1722 place count 60 transition count 1089
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1723 place count 59 transition count 1088
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 6 with 9 rules applied. Total rules applied 1732 place count 58 transition count 1080
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1740 place count 50 transition count 1080
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1740 place count 50 transition count 1079
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1742 place count 49 transition count 1079
Performed 13 Post agglomeration using F-continuation condition with reduction of 1010 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1768 place count 36 transition count 56
Drop transitions removed 10 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1781 place count 36 transition count 43
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1799 place count 25 transition count 36
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1806 place count 25 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1809 place count 25 transition count 26
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 1812 place count 22 transition count 23
Applied a total of 1812 rules in 1382 ms. Remains 22 /364 variables (removed 342) and now considering 23/2520 (removed 2497) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1383 ms. Remains : 22/364 places, 23/2520 transitions.
// Phase 1: matrix 23 rows 22 cols
[2024-05-31 01:36:28] [INFO ] Computed 6 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 9) seen :9
FORMULA StigmergyCommit-PT-09a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 59038 ms.
BK_STOP 1717119390527
--------------------
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.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-09a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is StigmergyCommit-PT-09a, 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 r417-tall-171690555800126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09a.tgz
mv StigmergyCommit-PT-09a 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 '
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 ;