Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246400245.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is EisenbergMcGuire-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K Mar 31 16:48 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 EisenbergMcGuire-PT-06-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680841849695

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 04:30:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 04:30:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:30:52] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-04-07 04:30:52] [INFO ] Transformed 414 places.
[2023-04-07 04:30:52] [INFO ] Transformed 1296 transitions.
[2023-04-07 04:30:52] [INFO ] Found NUPN structural information;
[2023-04-07 04:30:52] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 702 out of 1296 initially.
// Phase 1: matrix 702 rows 414 cols
[2023-04-07 04:30:52] [INFO ] Computed 19 invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :12
FORMULA EisenbergMcGuire-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
[2023-04-07 04:30:52] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2023-04-07 04:30:52] [INFO ] Computed 19 invariants in 9 ms
[2023-04-07 04:30:52] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-04-07 04:30:52] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:30:53] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-04-07 04:30:53] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:30:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-04-07 04:30:53] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2023-04-07 04:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:30:54] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-04-07 04:30:54] [INFO ] State equation strengthened by 314 read => feed constraints.
[2023-04-07 04:30:54] [INFO ] [Nat]Added 314 Read/Feed constraints in 117 ms returned sat
[2023-04-07 04:30:54] [INFO ] Deduced a trap composed of 35 places in 502 ms of which 4 ms to minimize.
[2023-04-07 04:30:55] [INFO ] Deduced a trap composed of 60 places in 441 ms of which 1 ms to minimize.
[2023-04-07 04:30:55] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 1 ms to minimize.
[2023-04-07 04:30:55] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 1 ms to minimize.
[2023-04-07 04:30:56] [INFO ] Deduced a trap composed of 3 places in 460 ms of which 1 ms to minimize.
[2023-04-07 04:30:56] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 1 ms to minimize.
[2023-04-07 04:30:56] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2023-04-07 04:30:57] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 6 ms to minimize.
[2023-04-07 04:30:57] [INFO ] Deduced a trap composed of 3 places in 508 ms of which 0 ms to minimize.
[2023-04-07 04:30:57] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2023-04-07 04:30:57] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2023-04-07 04:30:58] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-07 04:30:58] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2023-04-07 04:30:58] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2023-04-07 04:30:58] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-07 04:30:58] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 4251 ms
[2023-04-07 04:30:58] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 04:30:58] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:30:58] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-04-07 04:30:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:30:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 04:30:58] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:30:58] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-04-07 04:30:58] [INFO ] [Nat]Added 314 Read/Feed constraints in 32 ms returned sat
[2023-04-07 04:30:59] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 10 ms to minimize.
[2023-04-07 04:30:59] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 1 ms to minimize.
[2023-04-07 04:30:59] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 1 ms to minimize.
[2023-04-07 04:30:59] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2023-04-07 04:30:59] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2023-04-07 04:31:00] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-04-07 04:31:00] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2023-04-07 04:31:00] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-07 04:31:00] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 0 ms to minimize.
[2023-04-07 04:31:00] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-07 04:31:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1511 ms
[2023-04-07 04:31:00] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 54 ms.
[2023-04-07 04:31:03] [INFO ] Added : 250 causal constraints over 50 iterations in 2544 ms. Result :sat
Minimization took 153 ms.
[2023-04-07 04:31:03] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 04:31:03] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:03] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-04-07 04:31:03] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:31:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 04:31:03] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:03] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-04-07 04:31:03] [INFO ] [Nat]Added 314 Read/Feed constraints in 32 ms returned sat
[2023-04-07 04:31:03] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 1 ms to minimize.
[2023-04-07 04:31:04] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-07 04:31:04] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2023-04-07 04:31:04] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 0 ms to minimize.
[2023-04-07 04:31:04] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-04-07 04:31:04] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 0 ms to minimize.
[2023-04-07 04:31:04] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-04-07 04:31:05] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-04-07 04:31:05] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2023-04-07 04:31:05] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 7 ms to minimize.
[2023-04-07 04:31:05] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2023-04-07 04:31:05] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-07 04:31:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1795 ms
[2023-04-07 04:31:05] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 55 ms.
[2023-04-07 04:31:08] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 0 ms to minimize.
[2023-04-07 04:31:08] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 0 ms to minimize.
[2023-04-07 04:31:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-04-07 04:31:08] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 0 ms to minimize.
[2023-04-07 04:31:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 04:31:08] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 04:31:08] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:09] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-04-07 04:31:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:31:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 42 ms returned sat
[2023-04-07 04:31:09] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-07 04:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:09] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-04-07 04:31:09] [INFO ] [Nat]Added 314 Read/Feed constraints in 35 ms returned sat
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 0 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:31:10] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-07 04:31:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 658 ms
[2023-04-07 04:31:10] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 43 ms.
[2023-04-07 04:31:11] [INFO ] Added : 179 causal constraints over 36 iterations in 1611 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 414 places. Attempting structural reductions.
Drop transitions removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1293/1293 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 412 transition count 1285
Reduce places removed 7 places and 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 405 transition count 1282
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 403 transition count 1280
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 402 transition count 1277
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 20 place count 400 transition count 1275
Reduce places removed 1 places and 3 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 21 place count 399 transition count 1272
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 23 place count 397 transition count 1270
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 24 place count 396 transition count 1269
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 25 place count 395 transition count 1268
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 109 Pre rules applied. Total rules applied 25 place count 395 transition count 1159
Deduced a syphon composed of 109 places in 2 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 9 with 218 rules applied. Total rules applied 243 place count 286 transition count 1159
Discarding 30 places :
Symmetric choice reduction at 9 with 30 rule applications. Total rules 273 place count 256 transition count 979
Iterating global reduction 9 with 30 rules applied. Total rules applied 303 place count 256 transition count 979
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 363 place count 226 transition count 949
Applied a total of 363 rules in 307 ms. Remains 226 /414 variables (removed 188) and now considering 949/1293 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 226/414 places, 949/1293 transitions.
Normalized transition count is 359 out of 949 initially.
// Phase 1: matrix 359 rows 226 cols
[2023-04-07 04:31:12] [INFO ] Computed 19 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1590 ms. (steps per millisecond=628 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=2123 ) properties (out of 1) seen :0
[2023-04-07 04:31:14] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
// Phase 1: matrix 359 rows 226 cols
[2023-04-07 04:31:14] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:31:14] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:31:14] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 1 ms returned sat
[2023-04-07 04:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:14] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-04-07 04:31:14] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:31:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:31:14] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:15] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-04-07 04:31:15] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-07 04:31:15] [INFO ] [Nat]Added 158 Read/Feed constraints in 29 ms returned sat
[2023-04-07 04:31:15] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-07 04:31:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-07 04:31:15] [INFO ] Computed and/alt/rep : 307/738/221 causal constraints (skipped 132 transitions) in 29 ms.
[2023-04-07 04:31:15] [INFO ] Added : 62 causal constraints over 13 iterations in 486 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 28 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 226/226 places, 949/949 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 27 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
[2023-04-07 04:31:15] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-07 04:31:15] [INFO ] Invariant cache hit.
[2023-04-07 04:31:16] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-04-07 04:31:16] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-07 04:31:16] [INFO ] Invariant cache hit.
[2023-04-07 04:31:16] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-07 04:31:16] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2023-04-07 04:31:16] [INFO ] Redundant transitions in 50 ms returned []
[2023-04-07 04:31:16] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-07 04:31:16] [INFO ] Invariant cache hit.
[2023-04-07 04:31:17] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1493 ms. Remains : 226/226 places, 949/949 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-07
Normalized transition count is 359 out of 949 initially.
// Phase 1: matrix 359 rows 226 cols
[2023-04-07 04:31:17] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-04-07 04:31:17] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
// Phase 1: matrix 359 rows 226 cols
[2023-04-07 04:31:17] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:31:17] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:31:17] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:17] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-04-07 04:31:17] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:31:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:31:17] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:17] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-04-07 04:31:17] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-07 04:31:17] [INFO ] [Nat]Added 158 Read/Feed constraints in 16 ms returned sat
[2023-04-07 04:31:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-04-07 04:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-07 04:31:17] [INFO ] Computed and/alt/rep : 307/738/221 causal constraints (skipped 132 transitions) in 28 ms.
[2023-04-07 04:31:18] [INFO ] Added : 62 causal constraints over 13 iterations in 355 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 47 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 226/226 places, 949/949 transitions.
Normalized transition count is 359 out of 949 initially.
// Phase 1: matrix 359 rows 226 cols
[2023-04-07 04:31:18] [INFO ] Computed 19 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1589 ms. (steps per millisecond=629 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 1) seen :0
[2023-04-07 04:31:20] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
// Phase 1: matrix 359 rows 226 cols
[2023-04-07 04:31:20] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:31:20] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:31:20] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:20] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-04-07 04:31:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:31:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:31:20] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:31:20] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-04-07 04:31:20] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-07 04:31:20] [INFO ] [Nat]Added 158 Read/Feed constraints in 16 ms returned sat
[2023-04-07 04:31:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-07 04:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-04-07 04:31:20] [INFO ] Computed and/alt/rep : 307/738/221 causal constraints (skipped 132 transitions) in 34 ms.
[2023-04-07 04:31:21] [INFO ] Added : 62 causal constraints over 13 iterations in 300 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 27 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 226/226 places, 949/949 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 949/949 transitions.
Applied a total of 0 rules in 35 ms. Remains 226 /226 variables (removed 0) and now considering 949/949 (removed 0) transitions.
[2023-04-07 04:31:21] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-07 04:31:21] [INFO ] Invariant cache hit.
[2023-04-07 04:31:21] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-04-07 04:31:21] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-07 04:31:21] [INFO ] Invariant cache hit.
[2023-04-07 04:31:21] [INFO ] State equation strengthened by 158 read => feed constraints.
[2023-04-07 04:31:22] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2023-04-07 04:31:22] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-07 04:31:22] [INFO ] Flow matrix only has 359 transitions (discarded 590 similar events)
[2023-04-07 04:31:22] [INFO ] Invariant cache hit.
[2023-04-07 04:31:22] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1334 ms. Remains : 226/226 places, 949/949 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-07 in 5213 ms.
[2023-04-07 04:31:22] [INFO ] Flatten gal took : 222 ms
[2023-04-07 04:31:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-04-07 04:31:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 226 places, 949 transitions and 4886 arcs took 14 ms.
Total runtime 31210 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/670/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15137660 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102076 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ sed s/.jar//
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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="EisenbergMcGuire-PT-06"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-06, 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 r521-tall-167987246400245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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