fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r167-tall-167838853200517
Last Updated
May 14, 2023

About the Execution of LoLa+red for FlexibleBarrier-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
428.336 75853.00 93731.00 470.10 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/mcc2023-input.r167-tall-167838853200517.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FlexibleBarrier-PT-12b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853200517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 12:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 536K Mar 5 18:22 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-12b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678487611976

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 22:33:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 22:33:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:33:33] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-10 22:33:33] [INFO ] Transformed 1988 places.
[2023-03-10 22:33:33] [INFO ] Transformed 2289 transitions.
[2023-03-10 22:33:33] [INFO ] Found NUPN structural information;
[2023-03-10 22:33:33] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA FlexibleBarrier-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2289 rows 1988 cols
[2023-03-10 22:33:33] [INFO ] Computed 14 place invariants in 59 ms
Incomplete random walk after 10000 steps, including 115 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 15) seen :1
FORMULA FlexibleBarrier-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :2
FORMULA FlexibleBarrier-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 11 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :0
[2023-03-10 22:33:34] [INFO ] Invariant cache hit.
[2023-03-10 22:33:34] [INFO ] [Real]Absence check using 14 positive place invariants in 40 ms returned sat
[2023-03-10 22:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:33:35] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2023-03-10 22:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:33:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2023-03-10 22:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:33:36] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2023-03-10 22:33:37] [INFO ] Deduced a trap composed of 727 places in 713 ms of which 4 ms to minimize.
[2023-03-10 22:33:38] [INFO ] Deduced a trap composed of 690 places in 717 ms of which 2 ms to minimize.
[2023-03-10 22:33:38] [INFO ] Deduced a trap composed of 698 places in 711 ms of which 2 ms to minimize.
[2023-03-10 22:33:39] [INFO ] Deduced a trap composed of 375 places in 701 ms of which 2 ms to minimize.
[2023-03-10 22:33:40] [INFO ] Deduced a trap composed of 115 places in 643 ms of which 2 ms to minimize.
[2023-03-10 22:33:41] [INFO ] Deduced a trap composed of 753 places in 687 ms of which 1 ms to minimize.
[2023-03-10 22:33:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:33:41] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2023-03-10 22:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:33:42] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2023-03-10 22:33:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:33:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2023-03-10 22:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:33:43] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2023-03-10 22:33:44] [INFO ] Deduced a trap composed of 397 places in 828 ms of which 1 ms to minimize.
[2023-03-10 22:33:44] [INFO ] Deduced a trap composed of 725 places in 761 ms of which 1 ms to minimize.
[2023-03-10 22:33:45] [INFO ] Deduced a trap composed of 709 places in 703 ms of which 1 ms to minimize.
[2023-03-10 22:33:46] [INFO ] Deduced a trap composed of 713 places in 678 ms of which 1 ms to minimize.
[2023-03-10 22:33:47] [INFO ] Deduced a trap composed of 674 places in 636 ms of which 1 ms to minimize.
[2023-03-10 22:33:48] [INFO ] Deduced a trap composed of 14 places in 967 ms of which 2 ms to minimize.
[2023-03-10 22:33:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:33:48] [INFO ] [Real]Absence check using 14 positive place invariants in 32 ms returned sat
[2023-03-10 22:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:33:49] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2023-03-10 22:33:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:33:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 34 ms returned sat
[2023-03-10 22:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:33:50] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2023-03-10 22:33:51] [INFO ] Deduced a trap composed of 812 places in 735 ms of which 1 ms to minimize.
[2023-03-10 22:33:51] [INFO ] Deduced a trap composed of 767 places in 690 ms of which 1 ms to minimize.
[2023-03-10 22:33:52] [INFO ] Deduced a trap composed of 706 places in 673 ms of which 1 ms to minimize.
[2023-03-10 22:33:53] [INFO ] Deduced a trap composed of 115 places in 652 ms of which 1 ms to minimize.
[2023-03-10 22:33:54] [INFO ] Deduced a trap composed of 683 places in 615 ms of which 1 ms to minimize.
[2023-03-10 22:33:54] [INFO ] Deduced a trap composed of 716 places in 611 ms of which 1 ms to minimize.
[2023-03-10 22:33:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:33:55] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2023-03-10 22:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:33:55] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2023-03-10 22:33:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:33:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 33 ms returned sat
[2023-03-10 22:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:33:56] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2023-03-10 22:33:57] [INFO ] Deduced a trap composed of 204 places in 765 ms of which 1 ms to minimize.
[2023-03-10 22:33:58] [INFO ] Deduced a trap composed of 681 places in 714 ms of which 1 ms to minimize.
[2023-03-10 22:33:59] [INFO ] Deduced a trap composed of 685 places in 655 ms of which 1 ms to minimize.
[2023-03-10 22:33:59] [INFO ] Deduced a trap composed of 685 places in 627 ms of which 1 ms to minimize.
[2023-03-10 22:34:00] [INFO ] Deduced a trap composed of 667 places in 594 ms of which 1 ms to minimize.
[2023-03-10 22:34:01] [INFO ] Deduced a trap composed of 801 places in 627 ms of which 1 ms to minimize.
[2023-03-10 22:34:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:34:01] [INFO ] [Real]Absence check using 14 positive place invariants in 32 ms returned sat
[2023-03-10 22:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:02] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2023-03-10 22:34:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:34:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 34 ms returned sat
[2023-03-10 22:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:03] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2023-03-10 22:34:04] [INFO ] Deduced a trap composed of 723 places in 730 ms of which 1 ms to minimize.
[2023-03-10 22:34:04] [INFO ] Deduced a trap composed of 739 places in 685 ms of which 2 ms to minimize.
[2023-03-10 22:34:05] [INFO ] Deduced a trap composed of 723 places in 661 ms of which 1 ms to minimize.
[2023-03-10 22:34:06] [INFO ] Deduced a trap composed of 717 places in 616 ms of which 2 ms to minimize.
[2023-03-10 22:34:06] [INFO ] Deduced a trap composed of 702 places in 619 ms of which 1 ms to minimize.
[2023-03-10 22:34:07] [INFO ] Deduced a trap composed of 206 places in 611 ms of which 1 ms to minimize.
[2023-03-10 22:34:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:34:07] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-10 22:34:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:08] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2023-03-10 22:34:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:34:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 31 ms returned sat
[2023-03-10 22:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:09] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2023-03-10 22:34:09] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 149 ms.
[2023-03-10 22:34:14] [INFO ] Deduced a trap composed of 14 places in 972 ms of which 1 ms to minimize.
[2023-03-10 22:34:14] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:34:15] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-10 22:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:15] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2023-03-10 22:34:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:34:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2023-03-10 22:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:16] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2023-03-10 22:34:17] [INFO ] Deduced a trap composed of 768 places in 771 ms of which 1 ms to minimize.
[2023-03-10 22:34:18] [INFO ] Deduced a trap composed of 693 places in 640 ms of which 1 ms to minimize.
[2023-03-10 22:34:19] [INFO ] Deduced a trap composed of 696 places in 671 ms of which 1 ms to minimize.
[2023-03-10 22:34:19] [INFO ] Deduced a trap composed of 717 places in 598 ms of which 10 ms to minimize.
[2023-03-10 22:34:20] [INFO ] Deduced a trap composed of 686 places in 545 ms of which 1 ms to minimize.
[2023-03-10 22:34:21] [INFO ] Deduced a trap composed of 115 places in 570 ms of which 1 ms to minimize.
[2023-03-10 22:34:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:34:21] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-10 22:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:22] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2023-03-10 22:34:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:34:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 31 ms returned sat
[2023-03-10 22:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:23] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2023-03-10 22:34:23] [INFO ] Deduced a trap composed of 295 places in 700 ms of which 1 ms to minimize.
[2023-03-10 22:34:24] [INFO ] Deduced a trap composed of 715 places in 666 ms of which 1 ms to minimize.
[2023-03-10 22:34:24] [INFO ] Deduced a trap composed of 221 places in 247 ms of which 1 ms to minimize.
[2023-03-10 22:34:25] [INFO ] Deduced a trap composed of 211 places in 243 ms of which 0 ms to minimize.
[2023-03-10 22:34:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2195 ms
[2023-03-10 22:34:25] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 116 ms.
[2023-03-10 22:34:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:34:27] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-10 22:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:28] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2023-03-10 22:34:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:34:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 42 ms returned sat
[2023-03-10 22:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:29] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2023-03-10 22:34:29] [INFO ] Deduced a trap composed of 337 places in 706 ms of which 2 ms to minimize.
[2023-03-10 22:34:30] [INFO ] Deduced a trap composed of 205 places in 662 ms of which 1 ms to minimize.
[2023-03-10 22:34:31] [INFO ] Deduced a trap composed of 709 places in 626 ms of which 1 ms to minimize.
[2023-03-10 22:34:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2260 ms
[2023-03-10 22:34:31] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 104 ms.
[2023-03-10 22:34:33] [INFO ] Added : 95 causal constraints over 19 iterations in 1746 ms. Result :unknown
[2023-03-10 22:34:33] [INFO ] [Real]Absence check using 14 positive place invariants in 29 ms returned sat
[2023-03-10 22:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:34] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2023-03-10 22:34:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:34:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2023-03-10 22:34:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:35] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2023-03-10 22:34:36] [INFO ] Deduced a trap composed of 72 places in 704 ms of which 1 ms to minimize.
[2023-03-10 22:34:36] [INFO ] Deduced a trap composed of 707 places in 643 ms of which 1 ms to minimize.
[2023-03-10 22:34:37] [INFO ] Deduced a trap composed of 683 places in 591 ms of which 2 ms to minimize.
[2023-03-10 22:34:38] [INFO ] Deduced a trap composed of 714 places in 615 ms of which 1 ms to minimize.
[2023-03-10 22:34:38] [INFO ] Deduced a trap composed of 715 places in 554 ms of which 1 ms to minimize.
[2023-03-10 22:34:39] [INFO ] Deduced a trap composed of 705 places in 558 ms of which 1 ms to minimize.
[2023-03-10 22:34:39] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 22:34:39] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2023-03-10 22:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:40] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2023-03-10 22:34:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:34:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 32 ms returned sat
[2023-03-10 22:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:34:41] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2023-03-10 22:34:42] [INFO ] Deduced a trap composed of 748 places in 711 ms of which 2 ms to minimize.
[2023-03-10 22:34:42] [INFO ] Deduced a trap composed of 731 places in 665 ms of which 1 ms to minimize.
[2023-03-10 22:34:43] [INFO ] Deduced a trap composed of 739 places in 614 ms of which 1 ms to minimize.
[2023-03-10 22:34:44] [INFO ] Deduced a trap composed of 692 places in 586 ms of which 1 ms to minimize.
[2023-03-10 22:34:44] [INFO ] Deduced a trap composed of 721 places in 550 ms of which 1 ms to minimize.
[2023-03-10 22:34:45] [INFO ] Deduced a trap composed of 673 places in 487 ms of which 1 ms to minimize.
[2023-03-10 22:34:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1937 edges and 1988 vertex of which 74 / 1988 are part of one of the 12 SCC in 10 ms
Free SCC test removed 62 places
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 492 transitions
Trivial Post-agglo rules discarded 492 transitions
Performed 492 trivial Post agglomeration. Transition count delta: 492
Iterating post reduction 0 with 492 rules applied. Total rules applied 493 place count 1926 transition count 1722
Reduce places removed 492 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 498 rules applied. Total rules applied 991 place count 1434 transition count 1716
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 997 place count 1428 transition count 1716
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 997 place count 1428 transition count 1590
Deduced a syphon composed of 126 places in 2 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 1249 place count 1302 transition count 1590
Discarding 747 places :
Symmetric choice reduction at 3 with 747 rule applications. Total rules 1996 place count 555 transition count 843
Iterating global reduction 3 with 747 rules applied. Total rules applied 2743 place count 555 transition count 843
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 2743 place count 555 transition count 831
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 2767 place count 543 transition count 831
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2777 place count 543 transition count 821
Discarding 118 places :
Symmetric choice reduction at 4 with 118 rule applications. Total rules 2895 place count 425 transition count 703
Iterating global reduction 4 with 118 rules applied. Total rules applied 3013 place count 425 transition count 703
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 3125 place count 425 transition count 591
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 3249 place count 363 transition count 529
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 3262 place count 363 transition count 516
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 3273 place count 352 transition count 505
Iterating global reduction 6 with 11 rules applied. Total rules applied 3284 place count 352 transition count 505
Free-agglomeration rule applied 275 times.
Iterating global reduction 6 with 275 rules applied. Total rules applied 3559 place count 352 transition count 230
Reduce places removed 275 places and 0 transitions.
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 214 edges and 77 vertex of which 62 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 397 rules applied. Total rules applied 3956 place count 62 transition count 109
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3977 place count 62 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3978 place count 61 transition count 87
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t1981.t1848.t1849 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 61 edges and 58 vertex of which 42 / 58 are part of one of the 9 SCC in 0 ms
Free SCC test removed 33 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 3981 place count 25 transition count 85
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 61 rules applied. Total rules applied 4042 place count 23 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4043 place count 22 transition count 26
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 4046 place count 22 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 4049 place count 19 transition count 23
Applied a total of 4049 rules in 400 ms. Remains 19 /1988 variables (removed 1969) and now considering 23/2289 (removed 2266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 19/1988 places, 23/2289 transitions.
// Phase 1: matrix 23 rows 19 cols
[2023-03-10 22:34:45] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties (out of 11) seen :11
FORMULA FlexibleBarrier-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 73547 ms.
ITS solved all properties within timeout

BK_STOP 1678487687829

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is FlexibleBarrier-PT-12b, 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 r167-tall-167838853200517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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