Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399600501.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717225281223

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:01:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:01:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:01:22] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-01 07:01:22] [INFO ] Transformed 386 places.
[2024-06-01 07:01:22] [INFO ] Transformed 360 transitions.
[2024-06-01 07:01:22] [INFO ] Found NUPN structural information;
[2024-06-01 07:01:22] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
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 360 rows 386 cols
[2024-06-01 07:01:22] [INFO ] Computed 62 invariants in 27 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 (110 resets) in 42 ms. (232 steps per ms)
FORMULA BusinessProcesses-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (79 resets) in 48 ms. (816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 07:01:22] [INFO ] Invariant cache hit.
[2024-06-01 07:01:23] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2024-06-01 07:01:23] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2024-06-01 07:01:23] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-06-01 07:01:23] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 16 ms to minimize.
[2024-06-01 07:01:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2024-06-01 07:01:23] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2024-06-01 07:01:23] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:24] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:01:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1847 ms
[2024-06-01 07:01:25] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 36 ms.
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:01:27] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:01:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 366 ms
[2024-06-01 07:01:27] [INFO ] Added : 217 causal constraints over 47 iterations in 1678 ms. Result :sat
Minimization took 353 ms.
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2024-06-01 07:01:27] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2024-06-01 07:01:28] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2024-06-01 07:01:28] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2024-06-01 07:01:28] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:01:28] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1201 ms
[2024-06-01 07:01:29] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 32 ms.
[2024-06-01 07:01:30] [INFO ] Added : 197 causal constraints over 40 iterations in 1038 ms. Result :sat
Minimization took 298 ms.
[2024-06-01 07:01:31] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2024-06-01 07:01:31] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 7 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1724 ms
[2024-06-01 07:01:33] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 27 ms.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:01:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 364 ms
[2024-06-01 07:01:34] [INFO ] Added : 185 causal constraints over 38 iterations in 1345 ms. Result :sat
Minimization took 358 ms.
[2024-06-01 07:01:35] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2024-06-01 07:01:35] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 10 ms returned sat
[2024-06-01 07:01:35] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:01:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:01:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2024-06-01 07:01:35] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned sat
[2024-06-01 07:01:35] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-01 07:01:35] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:01:36] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:01:37] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 3 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:01:38] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:01:39] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:01:40] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:01:40] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA BusinessProcesses-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 212 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 4 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 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 378 transition count 272
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 299 transition count 272
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 160 place count 299 transition count 214
Deduced a syphon composed of 58 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 284 place count 233 transition count 214
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 329 place count 188 transition count 169
Iterating global reduction 2 with 45 rules applied. Total rules applied 374 place count 188 transition count 169
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 374 place count 188 transition count 163
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 387 place count 181 transition count 163
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 503 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 505 place count 121 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 507 place count 121 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 509 place count 119 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 510 place count 119 transition count 107
Applied a total of 510 rules in 150 ms. Remains 119 /386 variables (removed 267) and now considering 107/360 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 119/386 places, 107/360 transitions.
// Phase 1: matrix 107 rows 119 cols
[2024-06-01 07:01:41] [INFO ] Computed 50 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (68092 resets) in 2043 ms. (489 steps per ms)
FORMULA BusinessProcesses-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (26517 resets) in 1030 ms. (969 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 21634 ms.
ITS solved all properties within timeout

BK_STOP 1717225304212

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-07, 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 r472-tajo-171620399600501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;