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.r041-smll-174853822500011.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 BusinessProcesses-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-smll-174853822500011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 141K 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 BusinessProcesses-PT-11-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547078582

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:31:21] [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-05-29 19:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:31:21] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2025-05-29 19:31:21] [INFO ] Transformed 567 places.
[2025-05-29 19:31:21] [INFO ] Transformed 508 transitions.
[2025-05-29 19:31:21] [INFO ] Found NUPN structural information;
[2025-05-29 19:31:21] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 523 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 7 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 501 rows 560 cols
[2025-05-29 19:31:21] [INFO ] Computed 95 invariants in 76 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (73 resets) in 125 ms. (79 steps per ms)
FORMULA BusinessProcesses-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (82 resets) in 149 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 19:31:22] [INFO ] Invariant cache hit.
[2025-05-29 19:31:23] [INFO ] [Real]Absence check using 53 positive place invariants in 65 ms returned sat
[2025-05-29 19:31:23] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 32 ms returned sat
[2025-05-29 19:31:23] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2025-05-29 19:31:24] [INFO ] Deduced a trap composed of 12 places in 672 ms of which 96 ms to minimize.
[2025-05-29 19:31:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:24] [INFO ] [Nat]Absence check using 53 positive place invariants in 72 ms returned sat
[2025-05-29 19:31:25] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 35 ms returned sat
[2025-05-29 19:31:25] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2025-05-29 19:31:25] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 8 ms to minimize.
[2025-05-29 19:31:26] [INFO ] Deduced a trap composed of 8 places in 458 ms of which 11 ms to minimize.
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 20 places in 595 ms of which 9 ms to minimize.
[2025-05-29 19:31:27] [INFO ] Deduced a trap composed of 22 places in 550 ms of which 8 ms to minimize.
[2025-05-29 19:31:28] [INFO ] Deduced a trap composed of 24 places in 549 ms of which 8 ms to minimize.
[2025-05-29 19:31:28] [INFO ] Deduced a trap composed of 23 places in 522 ms of which 8 ms to minimize.
[2025-05-29 19:31:29] [INFO ] Deduced a trap composed of 30 places in 521 ms of which 8 ms to minimize.
[2025-05-29 19:31:29] [INFO ] Deduced a trap composed of 33 places in 445 ms of which 8 ms to minimize.
[2025-05-29 19:31:29] [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: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-05-29 19:31:30] [INFO ] [Real]Absence check using 53 positive place invariants in 51 ms returned sat
[2025-05-29 19:31:30] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 37 ms returned sat
[2025-05-29 19:31:30] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2025-05-29 19:31:31] [INFO ] Deduced a trap composed of 15 places in 469 ms of which 7 ms to minimize.
[2025-05-29 19:31:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:31] [INFO ] [Nat]Absence check using 53 positive place invariants in 55 ms returned sat
[2025-05-29 19:31:31] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 33 ms returned sat
[2025-05-29 19:31:32] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2025-05-29 19:31:32] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 7 ms to minimize.
[2025-05-29 19:31:33] [INFO ] Deduced a trap composed of 20 places in 430 ms of which 7 ms to minimize.
[2025-05-29 19:31:33] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 7 ms to minimize.
[2025-05-29 19:31:33] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 8 ms to minimize.
[2025-05-29 19:31:34] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 7 ms to minimize.
[2025-05-29 19:31:34] [INFO ] Deduced a trap composed of 17 places in 431 ms of which 5 ms to minimize.
[2025-05-29 19:31:35] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 7 ms to minimize.
[2025-05-29 19:31:35] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 5 ms to minimize.
[2025-05-29 19:31:36] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 7 ms to minimize.
[2025-05-29 19:31:36] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 4 ms to minimize.
[2025-05-29 19:31: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 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: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-05-29 19:31:36] [INFO ] [Real]Absence check using 53 positive place invariants in 51 ms returned sat
[2025-05-29 19:31:36] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 30 ms returned sat
[2025-05-29 19:31:37] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-05-29 19:31:37] [INFO ] Deduced a trap composed of 8 places in 434 ms of which 7 ms to minimize.
[2025-05-29 19:31:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:37] [INFO ] [Nat]Absence check using 53 positive place invariants in 53 ms returned sat
[2025-05-29 19:31:37] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 28 ms returned sat
[2025-05-29 19:31:38] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-05-29 19:31:38] [INFO ] Deduced a trap composed of 8 places in 441 ms of which 7 ms to minimize.
[2025-05-29 19:31:39] [INFO ] Deduced a trap composed of 103 places in 410 ms of which 7 ms to minimize.
[2025-05-29 19:31:39] [INFO ] Deduced a trap composed of 23 places in 426 ms of which 6 ms to minimize.
[2025-05-29 19:31:40] [INFO ] Deduced a trap composed of 25 places in 419 ms of which 7 ms to minimize.
[2025-05-29 19:31:40] [INFO ] Deduced a trap composed of 25 places in 392 ms of which 6 ms to minimize.
[2025-05-29 19:31:41] [INFO ] Deduced a trap composed of 29 places in 406 ms of which 7 ms to minimize.
[2025-05-29 19:31:41] [INFO ] Deduced a trap composed of 12 places in 398 ms of which 6 ms to minimize.
[2025-05-29 19:31:42] [INFO ] Deduced a trap composed of 112 places in 398 ms of which 7 ms to minimize.
[2025-05-29 19:31:42] [INFO ] Deduced a trap composed of 110 places in 406 ms of which 7 ms to minimize.
[2025-05-29 19:31:42] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 7 ms to minimize.
[2025-05-29 19:31:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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-05-29 19:31:43] [INFO ] [Real]Absence check using 53 positive place invariants in 47 ms returned sat
[2025-05-29 19:31:43] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 30 ms returned sat
[2025-05-29 19:31:43] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2025-05-29 19:31:44] [INFO ] Deduced a trap composed of 129 places in 468 ms of which 7 ms to minimize.
[2025-05-29 19:31:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:44] [INFO ] [Nat]Absence check using 53 positive place invariants in 51 ms returned sat
[2025-05-29 19:31:44] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 35 ms returned sat
[2025-05-29 19:31:44] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2025-05-29 19:31:45] [INFO ] Deduced a trap composed of 129 places in 439 ms of which 7 ms to minimize.
[2025-05-29 19:31:45] [INFO ] Deduced a trap composed of 17 places in 459 ms of which 8 ms to minimize.
[2025-05-29 19:31:46] [INFO ] Deduced a trap composed of 21 places in 437 ms of which 8 ms to minimize.
[2025-05-29 19:31:46] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 7 ms to minimize.
[2025-05-29 19:31:47] [INFO ] Deduced a trap composed of 15 places in 440 ms of which 7 ms to minimize.
[2025-05-29 19:31:47] [INFO ] Deduced a trap composed of 12 places in 368 ms of which 7 ms to minimize.
[2025-05-29 19:31:48] [INFO ] Deduced a trap composed of 17 places in 353 ms of which 6 ms to minimize.
[2025-05-29 19:31:48] [INFO ] Deduced a trap composed of 24 places in 376 ms of which 8 ms to minimize.
[2025-05-29 19:31:48] [INFO ] Deduced a trap composed of 18 places in 380 ms of which 6 ms to minimize.
[2025-05-29 19:31:49] [INFO ] Deduced a trap composed of 119 places in 343 ms of which 6 ms to minimize.
[2025-05-29 19:31: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 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-05-29 19:31:49] [INFO ] [Real]Absence check using 53 positive place invariants in 50 ms returned sat
[2025-05-29 19:31:49] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 25 ms returned sat
[2025-05-29 19:31:49] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2025-05-29 19:31:50] [INFO ] Deduced a trap composed of 112 places in 412 ms of which 8 ms to minimize.
[2025-05-29 19:31:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:50] [INFO ] [Nat]Absence check using 53 positive place invariants in 32 ms returned sat
[2025-05-29 19:31:50] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2025-05-29 19:31:50] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2025-05-29 19:31:51] [INFO ] Deduced a trap composed of 112 places in 425 ms of which 7 ms to minimize.
[2025-05-29 19:31:51] [INFO ] Deduced a trap composed of 8 places in 428 ms of which 7 ms to minimize.
[2025-05-29 19:31:52] [INFO ] Deduced a trap composed of 22 places in 471 ms of which 8 ms to minimize.
[2025-05-29 19:31:52] [INFO ] Deduced a trap composed of 11 places in 468 ms of which 7 ms to minimize.
[2025-05-29 19:31:53] [INFO ] Deduced a trap composed of 11 places in 441 ms of which 7 ms to minimize.
[2025-05-29 19:31:53] [INFO ] Deduced a trap composed of 19 places in 472 ms of which 7 ms to minimize.
[2025-05-29 19:31:54] [INFO ] Deduced a trap composed of 32 places in 451 ms of which 8 ms to minimize.
[2025-05-29 19:31:54] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 8 ms to minimize.
[2025-05-29 19:31:55] [INFO ] Deduced a trap composed of 111 places in 408 ms of which 8 ms to minimize.
[2025-05-29 19:31:55] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 7 ms to minimize.
[2025-05-29 19:31:55] [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: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-05-29 19:31:55] [INFO ] [Real]Absence check using 53 positive place invariants in 42 ms returned sat
[2025-05-29 19:31:55] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 26 ms returned sat
[2025-05-29 19:31:56] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-05-29 19:31:56] [INFO ] Deduced a trap composed of 23 places in 328 ms of which 6 ms to minimize.
[2025-05-29 19:31:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:31:56] [INFO ] [Nat]Absence check using 53 positive place invariants in 33 ms returned sat
[2025-05-29 19:31:56] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 23 ms returned sat
[2025-05-29 19:31:57] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2025-05-29 19:31:57] [INFO ] Deduced a trap composed of 23 places in 382 ms of which 7 ms to minimize.
[2025-05-29 19:31:57] [INFO ] Deduced a trap composed of 105 places in 451 ms of which 9 ms to minimize.
[2025-05-29 19:31:58] [INFO ] Deduced a trap composed of 22 places in 433 ms of which 8 ms to minimize.
[2025-05-29 19:31:58] [INFO ] Deduced a trap composed of 19 places in 423 ms of which 7 ms to minimize.
[2025-05-29 19:31:59] [INFO ] Deduced a trap composed of 31 places in 440 ms of which 7 ms to minimize.
[2025-05-29 19:31:59] [INFO ] Deduced a trap composed of 33 places in 435 ms of which 6 ms to minimize.
[2025-05-29 19:32:00] [INFO ] Deduced a trap composed of 25 places in 432 ms of which 7 ms to minimize.
[2025-05-29 19:32:00] [INFO ] Deduced a trap composed of 17 places in 443 ms of which 7 ms to minimize.
[2025-05-29 19:32:01] [INFO ] Deduced a trap composed of 28 places in 447 ms of which 6 ms to minimize.
[2025-05-29 19:32:01] [INFO ] Deduced a trap composed of 8 places in 341 ms of which 7 ms to minimize.
[2025-05-29 19:32:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 312 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 122 place count 549 transition count 372
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 243 place count 429 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 244 place count 428 transition count 371
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 244 place count 428 transition count 282
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 195 rules applied. Total rules applied 439 place count 322 transition count 282
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 505 place count 256 transition count 216
Iterating global reduction 3 with 66 rules applied. Total rules applied 571 place count 256 transition count 216
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 571 place count 256 transition count 212
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 579 place count 252 transition count 212
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 175 rules applied. Total rules applied 754 place count 163 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 756 place count 162 transition count 130
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 758 place count 162 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 760 place count 160 transition count 128
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 765 place count 160 transition count 128
Applied a total of 765 rules in 330 ms. Remains 160 /560 variables (removed 400) and now considering 128/501 (removed 373) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 160/560 places, 128/501 transitions.
// Phase 1: matrix 128 rows 160 cols
[2025-05-29 19:32:02] [INFO ] Computed 71 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (55573 resets) in 4275 ms. (233 steps per ms)
FORMULA BusinessProcesses-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (31580 resets) in 2357 ms. (424 steps per ms)
Current structural bounds on expressions (after 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-05-29 19:32:09] [INFO ] Flatten gal took : 99 ms
[2025-05-29 19:32:09] [INFO ] Flatten gal took : 33 ms
[2025-05-29 19:32:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality406427879761227354.gal : 19 ms
[2025-05-29 19:32:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7824138441983607473.prop : 1 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/ReachabilityCardinality406427879761227354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7824138441983607473.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 48054 ms.

BK_STOP 1748547129294

--------------------
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="BusinessProcesses-PT-11"
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 BusinessProcesses-PT-11, 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 r041-smll-174853822500011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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