fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r096-smll-165260575700061
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for FlexibleBarrier-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
340.819 94577.00 117449.00 385.00 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/mcc2022-input.r096-smll-165260575700061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575700061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 374K May 10 09:33 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 FlexibleBarrier-PT-10b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652622270847

Running Version 202205111006
[2022-05-15 13:44:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 13:44:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:44:33] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2022-05-15 13:44:33] [INFO ] Transformed 1402 places.
[2022-05-15 13:44:33] [INFO ] Transformed 1613 transitions.
[2022-05-15 13:44:33] [INFO ] Found NUPN structural information;
[2022-05-15 13:44:33] [INFO ] Parsed PT model containing 1402 places and 1613 transitions in 616 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 106 ms.
// Phase 1: matrix 1613 rows 1402 cols
[2022-05-15 13:44:34] [INFO ] Computed 12 place invariants in 95 ms
Incomplete random walk after 10000 steps, including 134 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :4
FORMULA FlexibleBarrier-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
// Phase 1: matrix 1613 rows 1402 cols
[2022-05-15 13:44:34] [INFO ] Computed 12 place invariants in 48 ms
[2022-05-15 13:44:35] [INFO ] [Real]Absence check using 12 positive place invariants in 59 ms returned sat
[2022-05-15 13:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:44:36] [INFO ] [Real]Absence check using state equation in 1100 ms returned sat
[2022-05-15 13:44:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:44:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 63 ms returned sat
[2022-05-15 13:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:44:38] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2022-05-15 13:44:40] [INFO ] Deduced a trap composed of 534 places in 1127 ms of which 10 ms to minimize.
[2022-05-15 13:44:41] [INFO ] Deduced a trap composed of 70 places in 1087 ms of which 3 ms to minimize.
[2022-05-15 13:44:42] [INFO ] Deduced a trap composed of 111 places in 1160 ms of which 3 ms to minimize.
[2022-05-15 13:44:42] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:44:43] [INFO ] [Real]Absence check using 12 positive place invariants in 57 ms returned sat
[2022-05-15 13:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:44:44] [INFO ] [Real]Absence check using state equation in 1022 ms returned sat
[2022-05-15 13:44:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:44:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 61 ms returned sat
[2022-05-15 13:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:44:45] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2022-05-15 13:44:46] [INFO ] Deduced a trap composed of 470 places in 962 ms of which 4 ms to minimize.
[2022-05-15 13:44:48] [INFO ] Deduced a trap composed of 467 places in 1312 ms of which 2 ms to minimize.
[2022-05-15 13:44:49] [INFO ] Deduced a trap composed of 467 places in 999 ms of which 1 ms to minimize.
[2022-05-15 13:44:49] [INFO ] Deduced a trap composed of 456 places in 758 ms of which 1 ms to minimize.
[2022-05-15 13:44:50] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:44:50] [INFO ] [Real]Absence check using 12 positive place invariants in 63 ms returned sat
[2022-05-15 13:44:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:44:51] [INFO ] [Real]Absence check using state equation in 1155 ms returned sat
[2022-05-15 13:44:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:44:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 61 ms returned sat
[2022-05-15 13:44:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:44:53] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2022-05-15 13:44:54] [INFO ] Deduced a trap composed of 22 places in 1093 ms of which 3 ms to minimize.
[2022-05-15 13:44:55] [INFO ] Deduced a trap composed of 564 places in 985 ms of which 1 ms to minimize.
[2022-05-15 13:44:56] [INFO ] Deduced a trap composed of 475 places in 1243 ms of which 2 ms to minimize.
[2022-05-15 13:44:56] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:44:57] [INFO ] [Real]Absence check using 12 positive place invariants in 56 ms returned sat
[2022-05-15 13:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:44:58] [INFO ] [Real]Absence check using state equation in 1109 ms returned sat
[2022-05-15 13:44:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:44:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 60 ms returned sat
[2022-05-15 13:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:00] [INFO ] [Nat]Absence check using state equation in 985 ms returned sat
[2022-05-15 13:45:01] [INFO ] Deduced a trap composed of 62 places in 1123 ms of which 2 ms to minimize.
[2022-05-15 13:45:02] [INFO ] Deduced a trap composed of 507 places in 999 ms of which 2 ms to minimize.
[2022-05-15 13:45:03] [INFO ] Deduced a trap composed of 111 places in 866 ms of which 1 ms to minimize.
[2022-05-15 13:45:04] [INFO ] Deduced a trap composed of 468 places in 913 ms of which 2 ms to minimize.
[2022-05-15 13:45:04] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:45:04] [INFO ] [Real]Absence check using 12 positive place invariants in 36 ms returned sat
[2022-05-15 13:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:05] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2022-05-15 13:45:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:45:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 60 ms returned sat
[2022-05-15 13:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:07] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2022-05-15 13:45:08] [INFO ] Deduced a trap composed of 285 places in 973 ms of which 2 ms to minimize.
[2022-05-15 13:45:09] [INFO ] Deduced a trap composed of 465 places in 1019 ms of which 2 ms to minimize.
[2022-05-15 13:45:10] [INFO ] Deduced a trap composed of 178 places in 878 ms of which 2 ms to minimize.
[2022-05-15 13:45:11] [INFO ] Deduced a trap composed of 202 places in 927 ms of which 1 ms to minimize.
[2022-05-15 13:45:11] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:45:11] [INFO ] [Real]Absence check using 12 positive place invariants in 52 ms returned sat
[2022-05-15 13:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:12] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2022-05-15 13:45:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:45:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 35 ms returned sat
[2022-05-15 13:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:13] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2022-05-15 13:45:15] [INFO ] Deduced a trap composed of 513 places in 1133 ms of which 2 ms to minimize.
[2022-05-15 13:45:16] [INFO ] Deduced a trap composed of 479 places in 1183 ms of which 1 ms to minimize.
[2022-05-15 13:45:17] [INFO ] Deduced a trap composed of 532 places in 1153 ms of which 2 ms to minimize.
[2022-05-15 13:45:18] [INFO ] Deduced a trap composed of 101 places in 995 ms of which 1 ms to minimize.
[2022-05-15 13:45:18] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:45:19] [INFO ] [Real]Absence check using 12 positive place invariants in 33 ms returned sat
[2022-05-15 13:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:19] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2022-05-15 13:45:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:45:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 58 ms returned sat
[2022-05-15 13:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:21] [INFO ] [Nat]Absence check using state equation in 1245 ms returned sat
[2022-05-15 13:45:21] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 247 ms.
[2022-05-15 13:45:26] [INFO ] Deduced a trap composed of 14 places in 1145 ms of which 2 ms to minimize.
[2022-05-15 13:45: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:45:26] [INFO ] [Real]Absence check using 12 positive place invariants in 33 ms returned sat
[2022-05-15 13:45:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:27] [INFO ] [Real]Absence check using state equation in 931 ms returned sat
[2022-05-15 13:45:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:45:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 58 ms returned sat
[2022-05-15 13:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:29] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2022-05-15 13:45:30] [INFO ] Deduced a trap composed of 62 places in 1105 ms of which 2 ms to minimize.
[2022-05-15 13:45:31] [INFO ] Deduced a trap composed of 179 places in 1233 ms of which 2 ms to minimize.
[2022-05-15 13:45:32] [INFO ] Deduced a trap composed of 103 places in 1153 ms of which 2 ms to minimize.
[2022-05-15 13:45:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:45:33] [INFO ] [Real]Absence check using 12 positive place invariants in 54 ms returned sat
[2022-05-15 13:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:34] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2022-05-15 13:45:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:45:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 35 ms returned sat
[2022-05-15 13:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:35] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2022-05-15 13:45:36] [INFO ] Deduced a trap composed of 277 places in 1046 ms of which 2 ms to minimize.
[2022-05-15 13:45:36] [INFO ] Deduced a trap composed of 103 places in 550 ms of which 2 ms to minimize.
[2022-05-15 13:45:37] [INFO ] Deduced a trap composed of 62 places in 557 ms of which 2 ms to minimize.
[2022-05-15 13:45:38] [INFO ] Deduced a trap composed of 472 places in 881 ms of which 1 ms to minimize.
[2022-05-15 13:45:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3439 ms
[2022-05-15 13:45:38] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 136 ms.
[2022-05-15 13:45:40] [INFO ] Deduced a trap composed of 14 places in 1687 ms of which 2 ms to minimize.
[2022-05-15 13:45: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:45:41] [INFO ] [Real]Absence check using 12 positive place invariants in 51 ms returned sat
[2022-05-15 13:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:42] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2022-05-15 13:45:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:45:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 58 ms returned sat
[2022-05-15 13:45:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:44] [INFO ] [Nat]Absence check using state equation in 1255 ms returned sat
[2022-05-15 13:45:45] [INFO ] Deduced a trap composed of 62 places in 1132 ms of which 1 ms to minimize.
[2022-05-15 13:45:46] [INFO ] Deduced a trap composed of 492 places in 1120 ms of which 2 ms to minimize.
[2022-05-15 13:45:47] [INFO ] Deduced a trap composed of 533 places in 1151 ms of which 3 ms to minimize.
[2022-05-15 13:45:47] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:45:48] [INFO ] [Real]Absence check using 12 positive place invariants in 56 ms returned sat
[2022-05-15 13:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:49] [INFO ] [Real]Absence check using state equation in 1224 ms returned sat
[2022-05-15 13:45:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:45:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 51 ms returned sat
[2022-05-15 13:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:51] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2022-05-15 13:45:51] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 164 ms.
[2022-05-15 13:45:56] [INFO ] Deduced a trap composed of 14 places in 1716 ms of which 3 ms to minimize.
[2022-05-15 13:45:56] [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 10
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 13:45:57] [INFO ] [Real]Absence check using 12 positive place invariants in 55 ms returned sat
[2022-05-15 13:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:58] [INFO ] [Real]Absence check using state equation in 1035 ms returned sat
[2022-05-15 13:45:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:45:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 36 ms returned sat
[2022-05-15 13:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:45:59] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2022-05-15 13:45:59] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 157 ms.
[2022-05-15 13:46: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 11
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 1402 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1353 edges and 1402 vertex of which 62 / 1402 are part of one of the 10 SCC in 19 ms
Free SCC test removed 52 places
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 352 place count 1350 transition count 1199
Reduce places removed 351 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 355 rules applied. Total rules applied 707 place count 999 transition count 1195
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 711 place count 995 transition count 1195
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 711 place count 995 transition count 1107
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 887 place count 907 transition count 1107
Discarding 505 places :
Symmetric choice reduction at 3 with 505 rule applications. Total rules 1392 place count 402 transition count 602
Iterating global reduction 3 with 505 rules applied. Total rules applied 1897 place count 402 transition count 602
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1897 place count 402 transition count 595
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1911 place count 395 transition count 595
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 1988 place count 318 transition count 518
Iterating global reduction 3 with 77 rules applied. Total rules applied 2065 place count 318 transition count 518
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 3 with 75 rules applied. Total rules applied 2140 place count 318 transition count 443
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 2244 place count 266 transition count 391
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 2263 place count 266 transition count 372
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 2272 place count 257 transition count 363
Iterating global reduction 5 with 9 rules applied. Total rules applied 2281 place count 257 transition count 363
Free-agglomeration rule applied 189 times.
Iterating global reduction 5 with 189 rules applied. Total rules applied 2470 place count 257 transition count 174
Reduce places removed 189 places and 0 transitions.
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 179 edges and 68 vertex of which 63 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 270 rules applied. Total rules applied 2740 place count 63 transition count 94
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2747 place count 63 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2748 place count 62 transition count 86
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 44 edges and 61 vertex of which 14 / 61 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 2751 place count 54 transition count 85
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 2766 place count 53 transition count 71
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 2766 place count 53 transition count 61
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 2786 place count 43 transition count 61
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 2793 place count 43 transition count 54
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 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 2807 place count 36 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 2808 place count 36 transition count 46
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2816 place count 36 transition count 38
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 2835 place count 24 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2836 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2837 place count 23 transition count 30
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2838 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 2839 place count 22 transition count 29
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 2841 place count 22 transition count 29
Applied a total of 2841 rules in 549 ms. Remains 22 /1402 variables (removed 1380) and now considering 29/1613 (removed 1584) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/1402 places, 29/1613 transitions.
// Phase 1: matrix 29 rows 22 cols
[2022-05-15 13:46:03] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1565 ms. (steps per millisecond=638 ) properties (out of 12) seen :12
FORMULA FlexibleBarrier-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 92045 ms.

BK_STOP 1652622365424

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="FlexibleBarrier-PT-10b"
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-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-10b, 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 r096-smll-165260575700061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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