About the Execution of 2021-gold for BugTracking-PT-q8m032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16244.504 | 3600000.00 | 3401568.00 | 176637.80 | 0 1 0 0 0 0 0 0 ? 0 1 0 ? 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292600037.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BugTracking-PT-q8m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 7 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 17:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Jun 7 17:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q8m032-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654741181061
Running Version 0
[2022-06-09 02:19:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 02:19:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 02:19:43] [INFO ] Load time of PNML (sax parser for PT used): 718 ms
[2022-06-09 02:19:43] [INFO ] Transformed 754 places.
[2022-06-09 02:19:43] [INFO ] Transformed 27370 transitions.
[2022-06-09 02:19:43] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 859 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 474 places in 139 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 02:19:43] [INFO ] Computed 10 place invariants in 51 ms
Incomplete random walk after 10000 steps, including 24 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :1
FORMULA BugTracking-PT-q8m032-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
FORMULA BugTracking-PT-q8m032-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-06-09 02:19:44] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 02:19:44] [INFO ] Computed 10 place invariants in 19 ms
[2022-06-09 02:19:44] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-06-09 02:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:19:44] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2022-06-09 02:19:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:19:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:19:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:19:45] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2022-06-09 02:19:45] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 02:19:45] [INFO ] [Nat]Added 316 Read/Feed constraints in 195 ms returned sat
[2022-06-09 02:19:46] [INFO ] Deduced a trap composed of 132 places in 577 ms of which 3 ms to minimize.
[2022-06-09 02:19:47] [INFO ] Deduced a trap composed of 56 places in 470 ms of which 1 ms to minimize.
[2022-06-09 02:19:47] [INFO ] Deduced a trap composed of 131 places in 463 ms of which 1 ms to minimize.
[2022-06-09 02:19:48] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 2 ms to minimize.
[2022-06-09 02:19:48] [INFO ] Deduced a trap composed of 127 places in 498 ms of which 1 ms to minimize.
[2022-06-09 02:19:49] [INFO ] Deduced a trap composed of 139 places in 459 ms of which 0 ms to minimize.
[2022-06-09 02:19:49] [INFO ] Deduced a trap composed of 110 places in 429 ms of which 0 ms to minimize.
[2022-06-09 02:19:50] [INFO ] Deduced a trap composed of 141 places in 474 ms of which 1 ms to minimize.
[2022-06-09 02:19:50] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 02:19:50] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 02:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:19:50] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2022-06-09 02:19:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:19:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 02:19:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:19:51] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-06-09 02:19:51] [INFO ] [Nat]Added 316 Read/Feed constraints in 197 ms returned sat
[2022-06-09 02:19:52] [INFO ] Deduced a trap composed of 12 places in 431 ms of which 0 ms to minimize.
[2022-06-09 02:19:52] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 0 ms to minimize.
[2022-06-09 02:19:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 905 ms
[2022-06-09 02:19:53] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 308 ms.
[2022-06-09 02:19:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, 1] Max seen :[0, 0]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 365 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:19:56] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 1777 ms. (steps per millisecond=562 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2111 ms. (steps per millisecond=473 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1935 ms. (steps per millisecond=516 ) properties (out of 2) seen :0
[2022-06-09 02:20:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:20:02] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:20:02] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:02] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2022-06-09 02:20:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:03] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2022-06-09 02:20:03] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:20:03] [INFO ] [Nat]Added 296 Read/Feed constraints in 223 ms returned sat
[2022-06-09 02:20:04] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2022-06-09 02:20:04] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2022-06-09 02:20:04] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2022-06-09 02:20:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 944 ms
[2022-06-09 02:20:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 546 ms.
[2022-06-09 02:20:09] [INFO ] Deduced a trap composed of 23 places in 409 ms of which 0 ms to minimize.
[2022-06-09 02:20:10] [INFO ] Deduced a trap composed of 35 places in 351 ms of which 0 ms to minimize.
[2022-06-09 02:20:10] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 1 ms to minimize.
[2022-06-09 02:20:11] [INFO ] Deduced a trap composed of 63 places in 368 ms of which 0 ms to minimize.
[2022-06-09 02:20:11] [INFO ] Deduced a trap composed of 90 places in 401 ms of which 1 ms to minimize.
[2022-06-09 02:20:12] [INFO ] Deduced a trap composed of 57 places in 235 ms of which 1 ms to minimize.
[2022-06-09 02:20:12] [INFO ] Deduced a trap composed of 59 places in 255 ms of which 0 ms to minimize.
[2022-06-09 02:20:13] [INFO ] Deduced a trap composed of 55 places in 255 ms of which 0 ms to minimize.
[2022-06-09 02:20:13] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:20:14] [INFO ] Deduced a trap composed of 93 places in 385 ms of which 1 ms to minimize.
[2022-06-09 02:20:14] [INFO ] Deduced a trap composed of 57 places in 245 ms of which 0 ms to minimize.
[2022-06-09 02:20:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5164 ms
[2022-06-09 02:20:14] [INFO ] Added : 140 causal constraints over 28 iterations in 10128 ms. Result :sat
[2022-06-09 02:20:14] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:15] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2022-06-09 02:20:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:20:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:16] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2022-06-09 02:20:16] [INFO ] [Nat]Added 296 Read/Feed constraints in 215 ms returned sat
[2022-06-09 02:20:16] [INFO ] Deduced a trap composed of 41 places in 432 ms of which 1 ms to minimize.
[2022-06-09 02:20:17] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 1 ms to minimize.
[2022-06-09 02:20:17] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 0 ms to minimize.
[2022-06-09 02:20:17] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 0 ms to minimize.
[2022-06-09 02:20:18] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 0 ms to minimize.
[2022-06-09 02:20:18] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:20:18] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 0 ms to minimize.
[2022-06-09 02:20:19] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2022-06-09 02:20:19] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 0 ms to minimize.
[2022-06-09 02:20:19] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 1 ms to minimize.
[2022-06-09 02:20:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3685 ms
[2022-06-09 02:20:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 238 ms.
[2022-06-09 02:20:24] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 12 ms to minimize.
[2022-06-09 02:20:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2022-06-09 02:20:24] [INFO ] Added : 109 causal constraints over 22 iterations in 4310 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 1486700 steps, including 1000 resets, run finished after 13327 ms. (steps per millisecond=111 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1252800 steps, including 1000 resets, run finished after 10823 ms. (steps per millisecond=115 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 88 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:20:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:20:48] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-09 02:20:49] [INFO ] Implicit Places using invariants in 451 ms returned []
[2022-06-09 02:20:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:20:49] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:20:49] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:20:56] [INFO ] Implicit Places using invariants and state equation in 7068 ms returned []
Implicit Place search using SMT with State Equation took 7525 ms to find 0 implicit places.
[2022-06-09 02:20:56] [INFO ] Redundant transitions in 346 ms returned []
[2022-06-09 02:20:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:20:56] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 02:20:57] [INFO ] Dead Transitions using invariants and state equation in 1161 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:20:57] [INFO ] Computed 8 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 02:20:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:20:57] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 02:20:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:58] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2022-06-09 02:20:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:20:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:20:59] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2022-06-09 02:20:59] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:20:59] [INFO ] [Nat]Added 296 Read/Feed constraints in 208 ms returned sat
[2022-06-09 02:20:59] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 0 ms to minimize.
[2022-06-09 02:20:59] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2022-06-09 02:21:00] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2022-06-09 02:21:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 890 ms
[2022-06-09 02:21:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 209 ms.
[2022-06-09 02:21:04] [INFO ] Deduced a trap composed of 7 places in 520 ms of which 0 ms to minimize.
[2022-06-09 02:21:04] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:04] [INFO ] Computed 8 place invariants in 24 ms
Incomplete random walk after 1000015 steps, including 2 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1984 ms. (steps per millisecond=504 ) properties (out of 1) seen :0
[2022-06-09 02:21:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:07] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 02:21:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:21:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:08] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2022-06-09 02:21:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:21:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:21:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:08] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-09 02:21:08] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:21:09] [INFO ] [Nat]Added 296 Read/Feed constraints in 218 ms returned sat
[2022-06-09 02:21:09] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 0 ms to minimize.
[2022-06-09 02:21:09] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 0 ms to minimize.
[2022-06-09 02:21:09] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2022-06-09 02:21:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 890 ms
[2022-06-09 02:21:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 231 ms.
[2022-06-09 02:21:14] [INFO ] Deduced a trap composed of 23 places in 447 ms of which 0 ms to minimize.
[2022-06-09 02:21:15] [INFO ] Deduced a trap composed of 35 places in 328 ms of which 1 ms to minimize.
[2022-06-09 02:21:15] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 1 ms to minimize.
[2022-06-09 02:21:16] [INFO ] Deduced a trap composed of 63 places in 345 ms of which 1 ms to minimize.
[2022-06-09 02:21:16] [INFO ] Deduced a trap composed of 90 places in 334 ms of which 0 ms to minimize.
[2022-06-09 02:21:17] [INFO ] Deduced a trap composed of 57 places in 243 ms of which 1 ms to minimize.
[2022-06-09 02:21:17] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 0 ms to minimize.
[2022-06-09 02:21:18] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 0 ms to minimize.
[2022-06-09 02:21:18] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 1 ms to minimize.
[2022-06-09 02:21:18] [INFO ] Deduced a trap composed of 93 places in 323 ms of which 1 ms to minimize.
[2022-06-09 02:21:19] [INFO ] Deduced a trap composed of 57 places in 248 ms of which 0 ms to minimize.
[2022-06-09 02:21:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4929 ms
[2022-06-09 02:21:19] [INFO ] Added : 140 causal constraints over 28 iterations in 9572 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1252800 steps, including 1000 resets, run finished after 10962 ms. (steps per millisecond=114 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:21:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:30] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 02:21:31] [INFO ] Implicit Places using invariants in 427 ms returned []
[2022-06-09 02:21:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:31] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 02:21:31] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:21:38] [INFO ] Implicit Places using invariants and state equation in 6852 ms returned []
Implicit Place search using SMT with State Equation took 7285 ms to find 0 implicit places.
[2022-06-09 02:21:38] [INFO ] Redundant transitions in 272 ms returned []
[2022-06-09 02:21:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:38] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:21:39] [INFO ] Dead Transitions using invariants and state equation in 1059 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-08 in 41525 ms.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:39] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2022-06-09 02:21:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:39] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 02:21:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 02:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:40] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2022-06-09 02:21:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:21:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:40] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2022-06-09 02:21:40] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:21:40] [INFO ] [Nat]Added 296 Read/Feed constraints in 200 ms returned sat
[2022-06-09 02:21:41] [INFO ] Deduced a trap composed of 41 places in 431 ms of which 0 ms to minimize.
[2022-06-09 02:21:41] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 0 ms to minimize.
[2022-06-09 02:21:42] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 0 ms to minimize.
[2022-06-09 02:21:42] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 0 ms to minimize.
[2022-06-09 02:21:42] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 2 ms to minimize.
[2022-06-09 02:21:43] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 0 ms to minimize.
[2022-06-09 02:21:43] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 0 ms to minimize.
[2022-06-09 02:21:43] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 0 ms to minimize.
[2022-06-09 02:21:44] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 0 ms to minimize.
[2022-06-09 02:21:44] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 0 ms to minimize.
[2022-06-09 02:21:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3634 ms
[2022-06-09 02:21:44] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 258 ms.
[2022-06-09 02:21:45] [INFO ] Deduced a trap composed of 7 places in 522 ms of which 0 ms to minimize.
[2022-06-09 02:21:45] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:45] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 1507 ms. (steps per millisecond=663 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 1) seen :0
[2022-06-09 02:21:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:21:49] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:21:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:49] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2022-06-09 02:21:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 02:21:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 02:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 02:21:50] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-06-09 02:21:50] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:21:50] [INFO ] [Nat]Added 296 Read/Feed constraints in 205 ms returned sat
[2022-06-09 02:21:50] [INFO ] Deduced a trap composed of 41 places in 414 ms of which 0 ms to minimize.
[2022-06-09 02:21:51] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 6 ms to minimize.
[2022-06-09 02:21:51] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 0 ms to minimize.
[2022-06-09 02:21:51] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 1 ms to minimize.
[2022-06-09 02:21:52] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 2 ms to minimize.
[2022-06-09 02:21:52] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 0 ms to minimize.
[2022-06-09 02:21:52] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 1 ms to minimize.
[2022-06-09 02:21:53] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 0 ms to minimize.
[2022-06-09 02:21:53] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 0 ms to minimize.
[2022-06-09 02:21:53] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 0 ms to minimize.
[2022-06-09 02:21:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3489 ms
[2022-06-09 02:21:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 232 ms.
[2022-06-09 02:21:57] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2022-06-09 02:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2022-06-09 02:21:58] [INFO ] Added : 109 causal constraints over 22 iterations in 4041 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1486700 steps, including 1000 resets, run finished after 12856 ms. (steps per millisecond=115 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 02:22:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:22:11] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 02:22:11] [INFO ] Implicit Places using invariants in 396 ms returned []
[2022-06-09 02:22:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:22:11] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 02:22:12] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 02:22:18] [INFO ] Implicit Places using invariants and state equation in 7348 ms returned []
Implicit Place search using SMT with State Equation took 7748 ms to find 0 implicit places.
[2022-06-09 02:22:18] [INFO ] Redundant transitions in 136 ms returned []
[2022-06-09 02:22:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 02:22:18] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 02:22:20] [INFO ] Dead Transitions using invariants and state equation in 1161 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-12 in 40726 ms.
[2022-06-09 02:22:20] [INFO ] Flatten gal took : 470 ms
[2022-06-09 02:22:21] [INFO ] Applying decomposition
[2022-06-09 02:22:21] [INFO ] Flatten gal took : 248 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2214976696591253914.txt, -o, /tmp/graph2214976696591253914.bin, -w, /tmp/graph2214976696591253914.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2214976696591253914.bin, -l, -1, -v, -w, /tmp/graph2214976696591253914.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 02:22:21] [INFO ] Decomposing Gal with order
[2022-06-09 02:22:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 02:22:22] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 02:22:22] [INFO ] Flatten gal took : 543 ms
[2022-06-09 02:22:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 39 ms.
[2022-06-09 02:22:22] [INFO ] Time to serialize gal into /tmp/UpperBounds16989521882185331381.gal : 46 ms
[2022-06-09 02:22:22] [INFO ] Time to serialize properties into /tmp/UpperBounds17186917084148613367.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16989521882185331381.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17186917084148613367.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16989521882185331381.gal -t CGAL -reachable-file /tmp/UpperBounds17186917084148613367.prop --nowitness
Loading property file /tmp/UpperBounds17186917084148613367.prop.
Detected timeout of ITS tools.
[2022-06-09 02:43:18] [INFO ] Flatten gal took : 979 ms
[2022-06-09 02:43:19] [INFO ] Time to serialize gal into /tmp/UpperBounds13845310689239323227.gal : 83 ms
[2022-06-09 02:43:19] [INFO ] Time to serialize properties into /tmp/UpperBounds16557455781715599018.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds13845310689239323227.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16557455781715599018.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds13845310689239323227.gal -t CGAL -reachable-file /tmp/UpperBounds16557455781715599018.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds16557455781715599018.prop.
Detected timeout of ITS tools.
[2022-06-09 03:04:14] [INFO ] Flatten gal took : 2905 ms
[2022-06-09 03:04:16] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 03:04:16] [INFO ] Transformed 269 places.
[2022-06-09 03:04:16] [INFO ] Transformed 3871 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 03:04:16] [INFO ] Time to serialize gal into /tmp/UpperBounds18018468475616636445.gal : 13 ms
[2022-06-09 03:04:16] [INFO ] Time to serialize properties into /tmp/UpperBounds5888066382389780830.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds18018468475616636445.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5888066382389780830.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds18018468475616636445.gal -t CGAL -reachable-file /tmp/UpperBounds5888066382389780830.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5888066382389780830.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="BugTracking-PT-q8m032"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is BugTracking-PT-q8m032, 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 r323-tall-165472292600037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m032.tgz
mv BugTracking-PT-q8m032 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 ;