About the Execution of LTSMin+red for BugTracking-PT-q3m008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 974.588 | 3600000.00 | 13848021.00 | 184.00 | 1 ? 0 ? ? 0 1 ? ? 0 1 0 0 1 0 0 | 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/mcc2023-input.r041-tajo-167813694600341.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q3m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600341
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K Feb 26 06:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 06:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 06:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 06:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 06:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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-q3m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678627543313
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m008
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:25:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 13:25:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:25:45] [INFO ] Load time of PNML (sax parser for PT used): 687 ms
[2023-03-12 13:25:46] [INFO ] Transformed 754 places.
[2023-03-12 13:25:46] [INFO ] Transformed 27370 transitions.
[2023-03-12 13:25:46] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 896 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 514 places in 116 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m008-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2023-03-12 13:25:46] [INFO ] Computed 10 place invariants in 51 ms
FORMULA BugTracking-PT-q3m008-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 57 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :3
FORMULA BugTracking-PT-q3m008-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m008-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m008-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
[2023-03-12 13:25:46] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-12 13:25:46] [INFO ] Computed 10 place invariants in 31 ms
[2023-03-12 13:25:47] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-12 13:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:47] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2023-03-12 13:25:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:25:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 13:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:48] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2023-03-12 13:25:48] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 13:25:49] [INFO ] [Nat]Added 255 Read/Feed constraints in 133 ms returned sat
[2023-03-12 13:25:50] [INFO ] Deduced a trap composed of 20 places in 1283 ms of which 4 ms to minimize.
[2023-03-12 13:25:50] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 2 ms to minimize.
[2023-03-12 13:25:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1859 ms
[2023-03-12 13:25:51] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 312 ms.
[2023-03-12 13:25:51] [INFO ] Added : 5 causal constraints over 1 iterations in 820 ms. Result :sat
Minimization took 289 ms.
[2023-03-12 13:25:52] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 13:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:52] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2023-03-12 13:25:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:25:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 13:25:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:53] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2023-03-12 13:25:53] [INFO ] [Nat]Added 255 Read/Feed constraints in 142 ms returned sat
[2023-03-12 13:25:54] [INFO ] Deduced a trap composed of 14 places in 475 ms of which 23 ms to minimize.
[2023-03-12 13:25:54] [INFO ] Deduced a trap composed of 20 places in 422 ms of which 0 ms to minimize.
[2023-03-12 13:25:54] [INFO ] Deduced a trap composed of 17 places in 299 ms of which 2 ms to minimize.
[2023-03-12 13:25:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1522 ms
[2023-03-12 13:25:55] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 283 ms.
[2023-03-12 13:25:55] [INFO ] Added : 5 causal constraints over 1 iterations in 646 ms. Result :sat
Minimization took 246 ms.
[2023-03-12 13:25:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 13:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:56] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2023-03-12 13:25:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:25:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 13:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:25:57] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2023-03-12 13:25:57] [INFO ] [Nat]Added 255 Read/Feed constraints in 49 ms returned sat
[2023-03-12 13:25:57] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 228 ms.
[2023-03-12 13:25:58] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 1 ms to minimize.
[2023-03-12 13:25:58] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2023-03-12 13:25:59] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2023-03-12 13:25:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1114 ms
[2023-03-12 13:25:59] [INFO ] Added : 9 causal constraints over 4 iterations in 2346 ms. Result :sat
Minimization took 259 ms.
[2023-03-12 13:26:00] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 13:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:00] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-12 13:26:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:26:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 13:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:01] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2023-03-12 13:26:01] [INFO ] [Nat]Added 255 Read/Feed constraints in 89 ms returned sat
[2023-03-12 13:26:01] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 1 ms to minimize.
[2023-03-12 13:26:02] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2023-03-12 13:26:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 816 ms
[2023-03-12 13:26:02] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 235 ms.
[2023-03-12 13:26:03] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-12 13:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-12 13:26:03] [INFO ] Added : 7 causal constraints over 2 iterations in 1258 ms. Result :sat
Minimization took 357 ms.
[2023-03-12 13:26:03] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 13:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:04] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-12 13:26:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:26:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 13:26:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:04] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2023-03-12 13:26:05] [INFO ] [Nat]Added 255 Read/Feed constraints in 103 ms returned sat
[2023-03-12 13:26:05] [INFO ] Deduced a trap composed of 53 places in 357 ms of which 1 ms to minimize.
[2023-03-12 13:26:05] [INFO ] Deduced a trap composed of 63 places in 369 ms of which 1 ms to minimize.
[2023-03-12 13:26:06] [INFO ] Deduced a trap composed of 60 places in 317 ms of which 0 ms to minimize.
[2023-03-12 13:26:06] [INFO ] Deduced a trap composed of 41 places in 347 ms of which 0 ms to minimize.
[2023-03-12 13:26:07] [INFO ] Deduced a trap composed of 22 places in 328 ms of which 1 ms to minimize.
[2023-03-12 13:26:07] [INFO ] Deduced a trap composed of 52 places in 340 ms of which 1 ms to minimize.
[2023-03-12 13:26:07] [INFO ] Deduced a trap composed of 55 places in 308 ms of which 0 ms to minimize.
[2023-03-12 13:26:08] [INFO ] Deduced a trap composed of 56 places in 346 ms of which 0 ms to minimize.
[2023-03-12 13:26:09] [INFO ] Deduced a trap composed of 53 places in 315 ms of which 0 ms to minimize.
[2023-03-12 13:26:09] [INFO ] Deduced a trap composed of 48 places in 339 ms of which 0 ms to minimize.
[2023-03-12 13:26:09] [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 4
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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, 1, -1, 1, -1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 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 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 309 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:26:10] [INFO ] Computed 8 place invariants in 24 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 5406 ms. (steps per millisecond=184 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2250 ms. (steps per millisecond=444 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2229 ms. (steps per millisecond=448 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2224 ms. (steps per millisecond=449 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2283 ms. (steps per millisecond=438 ) properties (out of 5) seen :0
[2023-03-12 13:26:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:26:26] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:26:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:27] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2023-03-12 13:26:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:26:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:27] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2023-03-12 13:26:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:26:27] [INFO ] [Nat]Added 241 Read/Feed constraints in 104 ms returned sat
[2023-03-12 13:26:28] [INFO ] Deduced a trap composed of 19 places in 480 ms of which 1 ms to minimize.
[2023-03-12 13:26:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 644 ms
[2023-03-12 13:26:28] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 237 ms.
[2023-03-12 13:26:29] [INFO ] Added : 3 causal constraints over 1 iterations in 546 ms. Result :sat
Minimization took 327 ms.
[2023-03-12 13:26:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:30] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-12 13:26:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:26:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:26:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:30] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2023-03-12 13:26:30] [INFO ] [Nat]Added 241 Read/Feed constraints in 89 ms returned sat
[2023-03-12 13:26:31] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2023-03-12 13:26:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 457 ms
[2023-03-12 13:26:31] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 255 ms.
[2023-03-12 13:26:31] [INFO ] Added : 3 causal constraints over 1 iterations in 536 ms. Result :sat
Minimization took 301 ms.
[2023-03-12 13:26:32] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-12 13:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:32] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2023-03-12 13:26:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:26:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:33] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-12 13:26:33] [INFO ] [Nat]Added 241 Read/Feed constraints in 44 ms returned sat
[2023-03-12 13:26:33] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 1 ms to minimize.
[2023-03-12 13:26:33] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 2 ms to minimize.
[2023-03-12 13:26:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 849 ms
[2023-03-12 13:26:34] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 257 ms.
[2023-03-12 13:26:35] [INFO ] Deduced a trap composed of 49 places in 540 ms of which 1 ms to minimize.
[2023-03-12 13:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 725 ms
[2023-03-12 13:26:35] [INFO ] Added : 7 causal constraints over 2 iterations in 1521 ms. Result :sat
Minimization took 283 ms.
[2023-03-12 13:26:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:36] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2023-03-12 13:26:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:26:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:37] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2023-03-12 13:26:37] [INFO ] [Nat]Added 241 Read/Feed constraints in 115 ms returned sat
[2023-03-12 13:26:37] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 226 ms.
[2023-03-12 13:26:37] [INFO ] Added : 4 causal constraints over 1 iterations in 571 ms. Result :sat
Minimization took 280 ms.
[2023-03-12 13:26:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:38] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-12 13:26:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:26:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:26:39] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2023-03-12 13:26:39] [INFO ] [Nat]Added 241 Read/Feed constraints in 62 ms returned sat
[2023-03-12 13:26:39] [INFO ] Deduced a trap composed of 22 places in 370 ms of which 1 ms to minimize.
[2023-03-12 13:26:40] [INFO ] Deduced a trap composed of 114 places in 442 ms of which 1 ms to minimize.
[2023-03-12 13:26:40] [INFO ] Deduced a trap composed of 47 places in 405 ms of which 0 ms to minimize.
[2023-03-12 13:26:41] [INFO ] Deduced a trap composed of 58 places in 437 ms of which 1 ms to minimize.
[2023-03-12 13:26:41] [INFO ] Deduced a trap composed of 67 places in 443 ms of which 1 ms to minimize.
[2023-03-12 13:26:42] [INFO ] Deduced a trap composed of 45 places in 462 ms of which 1 ms to minimize.
[2023-03-12 13:26:42] [INFO ] Deduced a trap composed of 109 places in 402 ms of which 1 ms to minimize.
[2023-03-12 13:26:43] [INFO ] Deduced a trap composed of 77 places in 422 ms of which 2 ms to minimize.
[2023-03-12 13:26:43] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 3 ms to minimize.
[2023-03-12 13:26:44] [INFO ] Deduced a trap composed of 46 places in 364 ms of which 1 ms to minimize.
[2023-03-12 13:26:45] [INFO ] Deduced a trap composed of 39 places in 457 ms of which 0 ms to minimize.
[2023-03-12 13:26:45] [INFO ] Deduced a trap composed of 39 places in 473 ms of which 1 ms to minimize.
[2023-03-12 13:26:46] [INFO ] Deduced a trap composed of 50 places in 463 ms of which 1 ms to minimize.
[2023-03-12 13:26:47] [INFO ] Deduced a trap composed of 50 places in 424 ms of which 0 ms to minimize.
[2023-03-12 13:26:47] [INFO ] Deduced a trap composed of 74 places in 393 ms of which 0 ms to minimize.
[2023-03-12 13:26:48] [INFO ] Deduced a trap composed of 63 places in 410 ms of which 0 ms to minimize.
[2023-03-12 13:26:49] [INFO ] Deduced a trap composed of 68 places in 414 ms of which 0 ms to minimize.
[2023-03-12 13:26:49] [INFO ] Deduced a trap composed of 88 places in 431 ms of which 0 ms to minimize.
[2023-03-12 13:26:50] [INFO ] Deduced a trap composed of 104 places in 451 ms of which 0 ms to minimize.
[2023-03-12 13:26:50] [INFO ] Deduced a trap composed of 50 places in 408 ms of which 0 ms to minimize.
[2023-03-12 13:26:51] [INFO ] Deduced a trap composed of 17 places in 450 ms of which 1 ms to minimize.
[2023-03-12 13:26:52] [INFO ] Deduced a trap composed of 16 places in 440 ms of which 0 ms to minimize.
[2023-03-12 13:26:52] [INFO ] Deduced a trap composed of 89 places in 410 ms of which 0 ms to minimize.
[2023-03-12 13:26:53] [INFO ] Deduced a trap composed of 70 places in 408 ms of which 1 ms to minimize.
[2023-03-12 13:26:54] [INFO ] Deduced a trap composed of 52 places in 412 ms of which 1 ms to minimize.
[2023-03-12 13:26:54] [INFO ] Deduced a trap composed of 52 places in 394 ms of which 0 ms to minimize.
[2023-03-12 13:26:55] [INFO ] Deduced a trap composed of 70 places in 412 ms of which 0 ms to minimize.
[2023-03-12 13:26:55] [INFO ] Deduced a trap composed of 108 places in 411 ms of which 0 ms to minimize.
[2023-03-12 13:26:56] [INFO ] Deduced a trap composed of 108 places in 397 ms of which 1 ms to minimize.
[2023-03-12 13:26:56] [INFO ] Deduced a trap composed of 107 places in 368 ms of which 0 ms to minimize.
[2023-03-12 13:26:57] [INFO ] Deduced a trap composed of 70 places in 402 ms of which 0 ms to minimize.
[2023-03-12 13:26:58] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 19259 ms
[2023-03-12 13:26:58] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 230 ms.
[2023-03-12 13:26:59] [INFO ] Added : 8 causal constraints over 2 iterations in 721 ms. Result :sat
Minimization took 647 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1, 1, -1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 91 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 66 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:27:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:00] [INFO ] Invariant cache hit.
[2023-03-12 13:27:01] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-12 13:27:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:01] [INFO ] Invariant cache hit.
[2023-03-12 13:27:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:03] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
[2023-03-12 13:27:03] [INFO ] Redundant transitions in 324 ms returned []
[2023-03-12 13:27:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:03] [INFO ] Invariant cache hit.
[2023-03-12 13:27:04] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3532 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-01
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:04] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) 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 1) seen :0
[2023-03-12 13:27:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:04] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:27:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:04] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2023-03-12 13:27:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:27:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:05] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2023-03-12 13:27:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:05] [INFO ] [Nat]Added 241 Read/Feed constraints in 79 ms returned sat
[2023-03-12 13:27:05] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 1 ms to minimize.
[2023-03-12 13:27:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2023-03-12 13:27:06] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 249 ms.
[2023-03-12 13:27:06] [INFO ] Added : 3 causal constraints over 1 iterations in 565 ms. Result :sat
Minimization took 347 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 60 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:07] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 4443 ms. (steps per millisecond=225 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2228 ms. (steps per millisecond=448 ) properties (out of 1) seen :0
[2023-03-12 13:27:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:13] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-12 13:27:14] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:14] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-12 13:27:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:27:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:14] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-12 13:27:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:15] [INFO ] [Nat]Added 241 Read/Feed constraints in 104 ms returned sat
[2023-03-12 13:27:15] [INFO ] Deduced a trap composed of 19 places in 290 ms of which 1 ms to minimize.
[2023-03-12 13:27:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
[2023-03-12 13:27:15] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 242 ms.
[2023-03-12 13:27:16] [INFO ] Added : 3 causal constraints over 1 iterations in 589 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:27:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:16] [INFO ] Invariant cache hit.
[2023-03-12 13:27:17] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-12 13:27:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:17] [INFO ] Invariant cache hit.
[2023-03-12 13:27:17] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:18] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2023-03-12 13:27:18] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-12 13:27:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:18] [INFO ] Invariant cache hit.
[2023-03-12 13:27:19] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3081 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-01 in 15351 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-03
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:19] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) 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
[2023-03-12 13:27:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:19] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:27:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:20] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2023-03-12 13:27:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:27:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:20] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-12 13:27:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:20] [INFO ] [Nat]Added 241 Read/Feed constraints in 81 ms returned sat
[2023-03-12 13:27:21] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 1 ms to minimize.
[2023-03-12 13:27:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2023-03-12 13:27:21] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 272 ms.
[2023-03-12 13:27:22] [INFO ] Added : 3 causal constraints over 1 iterations in 636 ms. Result :sat
Minimization took 349 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:22] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6447 ms. (steps per millisecond=155 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2157 ms. (steps per millisecond=463 ) properties (out of 1) seen :0
[2023-03-12 13:27:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:31] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:27:31] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:31] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-12 13:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:27:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:32] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2023-03-12 13:27:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:32] [INFO ] [Nat]Added 241 Read/Feed constraints in 92 ms returned sat
[2023-03-12 13:27:32] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 0 ms to minimize.
[2023-03-12 13:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-12 13:27:33] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 250 ms.
[2023-03-12 13:27:33] [INFO ] Added : 3 causal constraints over 1 iterations in 578 ms. Result :sat
Minimization took 337 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 57 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 59 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:27:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:34] [INFO ] Invariant cache hit.
[2023-03-12 13:27:34] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-12 13:27:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:34] [INFO ] Invariant cache hit.
[2023-03-12 13:27:35] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:36] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
[2023-03-12 13:27:36] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-12 13:27:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:36] [INFO ] Invariant cache hit.
[2023-03-12 13:27:37] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3315 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-03 in 17699 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-04
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:37] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) 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
[2023-03-12 13:27:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:37] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 13:27:37] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:38] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-12 13:27:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:27:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:38] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2023-03-12 13:27:38] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:38] [INFO ] [Nat]Added 241 Read/Feed constraints in 50 ms returned sat
[2023-03-12 13:27:39] [INFO ] Deduced a trap composed of 16 places in 346 ms of which 1 ms to minimize.
[2023-03-12 13:27:39] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 1 ms to minimize.
[2023-03-12 13:27:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 875 ms
[2023-03-12 13:27:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 247 ms.
[2023-03-12 13:27:40] [INFO ] Deduced a trap composed of 49 places in 308 ms of which 0 ms to minimize.
[2023-03-12 13:27:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2023-03-12 13:27:40] [INFO ] Added : 7 causal constraints over 2 iterations in 1256 ms. Result :sat
Minimization took 293 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 65 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:41] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4869 ms. (steps per millisecond=205 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2148 ms. (steps per millisecond=465 ) properties (out of 1) seen :0
[2023-03-12 13:27:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:48] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 13:27:48] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:48] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2023-03-12 13:27:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:27:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:49] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2023-03-12 13:27:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:49] [INFO ] [Nat]Added 241 Read/Feed constraints in 55 ms returned sat
[2023-03-12 13:27:52] [INFO ] Deduced a trap composed of 16 places in 3292 ms of which 3 ms to minimize.
[2023-03-12 13:27:53] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2023-03-12 13:27:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3771 ms
[2023-03-12 13:27:53] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 276 ms.
[2023-03-12 13:27:54] [INFO ] Deduced a trap composed of 49 places in 317 ms of which 14 ms to minimize.
[2023-03-12 13:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 481 ms
[2023-03-12 13:27:54] [INFO ] Added : 7 causal constraints over 2 iterations in 1260 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 48 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:27:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:54] [INFO ] Invariant cache hit.
[2023-03-12 13:27:55] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-12 13:27:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:55] [INFO ] Invariant cache hit.
[2023-03-12 13:27:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:27:58] [INFO ] Implicit Places using invariants and state equation in 2932 ms returned []
Implicit Place search using SMT with State Equation took 3337 ms to find 0 implicit places.
[2023-03-12 13:27:58] [INFO ] Redundant transitions in 95 ms returned []
[2023-03-12 13:27:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:27:58] [INFO ] Invariant cache hit.
[2023-03-12 13:27:59] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4528 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-04 in 22016 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-07
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:59] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2023-03-12 13:27:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:27:59] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-12 13:27:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:00] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2023-03-12 13:28:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:01] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2023-03-12 13:28:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:28:01] [INFO ] [Nat]Added 241 Read/Feed constraints in 134 ms returned sat
[2023-03-12 13:28:01] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 199 ms.
[2023-03-12 13:28:01] [INFO ] Added : 4 causal constraints over 1 iterations in 553 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 73 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:28:02] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5622 ms. (steps per millisecond=177 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2339 ms. (steps per millisecond=427 ) properties (out of 1) seen :0
[2023-03-12 13:28:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:28:10] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 13:28:10] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:11] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-12 13:28:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:11] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-12 13:28:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:28:11] [INFO ] [Nat]Added 241 Read/Feed constraints in 116 ms returned sat
[2023-03-12 13:28:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 272 ms.
[2023-03-12 13:28:12] [INFO ] Added : 4 causal constraints over 1 iterations in 624 ms. Result :sat
Minimization took 306 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 45 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:28:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:28:13] [INFO ] Invariant cache hit.
[2023-03-12 13:28:13] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-12 13:28:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:28:13] [INFO ] Invariant cache hit.
[2023-03-12 13:28:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:28:17] [INFO ] Implicit Places using invariants and state equation in 4212 ms returned []
Implicit Place search using SMT with State Equation took 4702 ms to find 0 implicit places.
[2023-03-12 13:28:17] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-12 13:28:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:28:17] [INFO ] Invariant cache hit.
[2023-03-12 13:28:19] [INFO ] Dead Transitions using invariants and state equation in 1342 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6162 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-07 in 19680 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-08
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:28:19] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-12 13:28:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:28:19] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:28:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:19] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-12 13:28:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:28:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:20] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-12 13:28:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:28:20] [INFO ] [Nat]Added 241 Read/Feed constraints in 94 ms returned sat
[2023-03-12 13:28:20] [INFO ] Deduced a trap composed of 22 places in 387 ms of which 17 ms to minimize.
[2023-03-12 13:28:21] [INFO ] Deduced a trap composed of 114 places in 355 ms of which 0 ms to minimize.
[2023-03-12 13:28:21] [INFO ] Deduced a trap composed of 47 places in 395 ms of which 1 ms to minimize.
[2023-03-12 13:28:22] [INFO ] Deduced a trap composed of 58 places in 380 ms of which 0 ms to minimize.
[2023-03-12 13:28:22] [INFO ] Deduced a trap composed of 67 places in 383 ms of which 0 ms to minimize.
[2023-03-12 13:28:23] [INFO ] Deduced a trap composed of 45 places in 395 ms of which 1 ms to minimize.
[2023-03-12 13:28:23] [INFO ] Deduced a trap composed of 109 places in 387 ms of which 0 ms to minimize.
[2023-03-12 13:28:24] [INFO ] Deduced a trap composed of 77 places in 388 ms of which 1 ms to minimize.
[2023-03-12 13:28:24] [INFO ] Deduced a trap composed of 45 places in 348 ms of which 0 ms to minimize.
[2023-03-12 13:28:25] [INFO ] Deduced a trap composed of 9 places in 615 ms of which 0 ms to minimize.
[2023-03-12 13:28:25] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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 :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:28:25] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 4965 ms. (steps per millisecond=201 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2537 ms. (steps per millisecond=394 ) properties (out of 1) seen :0
[2023-03-12 13:28:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:28:32] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 13:28:33] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:33] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-12 13:28:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:34] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2023-03-12 13:28:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:28:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 82 ms returned sat
[2023-03-12 13:28:34] [INFO ] Deduced a trap composed of 22 places in 418 ms of which 1 ms to minimize.
[2023-03-12 13:28:35] [INFO ] Deduced a trap composed of 114 places in 472 ms of which 0 ms to minimize.
[2023-03-12 13:28:35] [INFO ] Deduced a trap composed of 47 places in 432 ms of which 0 ms to minimize.
[2023-03-12 13:28:36] [INFO ] Deduced a trap composed of 58 places in 450 ms of which 0 ms to minimize.
[2023-03-12 13:28:36] [INFO ] Deduced a trap composed of 67 places in 441 ms of which 0 ms to minimize.
[2023-03-12 13:28:37] [INFO ] Deduced a trap composed of 45 places in 451 ms of which 1 ms to minimize.
[2023-03-12 13:28:37] [INFO ] Deduced a trap composed of 109 places in 464 ms of which 1 ms to minimize.
[2023-03-12 13:28:38] [INFO ] Deduced a trap composed of 77 places in 432 ms of which 1 ms to minimize.
[2023-03-12 13:28:39] [INFO ] Deduced a trap composed of 45 places in 460 ms of which 0 ms to minimize.
[2023-03-12 13:28:39] [INFO ] Deduced a trap composed of 46 places in 456 ms of which 1 ms to minimize.
[2023-03-12 13:28:40] [INFO ] Deduced a trap composed of 39 places in 467 ms of which 0 ms to minimize.
[2023-03-12 13:28:40] [INFO ] Deduced a trap composed of 39 places in 422 ms of which 0 ms to minimize.
[2023-03-12 13:28:41] [INFO ] Deduced a trap composed of 50 places in 423 ms of which 1 ms to minimize.
[2023-03-12 13:28:41] [INFO ] Deduced a trap composed of 50 places in 411 ms of which 0 ms to minimize.
[2023-03-12 13:28:42] [INFO ] Deduced a trap composed of 74 places in 439 ms of which 1 ms to minimize.
[2023-03-12 13:28:43] [INFO ] Deduced a trap composed of 63 places in 396 ms of which 1 ms to minimize.
[2023-03-12 13:28:43] [INFO ] Deduced a trap composed of 68 places in 416 ms of which 1 ms to minimize.
[2023-03-12 13:28:44] [INFO ] Deduced a trap composed of 88 places in 406 ms of which 0 ms to minimize.
[2023-03-12 13:28:45] [INFO ] Deduced a trap composed of 104 places in 683 ms of which 1 ms to minimize.
[2023-03-12 13:28:46] [INFO ] Deduced a trap composed of 50 places in 512 ms of which 0 ms to minimize.
[2023-03-12 13:28:46] [INFO ] Deduced a trap composed of 17 places in 302 ms of which 0 ms to minimize.
[2023-03-12 13:28:47] [INFO ] Deduced a trap composed of 16 places in 366 ms of which 1 ms to minimize.
[2023-03-12 13:28:47] [INFO ] Deduced a trap composed of 89 places in 529 ms of which 1 ms to minimize.
[2023-03-12 13:28:48] [INFO ] Deduced a trap composed of 70 places in 424 ms of which 1 ms to minimize.
[2023-03-12 13:28:49] [INFO ] Deduced a trap composed of 52 places in 428 ms of which 0 ms to minimize.
[2023-03-12 13:28:49] [INFO ] Deduced a trap composed of 52 places in 437 ms of which 0 ms to minimize.
[2023-03-12 13:28:50] [INFO ] Deduced a trap composed of 70 places in 431 ms of which 0 ms to minimize.
[2023-03-12 13:28:50] [INFO ] Deduced a trap composed of 108 places in 460 ms of which 0 ms to minimize.
[2023-03-12 13:28:51] [INFO ] Deduced a trap composed of 108 places in 489 ms of which 4 ms to minimize.
[2023-03-12 13:28:52] [INFO ] Deduced a trap composed of 107 places in 435 ms of which 0 ms to minimize.
[2023-03-12 13:28:52] [INFO ] Deduced a trap composed of 70 places in 428 ms of which 0 ms to minimize.
[2023-03-12 13:28:53] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 19356 ms
[2023-03-12 13:28:53] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 236 ms.
[2023-03-12 13:28:54] [INFO ] Added : 8 causal constraints over 2 iterations in 678 ms. Result :sat
Minimization took 679 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 64 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 45 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:28:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:28:55] [INFO ] Invariant cache hit.
[2023-03-12 13:28:55] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-12 13:28:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:28:55] [INFO ] Invariant cache hit.
[2023-03-12 13:28:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:28:57] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
[2023-03-12 13:28:57] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-12 13:28:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:28:57] [INFO ] Invariant cache hit.
[2023-03-12 13:28:58] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3239 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-08 in 39390 ms.
[2023-03-12 13:28:59] [INFO ] Flatten gal took : 391 ms
[2023-03-12 13:28:59] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 13:28:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 18 ms.
Total runtime 194093 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1026/ub_0_ --maxsum=/tmp/1026/ub_1_ --maxsum=/tmp/1026/ub_2_ --maxsum=/tmp/1026/ub_3_ --maxsum=/tmp/1026/ub_4_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15153184 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16081692 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q3m008, 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 r041-tajo-167813694600341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m008.tgz
mv BugTracking-PT-q3m008 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 ;