About the Execution of 2023-gold for PolyORBLF-PT-S06J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16216.140 | 3600000.00 | 3576538.00 | 106503.20 | 1 1 1 4 10 1 1 1 ? 1 1 2 1 1 4 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460700216.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBLF-PT-S06J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460700216
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 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 PolyORBLF-PT-S06J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717124757840
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 03:05:59] [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-05-31 03:05:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:05:59] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2024-05-31 03:05:59] [INFO ] Transformed 700 places.
[2024-05-31 03:06:00] [INFO ] Transformed 10740 transitions.
[2024-05-31 03:06:00] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 575 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Normalized transition count is 2634 out of 2670 initially.
// Phase 1: matrix 2634 rows 700 cols
[2024-05-31 03:06:00] [INFO ] Computed 58 invariants in 190 ms
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 53 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 15) seen :30
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :18
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :19
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :17
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :19
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :18
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :17
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :18
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :17
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :21
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :18
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :19
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :18
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :19
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :18
[2024-05-31 03:06:01] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2024-05-31 03:06:01] [INFO ] Computed 58 invariants in 132 ms
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 20 ms returned unsat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 25 ms returned unsat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 19 ms returned unsat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 20 ms returned unsat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2024-05-31 03:06:01] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 16 ms returned unsat
[2024-05-31 03:06:02] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2024-05-31 03:06:02] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 13 ms returned unsat
[2024-05-31 03:06:02] [INFO ] [Real]Absence check using 22 positive place invariants in 8 ms returned sat
[2024-05-31 03:06:02] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 17 ms returned unsat
[2024-05-31 03:06:02] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2024-05-31 03:06:02] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 40 ms returned sat
[2024-05-31 03:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:06:06] [INFO ] [Real]Absence check using state equation in 3888 ms returned sat
[2024-05-31 03:06:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:06:06] [INFO ] [Nat]Absence check using 22 positive place invariants in 9 ms returned sat
[2024-05-31 03:06:06] [INFO ] [Nat]Absence check using 22 positive and 36 generalized place invariants in 26 ms returned sat
[2024-05-31 03:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:06:11] [INFO ] [Nat]Absence check using state equation in 4901 ms returned unknown
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 19 ms returned unsat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 25 ms returned unsat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 19 ms returned unsat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 25 ms returned unsat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-05-31 03:06:11] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 24 ms returned unsat
[2024-05-31 03:06:12] [INFO ] [Real]Absence check using 22 positive place invariants in 10 ms returned sat
[2024-05-31 03:06:12] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 4, 1, 1, 1, -1, 1, 1, 2, 1, 4, 1] Max seen :[1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1]
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 694 transition count 2617
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 113 place count 641 transition count 2616
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 640 transition count 2616
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 114 place count 640 transition count 2533
Deduced a syphon composed of 83 places in 3 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 280 place count 557 transition count 2533
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 424 place count 485 transition count 2461
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 436 place count 485 transition count 2449
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 448 place count 473 transition count 2449
Applied a total of 448 rules in 589 ms. Remains 473 /700 variables (removed 227) and now considering 2449/2670 (removed 221) transitions.
[2024-05-31 03:06:12] [INFO ] Flow matrix only has 2413 transitions (discarded 36 similar events)
// Phase 1: matrix 2413 rows 473 cols
[2024-05-31 03:06:12] [INFO ] Computed 52 invariants in 50 ms
[2024-05-31 03:06:14] [INFO ] Dead Transitions using invariants and state equation in 1509 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/700 places, 1531/2670 transitions.
Applied a total of 0 rules in 31 ms. Remains 473 /473 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2135 ms. Remains : 473/700 places, 1531/2670 transitions.
Normalized transition count is 1495 out of 1531 initially.
// Phase 1: matrix 1495 rows 473 cols
[2024-05-31 03:06:14] [INFO ] Computed 52 invariants in 25 ms
Incomplete random walk after 1000000 steps, including 10799 resets, run finished after 6430 ms. (steps per millisecond=155 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3136 resets, run finished after 2206 ms. (steps per millisecond=453 ) properties (out of 1) seen :1
[2024-05-31 03:06:22] [INFO ] Flow matrix only has 1495 transitions (discarded 36 similar events)
// Phase 1: matrix 1495 rows 473 cols
[2024-05-31 03:06:22] [INFO ] Computed 52 invariants in 63 ms
[2024-05-31 03:06:23] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2024-05-31 03:06:23] [INFO ] [Real]Absence check using 22 positive and 30 generalized place invariants in 12 ms returned sat
[2024-05-31 03:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:06:26] [INFO ] [Real]Absence check using state equation in 3743 ms returned sat
[2024-05-31 03:06:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:06:26] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2024-05-31 03:06:26] [INFO ] [Nat]Absence check using 22 positive and 30 generalized place invariants in 14 ms returned sat
[2024-05-31 03:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:06:31] [INFO ] [Nat]Absence check using state equation in 4478 ms returned sat
[2024-05-31 03:06:31] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-31 03:06:33] [INFO ] [Nat]Added 168 Read/Feed constraints in 2113 ms returned sat
[2024-05-31 03:06:33] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 2 ms to minimize.
[2024-05-31 03:06:35] [INFO ] Deduced a trap composed of 56 places in 321 ms of which 1 ms to minimize.
[2024-05-31 03:06:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4359 ms
[2024-05-31 03:06:38] [INFO ] Computed and/alt/rep : 865/4927/860 causal constraints (skipped 629 transitions) in 144 ms.
[2024-05-31 03:06:51] [INFO ] Deduced a trap composed of 256 places in 429 ms of which 2 ms to minimize.
[2024-05-31 03:06:52] [INFO ] Deduced a trap composed of 256 places in 438 ms of which 2 ms to minimize.
[2024-05-31 03:06:53] [INFO ] Deduced a trap composed of 244 places in 446 ms of which 3 ms to minimize.
[2024-05-31 03:06:53] [INFO ] Deduced a trap composed of 267 places in 425 ms of which 0 ms to minimize.
[2024-05-31 03:06:54] [INFO ] Deduced a trap composed of 226 places in 364 ms of which 1 ms to minimize.
[2024-05-31 03:06:54] [INFO ] Deduced a trap composed of 226 places in 417 ms of which 0 ms to minimize.
[2024-05-31 03:06:55] [INFO ] Deduced a trap composed of 248 places in 410 ms of which 1 ms to minimize.
[2024-05-31 03:06:56] [INFO ] Deduced a trap composed of 218 places in 413 ms of which 1 ms to minimize.
[2024-05-31 03:06:56] [INFO ] Deduced a trap composed of 15 places in 378 ms of which 1 ms to minimize.
[2024-05-31 03:06:57] [INFO ] Deduced a trap composed of 229 places in 414 ms of which 0 ms to minimize.
[2024-05-31 03:06:57] [INFO ] Deduced a trap composed of 194 places in 418 ms of which 1 ms to minimize.
[2024-05-31 03:06:58] [INFO ] Deduced a trap composed of 231 places in 423 ms of which 0 ms to minimize.
[2024-05-31 03:06:59] [INFO ] Deduced a trap composed of 225 places in 414 ms of which 0 ms to minimize.
[2024-05-31 03:06:59] [INFO ] Deduced a trap composed of 207 places in 416 ms of which 0 ms to minimize.
[2024-05-31 03:07:00] [INFO ] Deduced a trap composed of 215 places in 391 ms of which 1 ms to minimize.
[2024-05-31 03:07:03] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 12094 ms
[2024-05-31 03:07:12] [INFO ] Deduced a trap composed of 2 places in 458 ms of which 1 ms to minimize.
[2024-05-31 03:07:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 1531/1531 transitions.
Applied a total of 0 rules in 66 ms. Remains 473 /473 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 473/473 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 1531/1531 transitions.
Applied a total of 0 rules in 48 ms. Remains 473 /473 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-31 03:07:12] [INFO ] Flow matrix only has 1495 transitions (discarded 36 similar events)
[2024-05-31 03:07:12] [INFO ] Invariant cache hit.
[2024-05-31 03:07:13] [INFO ] Implicit Places using invariants in 710 ms returned [45, 126, 316, 359, 456, 460]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 722 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 467/473 places, 1531/1531 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 465 transition count 1529
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 465 transition count 1529
Applied a total of 4 rules in 74 ms. Remains 465 /467 variables (removed 2) and now considering 1529/1531 (removed 2) transitions.
[2024-05-31 03:07:13] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
// Phase 1: matrix 1493 rows 465 cols
[2024-05-31 03:07:13] [INFO ] Computed 46 invariants in 32 ms
[2024-05-31 03:07:13] [INFO ] Implicit Places using invariants in 664 ms returned []
[2024-05-31 03:07:13] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
[2024-05-31 03:07:13] [INFO ] Invariant cache hit.
[2024-05-31 03:07:14] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-31 03:07:25] [INFO ] Implicit Places using invariants and state equation in 11896 ms returned []
Implicit Place search using SMT with State Equation took 12563 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 465/473 places, 1529/1531 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13407 ms. Remains : 465/473 places, 1529/1531 transitions.
Normalized transition count is 1493 out of 1529 initially.
// Phase 1: matrix 1493 rows 465 cols
[2024-05-31 03:07:25] [INFO ] Computed 46 invariants in 57 ms
Incomplete random walk after 1000000 steps, including 10579 resets, run finished after 6758 ms. (steps per millisecond=147 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3094 resets, run finished after 2267 ms. (steps per millisecond=441 ) properties (out of 1) seen :1
[2024-05-31 03:07:34] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
// Phase 1: matrix 1493 rows 465 cols
[2024-05-31 03:07:34] [INFO ] Computed 46 invariants in 70 ms
[2024-05-31 03:07:35] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-31 03:07:35] [INFO ] [Real]Absence check using 20 positive and 26 generalized place invariants in 25 ms returned sat
[2024-05-31 03:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:08:20] [INFO ] [Real]Absence check using state equation in 44892 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1529/1529 transitions.
Applied a total of 0 rules in 70 ms. Remains 465 /465 variables (removed 0) and now considering 1529/1529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 465/465 places, 1529/1529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1529/1529 transitions.
Applied a total of 0 rules in 49 ms. Remains 465 /465 variables (removed 0) and now considering 1529/1529 (removed 0) transitions.
[2024-05-31 03:08:20] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
[2024-05-31 03:08:20] [INFO ] Invariant cache hit.
[2024-05-31 03:08:20] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-31 03:08:20] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
[2024-05-31 03:08:20] [INFO ] Invariant cache hit.
[2024-05-31 03:08:21] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-31 03:08:36] [INFO ] Implicit Places using invariants and state equation in 15681 ms returned []
Implicit Place search using SMT with State Equation took 16227 ms to find 0 implicit places.
[2024-05-31 03:08:36] [INFO ] Redundant transitions in 115 ms returned []
[2024-05-31 03:08:36] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
[2024-05-31 03:08:36] [INFO ] Invariant cache hit.
[2024-05-31 03:08:37] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17414 ms. Remains : 465/465 places, 1529/1529 transitions.
Starting property specific reduction for PolyORBLF-PT-S06J06T06-UpperBounds-08
Normalized transition count is 1493 out of 1529 initially.
// Phase 1: matrix 1493 rows 465 cols
[2024-05-31 03:08:37] [INFO ] Computed 46 invariants in 30 ms
Incomplete random walk after 10000 steps, including 97 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :1
[2024-05-31 03:08:37] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
// Phase 1: matrix 1493 rows 465 cols
[2024-05-31 03:08:37] [INFO ] Computed 46 invariants in 57 ms
[2024-05-31 03:08:37] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-05-31 03:08:37] [INFO ] [Real]Absence check using 20 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-31 03:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:08:42] [INFO ] [Real]Absence check using state equation in 4924 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1529/1529 transitions.
Applied a total of 0 rules in 65 ms. Remains 465 /465 variables (removed 0) and now considering 1529/1529 (removed 0) transitions.
[2024-05-31 03:08:42] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
[2024-05-31 03:08:42] [INFO ] Invariant cache hit.
[2024-05-31 03:08:43] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1127 ms. Remains : 465/465 places, 1529/1529 transitions.
Normalized transition count is 1493 out of 1529 initially.
// Phase 1: matrix 1493 rows 465 cols
[2024-05-31 03:08:43] [INFO ] Computed 46 invariants in 27 ms
Incomplete random walk after 1000000 steps, including 10674 resets, run finished after 6408 ms. (steps per millisecond=156 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3132 resets, run finished after 2172 ms. (steps per millisecond=460 ) properties (out of 1) seen :1
[2024-05-31 03:08:52] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
// Phase 1: matrix 1493 rows 465 cols
[2024-05-31 03:08:52] [INFO ] Computed 46 invariants in 55 ms
[2024-05-31 03:08:52] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-31 03:08:52] [INFO ] [Real]Absence check using 20 positive and 26 generalized place invariants in 25 ms returned sat
[2024-05-31 03:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:09:37] [INFO ] [Real]Absence check using state equation in 44885 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1529/1529 transitions.
Applied a total of 0 rules in 58 ms. Remains 465 /465 variables (removed 0) and now considering 1529/1529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 465/465 places, 1529/1529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 1529/1529 transitions.
Applied a total of 0 rules in 44 ms. Remains 465 /465 variables (removed 0) and now considering 1529/1529 (removed 0) transitions.
[2024-05-31 03:09:37] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
[2024-05-31 03:09:37] [INFO ] Invariant cache hit.
[2024-05-31 03:09:38] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-31 03:09:38] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
[2024-05-31 03:09:38] [INFO ] Invariant cache hit.
[2024-05-31 03:09:38] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-31 03:09:51] [INFO ] Implicit Places using invariants and state equation in 13528 ms returned []
Implicit Place search using SMT with State Equation took 14132 ms to find 0 implicit places.
[2024-05-31 03:09:51] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-31 03:09:51] [INFO ] Flow matrix only has 1493 transitions (discarded 36 similar events)
[2024-05-31 03:09:51] [INFO ] Invariant cache hit.
[2024-05-31 03:09:52] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15122 ms. Remains : 465/465 places, 1529/1529 transitions.
Ending property specific reduction for PolyORBLF-PT-S06J06T06-UpperBounds-08 in 75219 ms.
[2024-05-31 03:09:53] [INFO ] Flatten gal took : 241 ms
[2024-05-31 03:09:53] [INFO ] Applying decomposition
[2024-05-31 03:09:53] [INFO ] Flatten gal took : 151 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2432624027232406570.txt' '-o' '/tmp/graph2432624027232406570.bin' '-w' '/tmp/graph2432624027232406570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2432624027232406570.bin' '-l' '-1' '-v' '-w' '/tmp/graph2432624027232406570.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:09:54] [INFO ] Decomposing Gal with order
[2024-05-31 03:09:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:09:54] [INFO ] Removed a total of 1266 redundant transitions.
[2024-05-31 03:09:54] [INFO ] Flatten gal took : 523 ms
[2024-05-31 03:09:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 504 labels/synchronizations in 66 ms.
[2024-05-31 03:09:54] [INFO ] Time to serialize gal into /tmp/UpperBounds17793178689008758065.gal : 44 ms
[2024-05-31 03:09:54] [INFO ] Time to serialize properties into /tmp/UpperBounds9775064322228288435.prop : 0 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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17793178689008758065.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9775064322228288435.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds9775064322228288435.prop.
Detected timeout of ITS tools.
[2024-05-31 03:31:16] [INFO ] Flatten gal took : 582 ms
[2024-05-31 03:31:16] [INFO ] Time to serialize gal into /tmp/UpperBounds5127023246575600046.gal : 124 ms
[2024-05-31 03:31:16] [INFO ] Time to serialize properties into /tmp/UpperBounds351664394432915114.prop : 4 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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5127023246575600046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds351664394432915114.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...303
Loading property file /tmp/UpperBounds351664394432915114.prop.
Detected timeout of ITS tools.
[2024-05-31 03:52:38] [INFO ] Flatten gal took : 1831 ms
[2024-05-31 03:52:39] [INFO ] Input system was already deterministic with 1529 transitions.
[2024-05-31 03:52:40] [INFO ] Transformed 465 places.
[2024-05-31 03:52:40] [INFO ] Transformed 1529 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 03:53:10] [INFO ] Time to serialize gal into /tmp/UpperBounds6564400556528910009.gal : 54 ms
[2024-05-31 03:53:10] [INFO ] Time to serialize properties into /tmp/UpperBounds705155325273507747.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6564400556528910009.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds705155325273507747.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...348
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds705155325273507747.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 1430180 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16210116 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="PolyORBLF-PT-S06J06T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is PolyORBLF-PT-S06J06T06, 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 r307-tajo-171654460700216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T06.tgz
mv PolyORBLF-PT-S06J06T06 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 ;