Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266200104.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is QuasiCertifProtocol-PT-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 155K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 920K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 128K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 70K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 286K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 362K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.2M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 217K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 942K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748900441213

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:40:42] [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]
[2025-06-02 21:40:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:40:42] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2025-06-02 21:40:42] [INFO ] Transformed 3806 places.
[2025-06-02 21:40:42] [INFO ] Transformed 506 transitions.
[2025-06-02 21:40:42] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Current structural bounds on expressions (Initially) : Max Seen:[33, 19, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[33, 19, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 506 rows 3806 cols
[2025-06-02 21:40:42] [INFO ] Computed 3301 invariants in 156 ms
Current structural bounds on expressions (after invariants) : Max Seen:[33, 19, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 19, 1, 1089, 1, +inf, +inf, +inf, +inf, 19, 1, 33, 33, 33, 33]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-01 19 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (267 resets) in 264 ms. (37 steps per ms)
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-09 19 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (113 resets) in 443 ms. (247 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, 1089, 1, +inf, +inf, +inf, +inf, 33, 33, 33, 33]
[2025-06-02 21:40:43] [INFO ] Invariant cache hit.
[2025-06-02 21:40:44] [INFO ] [Real]Absence check using 3 positive place invariants in 57 ms returned sat
[2025-06-02 21:40:45] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 661 ms returned unsat
[2025-06-02 21:40:45] [INFO ] [Real]Absence check using 3 positive place invariants in 52 ms returned sat
[2025-06-02 21:40:46] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 696 ms returned sat
[2025-06-02 21:40:48] [INFO ] [Real]Absence check using state equation in 1874 ms returned sat
[2025-06-02 21:40:52] [INFO ] Deduced a trap composed of 9 places in 4261 ms of which 191 ms to minimize.
[2025-06-02 21:40:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 21:40:53] [INFO ] [Real]Absence check using 3 positive place invariants in 50 ms returned sat
[2025-06-02 21:40:53] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 688 ms returned sat
[2025-06-02 21:40:55] [INFO ] [Real]Absence check using state equation in 1987 ms returned sat
[2025-06-02 21:40:55] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 48 ms.
[2025-06-02 21:40:57] [INFO ] Added : 67 causal constraints over 14 iterations in 1519 ms. Result :sat
Minimization took 176 ms.
[2025-06-02 21:40:58] [INFO ] [Real]Absence check using 3 positive place invariants in 37 ms returned sat
[2025-06-02 21:40:58] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 667 ms returned sat
[2025-06-02 21:41:00] [INFO ] [Real]Absence check using state equation in 2173 ms returned sat
[2025-06-02 21:41:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:41:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 41 ms returned sat
[2025-06-02 21:41:02] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 758 ms returned sat
[2025-06-02 21:41:04] [INFO ] [Nat]Absence check using state equation in 1868 ms returned sat
[2025-06-02 21:41:08] [INFO ] Deduced a trap composed of 13 places in 4039 ms of which 27 ms to minimize.
[2025-06-02 21:41:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 21:41:08] [INFO ] [Real]Absence check using 3 positive place invariants in 58 ms returned sat
[2025-06-02 21:41:09] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 633 ms returned sat
[2025-06-02 21:41:12] [INFO ] [Real]Absence check using state equation in 3361 ms returned sat
[2025-06-02 21:41:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:41:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 38 ms returned sat
[2025-06-02 21:41:13] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 669 ms returned sat
[2025-06-02 21:41:16] [INFO ] [Nat]Absence check using state equation in 2300 ms returned sat
[2025-06-02 21:41:16] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 42 ms.
[2025-06-02 21:41:17] [INFO ] Added : 42 causal constraints over 9 iterations in 899 ms. Result :sat
Minimization took 547 ms.
[2025-06-02 21:41:18] [INFO ] [Real]Absence check using 3 positive place invariants in 38 ms returned sat
[2025-06-02 21:41:18] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 708 ms returned sat
[2025-06-02 21:41:20] [INFO ] [Real]Absence check using state equation in 1862 ms returned sat
[2025-06-02 21:41:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:41:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 51 ms returned sat
[2025-06-02 21:41:21] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 745 ms returned sat
[2025-06-02 21:41:25] [INFO ] [Nat]Absence check using state equation in 3897 ms returned unknown
[2025-06-02 21:41:26] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2025-06-02 21:41:26] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 630 ms returned sat
[2025-06-02 21:41:28] [INFO ] [Real]Absence check using state equation in 1868 ms returned sat
[2025-06-02 21:41:28] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 45 ms.
[2025-06-02 21:41:29] [INFO ] Added : 44 causal constraints over 9 iterations in 938 ms. Result :sat
Minimization took 505 ms.
[2025-06-02 21:41:30] [INFO ] [Real]Absence check using 3 positive place invariants in 39 ms returned sat
[2025-06-02 21:41:31] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 718 ms returned sat
[2025-06-02 21:41:31] [INFO ] [Real]Absence check using state equation in 128 ms returned unsat
[2025-06-02 21:41:31] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2025-06-02 21:41:32] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 692 ms returned sat
[2025-06-02 21:41:34] [INFO ] [Real]Absence check using state equation in 2142 ms returned sat
[2025-06-02 21:41:35] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 51 ms.
[2025-06-02 21:41: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 21:41:36] [INFO ] [Real]Absence check using 3 positive place invariants in 34 ms returned sat
[2025-06-02 21:41:37] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 620 ms returned sat
[2025-06-02 21:41:39] [INFO ] [Real]Absence check using state equation in 1839 ms returned sat
[2025-06-02 21:41:39] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 38 ms.
[2025-06-02 21:41:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:41:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 37 ms returned sat
[2025-06-02 21:41:42] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 712 ms returned sat
[2025-06-02 21:41:44] [INFO ] [Nat]Absence check using state equation in 1992 ms returned sat
[2025-06-02 21:41:44] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 51 ms.
[2025-06-02 21:41:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 21:41:47] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2025-06-02 21:41:47] [INFO ] [Real]Absence check using 3 positive and 3298 generalized place invariants in 638 ms returned sat
[2025-06-02 21:41:49] [INFO ] [Real]Absence check using state equation in 1367 ms returned sat
[2025-06-02 21:41:49] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 43 ms.
[2025-06-02 21:41:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:41:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 45 ms returned sat
[2025-06-02 21:41:52] [INFO ] [Nat]Absence check using 3 positive and 3298 generalized place invariants in 637 ms returned sat
[2025-06-02 21:41:54] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2025-06-02 21:41:54] [INFO ] Computed and/alt/rep : 370/436/370 causal constraints (skipped 102 transitions) in 41 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[33, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[33, 1089, 1, +inf, +inf, +inf, +inf, 1, 33, 33, 33]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-00 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1089, 1, +inf, +inf, +inf, +inf, 33, 33, 33]
Support contains 1192 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 2648 are kept as prefixes of interest. Removing 1158 places using SCC suffix rule.20 ms
Discarding 1158 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Drop transitions (Empty/Sink Transition effects.) removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 263 rules applied. Total rules applied 264 place count 2615 transition count 244
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 295 place count 2585 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 296 place count 2584 transition count 243
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 296 place count 2584 transition count 178
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 1023 places
Reduce places removed 1088 places and 0 transitions.
Iterating global reduction 3 with 1153 rules applied. Total rules applied 1449 place count 1496 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1449 place count 1496 transition count 177
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 1452 place count 1494 transition count 177
Applied a total of 1452 rules in 232 ms. Remains 1494 /3806 variables (removed 2312) and now considering 177/506 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 1494/3806 places, 177/506 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 177 rows 1494 cols
[2025-06-02 21:41:57] [INFO ] Computed 1317 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1089, 1, +inf, +inf, +inf, +inf, 33, 33, 33]
RANDOM walk for 1000000 steps (14268 resets) in 26699 ms. (37 steps per ms)
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7267527 steps (4883 resets) in 26950 ms. (269 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33, 24, 33, 792, 1, 0, 0, 1] Max Struct:[1089, +inf, +inf, +inf, +inf, 33, 33, 33]
[2025-06-02 21:42:50] [INFO ] Invariant cache hit.
[2025-06-02 21:42:51] [INFO ] [Real]Absence check using 0 positive and 1317 generalized place invariants in 268 ms returned sat
[2025-06-02 21:42:51] [INFO ] [Real]Absence check using state equation in 347 ms returned unsat
[2025-06-02 21:42:51] [INFO ] [Real]Absence check using 0 positive and 1317 generalized place invariants in 240 ms returned sat
[2025-06-02 21:42:52] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-06-02 21:42:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:42:52] [INFO ] [Nat]Absence check using 0 positive and 1317 generalized place invariants in 252 ms returned sat
[2025-06-02 21:42:53] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2025-06-02 21:42:53] [INFO ] Computed and/alt/rep : 137/170/137 causal constraints (skipped 39 transitions) in 22 ms.
[2025-06-02 21:42:53] [INFO ] Added : 101 causal constraints over 21 iterations in 823 ms. Result :sat
Minimization took 3770 ms.
[2025-06-02 21:42:58] [INFO ] [Real]Absence check using 0 positive and 1317 generalized place invariants in 245 ms returned sat
[2025-06-02 21:42:58] [INFO ] [Real]Absence check using state equation in 401 ms returned unsat
[2025-06-02 21:42:58] [INFO ] [Real]Absence check using 0 positive and 1317 generalized place invariants in 262 ms returned sat
[2025-06-02 21:43:00] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2025-06-02 21:43:00] [INFO ] Computed and/alt/rep : 137/170/137 causal constraints (skipped 39 transitions) in 12 ms.
[2025-06-02 21:43:01] [INFO ] Added : 92 causal constraints over 19 iterations in 830 ms. Result :sat
Minimization took 4212 ms.
[2025-06-02 21:43:05] [INFO ] [Real]Absence check using 0 positive and 1317 generalized place invariants in 241 ms returned sat
[2025-06-02 21:43:06] [INFO ] [Real]Absence check using state equation in 507 ms returned unsat
[2025-06-02 21:43:06] [INFO ] [Real]Absence check using 0 positive and 1317 generalized place invariants in 232 ms returned sat
[2025-06-02 21:43:06] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-02 21:43:07] [INFO ] Computed and/alt/rep : 137/170/137 causal constraints (skipped 39 transitions) in 14 ms.
[2025-06-02 21:43:07] [INFO ] Added : 101 causal constraints over 21 iterations in 945 ms. Result :sat
Minimization took 4907 ms.
[2025-06-02 21:43:13] [INFO ] [Real]Absence check using 0 positive and 1317 generalized place invariants in 242 ms returned sat
[2025-06-02 21:43:13] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2025-06-02 21:43:14] [INFO ] Computed and/alt/rep : 137/170/137 causal constraints (skipped 39 transitions) in 12 ms.
[2025-06-02 21:43:14] [INFO ] Added : 101 causal constraints over 21 iterations in 935 ms. Result :sat
Minimization took 4202 ms.
[2025-06-02 21:43:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:43:19] [INFO ] [Nat]Absence check using 0 positive and 1317 generalized place invariants in 230 ms returned sat
[2025-06-02 21:43:20] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2025-06-02 21:43:20] [INFO ] Computed and/alt/rep : 137/170/137 causal constraints (skipped 39 transitions) in 12 ms.
[2025-06-02 21:43:20] [INFO ] Added : 101 causal constraints over 21 iterations in 778 ms. Result :sat
Minimization took 3777 ms.
[2025-06-02 21:43:25] [INFO ] [Real]Absence check using 0 positive and 1317 generalized place invariants in 255 ms returned sat
[2025-06-02 21:43:25] [INFO ] [Real]Absence check using state equation in 507 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[33, 24, 33, 792, 1, 0, 0, 1] Max Struct:[33, +inf, 33, +inf, 1, 33, 33, 1]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-06 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-03 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[33, 1089, 1, 1] Max Struct:[+inf, +inf, 33, 33]
Support contains 1124 out of 1494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1494/1494 places, 177/177 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 1461 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 1460 transition count 141
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 1460 transition count 107
Deduced a syphon composed of 34 places in 2 ms
Ensure Unique test removed 66 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 204 place count 1360 transition count 107
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 1360 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 1359 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 1358 transition count 105
Applied a total of 207 rules in 82 ms. Remains 1358 /1494 variables (removed 136) and now considering 105/177 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1358/1494 places, 105/177 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 105 rows 1358 cols
[2025-06-02 21:43:27] [INFO ] Computed 1253 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[33, 1089, 1, 1] Max Struct:[+inf, +inf, 33, 33]
RANDOM walk for 497249 steps (4758 resets) in 30001 ms. (16 steps per ms)
BEST_FIRST walk for 1661686 steps (769 resets) in 20004 ms. (83 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[33, 1089, 1, 1] Max Struct:[+inf, +inf, 33, 33]
[2025-06-02 21:44:17] [INFO ] Invariant cache hit.
[2025-06-02 21:44:18] [INFO ] [Real]Absence check using 0 positive and 1253 generalized place invariants in 244 ms returned sat
[2025-06-02 21:44:18] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2025-06-02 21:44:20] [INFO ] [Real]Absence check using 0 positive and 1253 generalized place invariants in 1886 ms returned sat
[2025-06-02 21:44:25] [INFO ] [Real]Absence check using state equation in 5521 ms returned unsat
[2025-06-02 21:44:26] [INFO ] [Real]Absence check using 0 positive and 1253 generalized place invariants in 244 ms returned sat
[2025-06-02 21:44:26] [INFO ] [Real]Absence check using state equation in 229 ms returned unsat
[2025-06-02 21:44:26] [INFO ] [Real]Absence check using 0 positive and 1253 generalized place invariants in 216 ms returned sat
[2025-06-02 21:44:27] [INFO ] [Real]Absence check using state equation in 203 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[33, 1089, 1, 1] Max Struct:[33, 1089, 1, 1]
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-07 1089 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-05 33 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 21:44:27] [INFO ] Flatten gal took : 132 ms
[2025-06-02 21:44:27] [INFO ] Flatten gal took : 54 ms
[2025-06-02 21:44:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17567554182665478770.gal : 24 ms
[2025-06-02 21:44:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10658816820446462509.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17567554182665478770.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10658816820446462509.prop' '--nowitness' '--gen-order' 'FOLLOW'

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

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 224975 ms.

BK_STOP 1748900667477

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is QuasiCertifProtocol-PT-32, 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-174881266200104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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