Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280400306.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280400306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 33K Apr 11 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 11 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 11 20:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 11 20:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 22K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 436K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 149K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 568K Apr 11 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 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 FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716652076420

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:47:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:47:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:47:59] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2024-05-25 15:47:59] [INFO ] Transformed 3271 places.
[2024-05-25 15:47:59] [INFO ] Transformed 2753 transitions.
[2024-05-25 15:47:59] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 410 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduce places removed 11 places and 0 transitions.
// Phase 1: matrix 2753 rows 3260 cols
[2024-05-25 15:48:00] [INFO ] Computed 748 invariants in 260 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 16) seen :50
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 2 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 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
[2024-05-25 15:48:00] [INFO ] Invariant cache hit.
[2024-05-25 15:48:01] [INFO ] [Real]Absence check using 61 positive place invariants in 106 ms returned sat
[2024-05-25 15:48:02] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 270 ms returned sat
[2024-05-25 15:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:04] [INFO ] [Real]Absence check using state equation in 2339 ms returned sat
[2024-05-25 15:48:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:48:05] [INFO ] [Nat]Absence check using 61 positive place invariants in 103 ms returned sat
[2024-05-25 15:48:05] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 341 ms returned sat
[2024-05-25 15:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:08] [INFO ] [Nat]Absence check using state equation in 2784 ms returned sat
[2024-05-25 15:48:09] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 379 ms.
[2024-05-25 15:48:13] [INFO ] Deduced a trap composed of 45 places in 4097 ms of which 7 ms to minimize.
[2024-05-25 15:48:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:48:14] [INFO ] [Real]Absence check using 61 positive place invariants in 106 ms returned sat
[2024-05-25 15:48:14] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 319 ms returned sat
[2024-05-25 15:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:17] [INFO ] [Real]Absence check using state equation in 2329 ms returned sat
[2024-05-25 15:48:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:48:18] [INFO ] [Nat]Absence check using 61 positive place invariants in 90 ms returned sat
[2024-05-25 15:48:18] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 257 ms returned sat
[2024-05-25 15:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:20] [INFO ] [Nat]Absence check using state equation in 2316 ms returned sat
[2024-05-25 15:48:21] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 276 ms.
[2024-05-25 15:48:27] [INFO ] Deduced a trap composed of 45 places in 4998 ms of which 6 ms to minimize.
[2024-05-25 15:48: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:48:28] [INFO ] [Real]Absence check using 61 positive place invariants in 96 ms returned sat
[2024-05-25 15:48:28] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 294 ms returned sat
[2024-05-25 15:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:30] [INFO ] [Real]Absence check using state equation in 2166 ms returned sat
[2024-05-25 15:48:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:48:31] [INFO ] [Nat]Absence check using 61 positive place invariants in 139 ms returned sat
[2024-05-25 15:48:31] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 404 ms returned sat
[2024-05-25 15:48:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:34] [INFO ] [Nat]Absence check using state equation in 2271 ms returned sat
[2024-05-25 15:48:34] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 192 ms.
[2024-05-25 15:48:39] [INFO ] Deduced a trap composed of 45 places in 3437 ms of which 4 ms to minimize.
[2024-05-25 15:48: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:48:40] [INFO ] [Real]Absence check using 61 positive place invariants in 119 ms returned sat
[2024-05-25 15:48:40] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 390 ms returned sat
[2024-05-25 15:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:43] [INFO ] [Real]Absence check using state equation in 2651 ms returned sat
[2024-05-25 15:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:48:43] [INFO ] [Nat]Absence check using 61 positive place invariants in 135 ms returned sat
[2024-05-25 15:48:44] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 443 ms returned sat
[2024-05-25 15:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:47] [INFO ] [Nat]Absence check using state equation in 2891 ms returned sat
[2024-05-25 15:48:47] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 258 ms.
[2024-05-25 15:48:51] [INFO ] Deduced a trap composed of 45 places in 3406 ms of which 5 ms to minimize.
[2024-05-25 15:48:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:48:52] [INFO ] [Real]Absence check using 61 positive place invariants in 81 ms returned sat
[2024-05-25 15:48:52] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 293 ms returned sat
[2024-05-25 15:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:54] [INFO ] [Real]Absence check using state equation in 2184 ms returned sat
[2024-05-25 15:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:48:55] [INFO ] [Nat]Absence check using 61 positive place invariants in 127 ms returned sat
[2024-05-25 15:48:55] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 424 ms returned sat
[2024-05-25 15:48:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:48:58] [INFO ] [Nat]Absence check using state equation in 2258 ms returned sat
[2024-05-25 15:48:58] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 188 ms.
[2024-05-25 15:48:59] [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.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:49:00] [INFO ] [Real]Absence check using 61 positive place invariants in 123 ms returned sat
[2024-05-25 15:49:01] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 430 ms returned sat
[2024-05-25 15:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:03] [INFO ] [Real]Absence check using state equation in 2432 ms returned sat
[2024-05-25 15:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:49:04] [INFO ] [Nat]Absence check using 61 positive place invariants in 133 ms returned sat
[2024-05-25 15:49:04] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 388 ms returned sat
[2024-05-25 15:49:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:07] [INFO ] [Nat]Absence check using state equation in 2416 ms returned sat
[2024-05-25 15:49:07] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 197 ms.
[2024-05-25 15:49:13] [INFO ] Deduced a trap composed of 45 places in 5133 ms of which 5 ms to minimize.
[2024-05-25 15:49:13] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:49:14] [INFO ] [Real]Absence check using 61 positive place invariants in 100 ms returned sat
[2024-05-25 15:49:15] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 297 ms returned unsat
[2024-05-25 15:49:15] [INFO ] [Real]Absence check using 61 positive place invariants in 93 ms returned sat
[2024-05-25 15:49:15] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 250 ms returned sat
[2024-05-25 15:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:18] [INFO ] [Real]Absence check using state equation in 2477 ms returned sat
[2024-05-25 15:49:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:49:19] [INFO ] [Nat]Absence check using 61 positive place invariants in 81 ms returned sat
[2024-05-25 15:49:19] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 255 ms returned sat
[2024-05-25 15:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:22] [INFO ] [Nat]Absence check using state equation in 2427 ms returned sat
[2024-05-25 15:49:22] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 169 ms.
[2024-05-25 15:49:23] [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:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:49:24] [INFO ] [Real]Absence check using 61 positive place invariants in 116 ms returned sat
[2024-05-25 15:49:24] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 443 ms returned sat
[2024-05-25 15:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:27] [INFO ] [Real]Absence check using state equation in 2242 ms returned sat
[2024-05-25 15:49:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:49:27] [INFO ] [Nat]Absence check using 61 positive place invariants in 79 ms returned sat
[2024-05-25 15:49:28] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 282 ms returned sat
[2024-05-25 15:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:30] [INFO ] [Nat]Absence check using state equation in 2016 ms returned sat
[2024-05-25 15:49:30] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 165 ms.
[2024-05-25 15:49:36] [INFO ] Deduced a trap composed of 45 places in 3701 ms of which 3 ms to minimize.
[2024-05-25 15:49:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:49:36] [INFO ] [Real]Absence check using 61 positive place invariants in 77 ms returned sat
[2024-05-25 15:49:37] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 268 ms returned unsat
[2024-05-25 15:49:37] [INFO ] [Real]Absence check using 61 positive place invariants in 120 ms returned sat
[2024-05-25 15:49:38] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 453 ms returned sat
[2024-05-25 15:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:40] [INFO ] [Real]Absence check using state equation in 2681 ms returned sat
[2024-05-25 15:49:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:49:41] [INFO ] [Nat]Absence check using 61 positive place invariants in 124 ms returned sat
[2024-05-25 15:49:42] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 401 ms returned sat
[2024-05-25 15:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:44] [INFO ] [Nat]Absence check using state equation in 2255 ms returned sat
[2024-05-25 15:49:44] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 167 ms.
[2024-05-25 15:49:49] [INFO ] Deduced a trap composed of 45 places in 3932 ms of which 3 ms to minimize.
[2024-05-25 15:49:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:49:50] [INFO ] [Real]Absence check using 61 positive place invariants in 124 ms returned sat
[2024-05-25 15:49:50] [INFO ] [Real]Absence check using 61 positive and 687 generalized place invariants in 273 ms returned sat
[2024-05-25 15:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:53] [INFO ] [Real]Absence check using state equation in 2219 ms returned sat
[2024-05-25 15:49:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:49:53] [INFO ] [Nat]Absence check using 61 positive place invariants in 126 ms returned sat
[2024-05-25 15:49:54] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 442 ms returned sat
[2024-05-25 15:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:49:56] [INFO ] [Nat]Absence check using state equation in 2230 ms returned sat
[2024-05-25 15:49:56] [INFO ] Computed and/alt/rep : 2541/3738/2541 causal constraints (skipped 191 transitions) in 267 ms.
[2024-05-25 15:50:02] [INFO ] Deduced a trap composed of 45 places in 4096 ms of which 3 ms to minimize.
[2024-05-25 15:50:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [12876, 722, 4292, 361, 361, 722, 2, 1023, 1, 1, 1, 1] Max seen :[6, 4, 6, 4, 5, 8, 2, 10, 0, 1, 0, 0]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 195 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Graph (complete) has 4960 edges and 3260 vertex of which 2930 are kept as prefixes of interest. Removing 330 places using SCC suffix rule.12 ms
Discarding 330 places :
Also discarding 236 output transitions
Drop transitions removed 236 transitions
Drop transitions removed 40 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 41 transitions.
Discarding 378 places :
Implicit places reduction removed 378 places
Drop transitions removed 1007 transitions
Trivial Post-agglo rules discarded 1007 transitions
Performed 1007 trivial Post agglomeration. Transition count delta: 1007
Iterating post reduction 0 with 1426 rules applied. Total rules applied 1427 place count 2552 transition count 1469
Reduce places removed 1007 places and 0 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Iterating post reduction 1 with 1133 rules applied. Total rules applied 2560 place count 1545 transition count 1343
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 2686 place count 1419 transition count 1343
Performed 166 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 166 Pre rules applied. Total rules applied 2686 place count 1419 transition count 1177
Deduced a syphon composed of 166 places in 3 ms
Ensure Unique test removed 84 places
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 416 rules applied. Total rules applied 3102 place count 1169 transition count 1177
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 63 rules applied. Total rules applied 3165 place count 1148 transition count 1135
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 3207 place count 1106 transition count 1135
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 3207 place count 1106 transition count 1114
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 3249 place count 1085 transition count 1114
Discarding 147 places :
Symmetric choice reduction at 5 with 147 rule applications. Total rules 3396 place count 938 transition count 949
Iterating global reduction 5 with 147 rules applied. Total rules applied 3543 place count 938 transition count 949
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 5 with 127 rules applied. Total rules applied 3670 place count 896 transition count 864
Reduce places removed 64 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 6 with 85 rules applied. Total rules applied 3755 place count 832 transition count 843
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3776 place count 811 transition count 843
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 64 Pre rules applied. Total rules applied 3776 place count 811 transition count 779
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 8 with 128 rules applied. Total rules applied 3904 place count 747 transition count 779
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3906 place count 745 transition count 757
Iterating global reduction 8 with 2 rules applied. Total rules applied 3908 place count 745 transition count 757
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 8 with 85 rules applied. Total rules applied 3993 place count 703 transition count 714
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 4014 place count 682 transition count 714
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 4014 place count 682 transition count 712
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 4018 place count 680 transition count 712
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 10 with 111 rules applied. Total rules applied 4129 place count 614 transition count 667
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 42 rules applied. Total rules applied 4171 place count 593 transition count 646
Free-agglomeration rule (complex) applied 107 times.
Iterating global reduction 10 with 107 rules applied. Total rules applied 4278 place count 593 transition count 539
Ensure Unique test removed 22 places
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 10 with 129 rules applied. Total rules applied 4407 place count 464 transition count 539
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 4407 place count 464 transition count 538
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4409 place count 463 transition count 538
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 4411 place count 463 transition count 538
Applied a total of 4411 rules in 844 ms. Remains 463 /3260 variables (removed 2797) and now considering 538/2753 (removed 2215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 845 ms. Remains : 463/3260 places, 538/2753 transitions.
// Phase 1: matrix 538 rows 463 cols
[2024-05-25 15:50:03] [INFO ] Computed 50 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 3349 resets, run finished after 8313 ms. (steps per millisecond=120 ) properties (out of 10) seen :97
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 202 resets, run finished after 2359 ms. (steps per millisecond=423 ) properties (out of 7) seen :47
Incomplete Best-First random walk after 1000001 steps, including 136 resets, run finished after 1896 ms. (steps per millisecond=527 ) properties (out of 7) seen :94
Incomplete Best-First random walk after 1000001 steps, including 196 resets, run finished after 1507 ms. (steps per millisecond=663 ) properties (out of 7) seen :62
Incomplete Best-First random walk after 1000001 steps, including 157 resets, run finished after 1475 ms. (steps per millisecond=677 ) properties (out of 7) seen :82
Incomplete Best-First random walk after 1000001 steps, including 169 resets, run finished after 1467 ms. (steps per millisecond=681 ) properties (out of 7) seen :69
Incomplete Best-First random walk after 1000001 steps, including 118 resets, run finished after 1596 ms. (steps per millisecond=626 ) properties (out of 7) seen :88
Incomplete Best-First random walk after 1000001 steps, including 101 resets, run finished after 1205 ms. (steps per millisecond=829 ) properties (out of 7) seen :58
[2024-05-25 15:50:23] [INFO ] Invariant cache hit.
[2024-05-25 15:50:23] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-25 15:50:23] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 35 ms returned sat
[2024-05-25 15:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:50:23] [INFO ] [Real]Absence check using state equation in 206 ms returned unsat
[2024-05-25 15:50:23] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-25 15:50:23] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 29 ms returned sat
[2024-05-25 15:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:50:23] [INFO ] [Real]Absence check using state equation in 206 ms returned unsat
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 29 ms returned sat
[2024-05-25 15:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using state equation in 203 ms returned unsat
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 31 ms returned sat
[2024-05-25 15:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using state equation in 204 ms returned unsat
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 29 ms returned sat
[2024-05-25 15:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:50:24] [INFO ] [Real]Absence check using state equation in 205 ms returned unsat
[2024-05-25 15:50:25] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-25 15:50:25] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2024-05-25 15:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:50:25] [INFO ] [Real]Absence check using state equation in 196 ms returned unsat
[2024-05-25 15:50:25] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-25 15:50:25] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2024-05-25 15:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:50:25] [INFO ] [Real]Absence check using state equation in 196 ms returned unsat
Current structural bounds on expressions (after SMT) : [21, 21, 21, 21, 21, 21, 21] Max seen :[21, 21, 21, 21, 21, 21, 21]
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-07 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-05 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-04 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-03 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-02 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-01 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-UpperBounds-00 21 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 146481 ms.

BK_STOP 1716652226607

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, 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 r175-smll-171636280400306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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