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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K 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 148K 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-13-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547142762

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:32:25] [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:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:32:26] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2025-05-29 19:32:26] [INFO ] Transformed 593 places.
[2025-05-29 19:32:26] [INFO ] Transformed 536 transitions.
[2025-05-29 19:32:26] [INFO ] Found NUPN structural information;
[2025-05-29 19:32:26] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 586 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Deduced a syphon composed of 8 places in 22 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 528 rows 585 cols
[2025-05-29 19:32:26] [INFO ] Computed 95 invariants in 58 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (71 resets) in 215 ms. (46 steps per ms)
FORMULA BusinessProcesses-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (85 resets) in 231 ms. (301 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 19:32:27] [INFO ] Invariant cache hit.
[2025-05-29 19:32:27] [INFO ] [Real]Absence check using 57 positive place invariants in 67 ms returned sat
[2025-05-29 19:32:27] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 36 ms returned sat
[2025-05-29 19:32:28] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2025-05-29 19:32:29] [INFO ] Deduced a trap composed of 8 places in 637 ms of which 88 ms to minimize.
[2025-05-29 19:32:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 71 ms returned sat
[2025-05-29 19:32:29] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 27 ms returned sat
[2025-05-29 19:32:30] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2025-05-29 19:32:30] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 8 ms to minimize.
[2025-05-29 19:32:30] [INFO ] Deduced a trap composed of 22 places in 451 ms of which 8 ms to minimize.
[2025-05-29 19:32:31] [INFO ] Deduced a trap composed of 14 places in 561 ms of which 8 ms to minimize.
[2025-05-29 19:32:32] [INFO ] Deduced a trap composed of 14 places in 551 ms of which 7 ms to minimize.
[2025-05-29 19:32:32] [INFO ] Deduced a trap composed of 16 places in 575 ms of which 7 ms to minimize.
[2025-05-29 19:32:33] [INFO ] Deduced a trap composed of 20 places in 568 ms of which 8 ms to minimize.
[2025-05-29 19:32:33] [INFO ] Deduced a trap composed of 15 places in 468 ms of which 7 ms to minimize.
[2025-05-29 19:32:34] [INFO ] Deduced a trap composed of 21 places in 335 ms of which 6 ms to minimize.
[2025-05-29 19:32:34] [INFO ] Deduced a trap composed of 21 places in 318 ms of which 5 ms to minimize.
[2025-05-29 19:32:34] [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:32:35] [INFO ] [Real]Absence check using 57 positive place invariants in 81 ms returned sat
[2025-05-29 19:32:35] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 39 ms returned sat
[2025-05-29 19:32:35] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2025-05-29 19:32:36] [INFO ] Deduced a trap composed of 14 places in 541 ms of which 9 ms to minimize.
[2025-05-29 19:32:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:36] [INFO ] [Nat]Absence check using 57 positive place invariants in 54 ms returned sat
[2025-05-29 19:32:36] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 31 ms returned sat
[2025-05-29 19:32:37] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2025-05-29 19:32:37] [INFO ] Deduced a trap composed of 14 places in 496 ms of which 8 ms to minimize.
[2025-05-29 19:32:38] [INFO ] Deduced a trap composed of 19 places in 471 ms of which 5 ms to minimize.
[2025-05-29 19:32:38] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 5 ms to minimize.
[2025-05-29 19:32:39] [INFO ] Deduced a trap composed of 14 places in 415 ms of which 8 ms to minimize.
[2025-05-29 19:32:39] [INFO ] Deduced a trap composed of 148 places in 471 ms of which 7 ms to minimize.
[2025-05-29 19:32:40] [INFO ] Deduced a trap composed of 22 places in 464 ms of which 7 ms to minimize.
[2025-05-29 19:32:40] [INFO ] Deduced a trap composed of 15 places in 507 ms of which 7 ms to minimize.
[2025-05-29 19:32:41] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 4 ms to minimize.
[2025-05-29 19:32:41] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 5 ms to minimize.
[2025-05-29 19:32:41] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 7 ms to minimize.
[2025-05-29 19:32:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:32:42] [INFO ] [Real]Absence check using 57 positive place invariants in 52 ms returned sat
[2025-05-29 19:32:42] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 28 ms returned sat
[2025-05-29 19:32:42] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2025-05-29 19:32:43] [INFO ] Deduced a trap composed of 21 places in 427 ms of which 7 ms to minimize.
[2025-05-29 19:32:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 51 ms returned sat
[2025-05-29 19:32:43] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 25 ms returned sat
[2025-05-29 19:32:44] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2025-05-29 19:32:44] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 7 ms to minimize.
[2025-05-29 19:32:44] [INFO ] Deduced a trap composed of 108 places in 436 ms of which 7 ms to minimize.
[2025-05-29 19:32:45] [INFO ] Deduced a trap composed of 22 places in 417 ms of which 7 ms to minimize.
[2025-05-29 19:32:45] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 5 ms to minimize.
[2025-05-29 19:32:46] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 5 ms to minimize.
[2025-05-29 19:32:46] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 5 ms to minimize.
[2025-05-29 19:32:46] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 9 ms to minimize.
[2025-05-29 19:32:46] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 5 ms to minimize.
[2025-05-29 19:32:47] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 5 ms to minimize.
[2025-05-29 19:32:47] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 5 ms to minimize.
[2025-05-29 19:32:48] [INFO ] Deduced a trap composed of 27 places in 414 ms of which 7 ms to minimize.
[2025-05-29 19:32:48] [INFO ] Deduced a trap composed of 16 places in 386 ms of which 7 ms to minimize.
[2025-05-29 19:32:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:32:48] [INFO ] [Real]Absence check using 57 positive place invariants in 57 ms returned sat
[2025-05-29 19:32:48] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 25 ms returned sat
[2025-05-29 19:32:49] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2025-05-29 19:32:49] [INFO ] Deduced a trap composed of 14 places in 479 ms of which 10 ms to minimize.
[2025-05-29 19:32:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:50] [INFO ] [Nat]Absence check using 57 positive place invariants in 59 ms returned sat
[2025-05-29 19:32:50] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 24 ms returned sat
[2025-05-29 19:32:50] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2025-05-29 19:32:51] [INFO ] Deduced a trap composed of 14 places in 465 ms of which 8 ms to minimize.
[2025-05-29 19:32:51] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 7 ms to minimize.
[2025-05-29 19:32:52] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 7 ms to minimize.
[2025-05-29 19:32:52] [INFO ] Deduced a trap composed of 15 places in 472 ms of which 7 ms to minimize.
[2025-05-29 19:32:53] [INFO ] Deduced a trap composed of 15 places in 407 ms of which 7 ms to minimize.
[2025-05-29 19:32:53] [INFO ] Deduced a trap composed of 22 places in 452 ms of which 8 ms to minimize.
[2025-05-29 19:32:53] [INFO ] Deduced a trap composed of 20 places in 399 ms of which 7 ms to minimize.
[2025-05-29 19:32:54] [INFO ] Deduced a trap composed of 24 places in 448 ms of which 8 ms to minimize.
[2025-05-29 19:32:54] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 8 ms to minimize.
[2025-05-29 19:32:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:32:55] [INFO ] [Real]Absence check using 57 positive place invariants in 53 ms returned sat
[2025-05-29 19:32:55] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 25 ms returned sat
[2025-05-29 19:32:55] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-05-29 19:32:56] [INFO ] Deduced a trap composed of 14 places in 492 ms of which 7 ms to minimize.
[2025-05-29 19:32:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:32:56] [INFO ] [Nat]Absence check using 57 positive place invariants in 51 ms returned sat
[2025-05-29 19:32:56] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 25 ms returned sat
[2025-05-29 19:32:56] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2025-05-29 19:32:57] [INFO ] Deduced a trap composed of 14 places in 480 ms of which 7 ms to minimize.
[2025-05-29 19:32:57] [INFO ] Deduced a trap composed of 27 places in 461 ms of which 7 ms to minimize.
[2025-05-29 19:32:58] [INFO ] Deduced a trap composed of 20 places in 466 ms of which 7 ms to minimize.
[2025-05-29 19:32:59] [INFO ] Deduced a trap composed of 11 places in 486 ms of which 7 ms to minimize.
[2025-05-29 19:32:59] [INFO ] Deduced a trap composed of 22 places in 460 ms of which 8 ms to minimize.
[2025-05-29 19:33:00] [INFO ] Deduced a trap composed of 12 places in 468 ms of which 8 ms to minimize.
[2025-05-29 19:33:00] [INFO ] Deduced a trap composed of 120 places in 462 ms of which 7 ms to minimize.
[2025-05-29 19:33:01] [INFO ] Deduced a trap composed of 21 places in 462 ms of which 7 ms to minimize.
[2025-05-29 19:33:01] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 7 ms to minimize.
[2025-05-29 19:33: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 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:33:01] [INFO ] [Real]Absence check using 57 positive place invariants in 55 ms returned sat
[2025-05-29 19:33:01] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 29 ms returned sat
[2025-05-29 19:33:02] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2025-05-29 19:33:02] [INFO ] Deduced a trap composed of 8 places in 461 ms of which 8 ms to minimize.
[2025-05-29 19:33:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:33:03] [INFO ] [Nat]Absence check using 57 positive place invariants in 58 ms returned sat
[2025-05-29 19:33:03] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 26 ms returned sat
[2025-05-29 19:33:03] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2025-05-29 19:33:04] [INFO ] Deduced a trap composed of 8 places in 511 ms of which 8 ms to minimize.
[2025-05-29 19:33:04] [INFO ] Deduced a trap composed of 15 places in 493 ms of which 17 ms to minimize.
[2025-05-29 19:33:05] [INFO ] Deduced a trap composed of 14 places in 528 ms of which 8 ms to minimize.
[2025-05-29 19:33:05] [INFO ] Deduced a trap composed of 36 places in 473 ms of which 8 ms to minimize.
[2025-05-29 19:33:06] [INFO ] Deduced a trap composed of 18 places in 473 ms of which 7 ms to minimize.
[2025-05-29 19:33:06] [INFO ] Deduced a trap composed of 22 places in 499 ms of which 7 ms to minimize.
[2025-05-29 19:33:07] [INFO ] Deduced a trap composed of 21 places in 486 ms of which 8 ms to minimize.
[2025-05-29 19:33:07] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 8 ms to minimize.
[2025-05-29 19:33:07] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 4241 ms
[2025-05-29 19:33:08] [INFO ] [Real]Absence check using 57 positive place invariants in 60 ms returned sat
[2025-05-29 19:33:08] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 32 ms returned sat
[2025-05-29 19:33:08] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-05-29 19:33:08] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 7 ms to minimize.
[2025-05-29 19:33:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:33:09] [INFO ] [Nat]Absence check using 57 positive place invariants in 47 ms returned sat
[2025-05-29 19:33:09] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 22 ms returned sat
[2025-05-29 19:33:09] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2025-05-29 19:33:09] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 4 ms to minimize.
[2025-05-29 19:33:10] [INFO ] Deduced a trap composed of 20 places in 321 ms of which 4 ms to minimize.
[2025-05-29 19:33:10] [INFO ] Deduced a trap composed of 110 places in 316 ms of which 5 ms to minimize.
[2025-05-29 19:33:10] [INFO ] Deduced a trap composed of 114 places in 312 ms of which 5 ms to minimize.
[2025-05-29 19:33:11] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 5 ms to minimize.
[2025-05-29 19:33:11] [INFO ] Deduced a trap composed of 16 places in 308 ms of which 5 ms to minimize.
[2025-05-29 19:33:11] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 3 ms to minimize.
[2025-05-29 19:33:12] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 3 ms to minimize.
[2025-05-29 19:33:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2494 ms
[2025-05-29 19:33:12] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 66 ms.
[2025-05-29 19:33:13] [INFO ] Added : 181 causal constraints over 37 iterations in 1738 ms. Result :sat
Minimization took 142 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 329 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 12 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 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 573 transition count 390
Reduce places removed 129 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 130 rules applied. Total rules applied 261 place count 444 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 443 transition count 389
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 262 place count 443 transition count 303
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 449 place count 342 transition count 303
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 523 place count 268 transition count 229
Iterating global reduction 3 with 74 rules applied. Total rules applied 597 place count 268 transition count 229
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 597 place count 268 transition count 222
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 612 place count 260 transition count 222
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 790 place count 170 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 792 place count 169 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 794 place count 169 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 796 place count 167 transition count 136
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 801 place count 167 transition count 136
Applied a total of 801 rules in 205 ms. Remains 167 /585 variables (removed 418) and now considering 136/528 (removed 392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 167/585 places, 136/528 transitions.
// Phase 1: matrix 136 rows 167 cols
[2025-05-29 19:33:14] [INFO ] Computed 72 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (40146 resets) in 3718 ms. (268 steps per ms)
FORMULA BusinessProcesses-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (25275 resets) in 2481 ms. (402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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:33:21] [INFO ] Flatten gal took : 104 ms
[2025-05-29 19:33:21] [INFO ] Flatten gal took : 39 ms
[2025-05-29 19:33:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11622574275623752784.gal : 22 ms
[2025-05-29 19:33:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12282950463391530635.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/ReachabilityCardinality11622574275623752784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12282950463391530635.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 55438 ms.

BK_STOP 1748547201207

--------------------
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-13"
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-13, 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-174853822500013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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