About the Execution of ITS-Tools for MedleyA-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 357.783 | 48833.00 | 69426.00 | 352.80 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100125.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100125
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 MedleyA-PT-16-UpperBounds-00
FORMULA_NAME MedleyA-PT-16-UpperBounds-01
FORMULA_NAME MedleyA-PT-16-UpperBounds-02
FORMULA_NAME MedleyA-PT-16-UpperBounds-03
FORMULA_NAME MedleyA-PT-16-UpperBounds-04
FORMULA_NAME MedleyA-PT-16-UpperBounds-05
FORMULA_NAME MedleyA-PT-16-UpperBounds-06
FORMULA_NAME MedleyA-PT-16-UpperBounds-07
FORMULA_NAME MedleyA-PT-16-UpperBounds-08
FORMULA_NAME MedleyA-PT-16-UpperBounds-09
FORMULA_NAME MedleyA-PT-16-UpperBounds-10
FORMULA_NAME MedleyA-PT-16-UpperBounds-11
FORMULA_NAME MedleyA-PT-16-UpperBounds-12
FORMULA_NAME MedleyA-PT-16-UpperBounds-13
FORMULA_NAME MedleyA-PT-16-UpperBounds-14
FORMULA_NAME MedleyA-PT-16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717371933121
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 23:45:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:45:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:45:35] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-06-02 23:45:35] [INFO ] Transformed 196 places.
[2024-06-02 23:45:35] [INFO ] Transformed 392 transitions.
[2024-06-02 23:45:35] [INFO ] Found NUPN structural information;
[2024-06-02 23:45:35] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 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 390 rows 196 cols
[2024-06-02 23:45:35] [INFO ] Computed 7 invariants in 46 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 (2 resets) in 52 ms. (188 steps per ms)
FORMULA MedleyA-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100005 steps (20 resets) in 239 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 23:45:35] [INFO ] Invariant cache hit.
[2024-06-02 23:45:36] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 23:45:36] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-06-02 23:45:36] [INFO ] Deduced a trap composed of 100 places in 217 ms of which 28 ms to minimize.
[2024-06-02 23:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:45:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 23:45:37] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-06-02 23:45:37] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:45:37] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-06-02 23:45:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2024-06-02 23:45:37] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 49 ms.
[2024-06-02 23:45:40] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 4 ms to minimize.
[2024-06-02 23:45:41] [INFO ] Deduced a trap composed of 30 places in 244 ms of which 4 ms to minimize.
[2024-06-02 23:45:41] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 3 ms to minimize.
[2024-06-02 23:45:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1090 ms
[2024-06-02 23:45:41] [INFO ] Added : 272 causal constraints over 55 iterations in 4231 ms. Result :sat
Minimization took 137 ms.
[2024-06-02 23:45:41] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 23:45:42] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-06-02 23:45:42] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 60 ms.
[2024-06-02 23:45:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:45:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 23:45:42] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-06-02 23:45:42] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 64 ms.
[2024-06-02 23:45:43] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 5 ms to minimize.
[2024-06-02 23:45:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2024-06-02 23:45:43] [INFO ] Added : 100 causal constraints over 20 iterations in 1167 ms. Result :sat
Minimization took 216 ms.
[2024-06-02 23:45:44] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 23:45:44] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-06-02 23:45:44] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 5 ms to minimize.
[2024-06-02 23:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:45:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 23:45:44] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-06-02 23:45:45] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 4 ms to minimize.
[2024-06-02 23:45:45] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 3 ms to minimize.
[2024-06-02 23:45:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2024-06-02 23:45:45] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 54 ms.
[2024-06-02 23:45:48] [INFO ] Added : 316 causal constraints over 64 iterations in 3635 ms. Result :sat
Minimization took 501 ms.
[2024-06-02 23:45:49] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 23:45:49] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2024-06-02 23:45:49] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:45:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:45:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 23:45:50] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-06-02 23:45:50] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:45:50] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 3 ms to minimize.
[2024-06-02 23:45:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2024-06-02 23:45:50] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 52 ms.
[2024-06-02 23:45:51] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:45:51] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:45:51] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:45:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 547 ms
[2024-06-02 23:45:52] [INFO ] Added : 102 causal constraints over 21 iterations in 1303 ms. Result :sat
Minimization took 148 ms.
[2024-06-02 23:45:52] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 23:45:52] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-06-02 23:45:52] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 37 ms.
[2024-06-02 23:45:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:45:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 23:45:52] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-06-02 23:45:52] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 33 ms.
[2024-06-02 23:45:53] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 4 ms to minimize.
[2024-06-02 23:45:53] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 4 ms to minimize.
[2024-06-02 23:45:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
[2024-06-02 23:45:54] [INFO ] Added : 99 causal constraints over 23 iterations in 1382 ms. Result :sat
Minimization took 228 ms.
[2024-06-02 23:45:54] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 23:45:54] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-06-02 23:45:54] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:45:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:45:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 23:45:54] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-06-02 23:45:55] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:45:55] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:45:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2024-06-02 23:45:55] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 29 ms.
[2024-06-02 23:45:58] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 3 ms to minimize.
[2024-06-02 23:45:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2024-06-02 23:45:58] [INFO ] Added : 289 causal constraints over 60 iterations in 3537 ms. Result :sat
Minimization took 502 ms.
[2024-06-02 23:45:59] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 23:45:59] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-06-02 23:45:59] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 4 ms to minimize.
[2024-06-02 23:45:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:45:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 23:46:00] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-06-02 23:46:00] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 3 ms to minimize.
[2024-06-02 23:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-06-02 23:46:00] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 47 ms.
[2024-06-02 23:46:01] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-06-02 23:46:01] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:46:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2024-06-02 23:46:01] [INFO ] Added : 106 causal constraints over 22 iterations in 1342 ms. Result :sat
Minimization took 229 ms.
[2024-06-02 23:46:02] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-02 23:46:02] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-06-02 23:46:02] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2024-06-02 23:46:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:46:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 23:46:02] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2024-06-02 23:46:03] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 3 ms to minimize.
[2024-06-02 23:46:03] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-06-02 23:46:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2024-06-02 23:46:03] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 45 ms.
[2024-06-02 23:46:07] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 3 ms to minimize.
[2024-06-02 23:46:07] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 7 ms to minimize.
[2024-06-02 23:46:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-02 23:46:07] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 23:46:07] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-06-02 23:46:08] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 3 ms to minimize.
[2024-06-02 23:46:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:46:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 23:46:08] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-06-02 23:46:08] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 3 ms to minimize.
[2024-06-02 23:46:08] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:46:09] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 5 ms to minimize.
[2024-06-02 23:46:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 608 ms
[2024-06-02 23:46:09] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 48 ms.
[2024-06-02 23:46:12] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:46:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-06-02 23:46:12] [INFO ] Added : 287 causal constraints over 58 iterations in 3269 ms. Result :sat
Minimization took 325 ms.
[2024-06-02 23:46:12] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 23:46:13] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-02 23:46:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:46:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-06-02 23:46:13] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-06-02 23:46:13] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:46:13] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:46:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2024-06-02 23:46:13] [INFO ] Computed and/alt/rep : 362/1423/362 causal constraints (skipped 27 transitions) in 45 ms.
[2024-06-02 23:46:17] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:46:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2024-06-02 23:46:17] [INFO ] Added : 312 causal constraints over 63 iterations in 3951 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 390/390 transitions.
Graph (trivial) has 211 edges and 196 vertex of which 9 / 196 are part of one of the 2 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 189 transition count 346
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 154 transition count 344
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 153 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 152 transition count 343
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 76 place count 152 transition count 339
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 84 place count 148 transition count 339
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 123 place count 109 transition count 275
Iterating global reduction 4 with 39 rules applied. Total rules applied 162 place count 109 transition count 275
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 17 rules applied. Total rules applied 179 place count 109 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 180 place count 108 transition count 258
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 180 place count 108 transition count 250
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 196 place count 100 transition count 250
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 197 place count 100 transition count 249
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 200 place count 97 transition count 240
Iterating global reduction 7 with 3 rules applied. Total rules applied 203 place count 97 transition count 240
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 233 place count 82 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 238 place count 82 transition count 220
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 240 place count 80 transition count 216
Iterating global reduction 8 with 2 rules applied. Total rules applied 242 place count 80 transition count 216
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 282 place count 60 transition count 346
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 295 place count 60 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 297 place count 59 transition count 350
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 9 with 56 rules applied. Total rules applied 353 place count 59 transition count 294
Free-agglomeration rule applied 11 times with reduction of 1 identical transitions.
Iterating global reduction 9 with 11 rules applied. Total rules applied 364 place count 59 transition count 282
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 386 place count 48 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 412 place count 48 transition count 245
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 413 place count 48 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 414 place count 47 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 415 place count 46 transition count 243
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 24 edges and 44 vertex of which 2 / 44 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 3 rules applied. Total rules applied 418 place count 43 transition count 243
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 428 place count 43 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 13 with 54 rules applied. Total rules applied 482 place count 43 transition count 179
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 484 place count 41 transition count 176
Iterating global reduction 13 with 2 rules applied. Total rules applied 486 place count 41 transition count 176
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 487 place count 40 transition count 172
Iterating global reduction 13 with 1 rules applied. Total rules applied 488 place count 40 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 492 place count 38 transition count 170
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 494 place count 38 transition count 170
Applied a total of 494 rules in 250 ms. Remains 38 /196 variables (removed 158) and now considering 170/390 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 38/196 places, 170/390 transitions.
[2024-06-02 23:46:18] [INFO ] Flow matrix only has 158 transitions (discarded 12 similar events)
// Phase 1: matrix 158 rows 38 cols
[2024-06-02 23:46:18] [INFO ] Computed 5 invariants in 3 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 (264 resets) in 1461 ms. (683 steps per ms)
FORMULA MedleyA-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (14 resets) in 1197 ms. (834 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 )
[2024-06-02 23:46:21] [INFO ] Flatten gal took : 105 ms
[2024-06-02 23:46:21] [INFO ] Flatten gal took : 40 ms
[2024-06-02 23:46:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18425040305462522708.gal : 22 ms
[2024-06-02 23:46:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4902367324245399703.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/ReachabilityCardinality18425040305462522708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4902367324245399703.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 47023 ms.
BK_STOP 1717371981954
--------------------
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="MedleyA-PT-16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MedleyA-PT-16, 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 r576-smll-171734920100125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 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 '
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 ;