fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694600381
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BugTracking-PT-q3m256

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
698.707 3600000.00 13990159.00 208.70 ? ? 0 0 0 0 0 ? 0 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-167813694600381.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-q3m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-q3m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678632346346

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-q3m256
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:45:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 14:45:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:45:48] [INFO ] Load time of PNML (sax parser for PT used): 679 ms
[2023-03-12 14:45:48] [INFO ] Transformed 754 places.
[2023-03-12 14:45:49] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:45:49] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 893 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 514 places in 173 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2023-03-12 14:45:49] [INFO ] Computed 10 place invariants in 71 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :1
FORMULA BugTracking-PT-q3m256-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :4
[2023-03-12 14:45:49] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-12 14:45:49] [INFO ] Computed 10 place invariants in 15 ms
[2023-03-12 14:45:49] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 14:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:45:50] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-12 14:45:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:45:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-12 14:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:45:51] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2023-03-12 14:45:51] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 14:45:51] [INFO ] [Nat]Added 255 Read/Feed constraints in 66 ms returned sat
[2023-03-12 14:45:51] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 332 ms.
[2023-03-12 14:45:53] [INFO ] Deduced a trap composed of 12 places in 938 ms of which 12 ms to minimize.
[2023-03-12 14:45:54] [INFO ] Deduced a trap composed of 38 places in 747 ms of which 2 ms to minimize.
[2023-03-12 14:45:54] [INFO ] Deduced a trap composed of 55 places in 604 ms of which 3 ms to minimize.
[2023-03-12 14:45:55] [INFO ] Deduced a trap composed of 7 places in 701 ms of which 2 ms to minimize.
[2023-03-12 14:45:55] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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)
[2023-03-12 14:45:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:45:56] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-12 14:45:56] [INFO ] [Real]Added 255 Read/Feed constraints in 34 ms returned sat
[2023-03-12 14:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:45:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 14:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:45:56] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2023-03-12 14:45:56] [INFO ] [Nat]Added 255 Read/Feed constraints in 63 ms returned sat
[2023-03-12 14:45:56] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 174 ms.
[2023-03-12 14:45:57] [INFO ] Added : 2 causal constraints over 1 iterations in 503 ms. Result :sat
Minimization took 226 ms.
[2023-03-12 14:45:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:45:57] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-12 14:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:45:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:45:58] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2023-03-12 14:45:58] [INFO ] [Nat]Added 255 Read/Feed constraints in 69 ms returned sat
[2023-03-12 14:45:58] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 291 ms.
[2023-03-12 14:45:59] [INFO ] Added : 2 causal constraints over 1 iterations in 591 ms. Result :sat
Minimization took 170 ms.
[2023-03-12 14:45:59] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 14:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:00] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2023-03-12 14:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 14:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:00] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-12 14:46:00] [INFO ] [Nat]Added 255 Read/Feed constraints in 97 ms returned sat
[2023-03-12 14:46:00] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 1 ms to minimize.
[2023-03-12 14:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-12 14:46:01] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 249 ms.
[2023-03-12 14:46:01] [INFO ] Deduced a trap composed of 48 places in 304 ms of which 0 ms to minimize.
[2023-03-12 14:46:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 464 ms
[2023-03-12 14:46:02] [INFO ] Added : 7 causal constraints over 2 iterations in 1132 ms. Result :sat
Minimization took 347 ms.
[2023-03-12 14:46:02] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 14:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:02] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2023-03-12 14:46:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 14:46:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:03] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-12 14:46:03] [INFO ] [Nat]Added 255 Read/Feed constraints in 104 ms returned sat
[2023-03-12 14:46:03] [INFO ] Deduced a trap composed of 52 places in 358 ms of which 1 ms to minimize.
[2023-03-12 14:46:04] [INFO ] Deduced a trap composed of 31 places in 379 ms of which 1 ms to minimize.
[2023-03-12 14:46:04] [INFO ] Deduced a trap composed of 95 places in 386 ms of which 1 ms to minimize.
[2023-03-12 14:46:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1486 ms
[2023-03-12 14:46:05] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 244 ms.
[2023-03-12 14:46:05] [INFO ] Added : 4 causal constraints over 1 iterations in 489 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1] Max seen :[0, 12, 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.13 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 3 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 307 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 307 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 14:46:06] [INFO ] Computed 8 place invariants in 26 ms
Incomplete random walk after 1000236 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2350 ms. (steps per millisecond=425 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2184 ms. (steps per millisecond=457 ) properties (out of 5) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2256 ms. (steps per millisecond=443 ) 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 2228 ms. (steps per millisecond=448 ) properties (out of 5) seen :2
[2023-03-12 14:46:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:46:18] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-12 14:46:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:18] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-12 14:46:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 14:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:19] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2023-03-12 14:46:19] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:46:19] [INFO ] [Nat]Added 241 Read/Feed constraints in 186 ms returned sat
[2023-03-12 14:46:20] [INFO ] Deduced a trap composed of 10 places in 550 ms of which 1 ms to minimize.
[2023-03-12 14:46:20] [INFO ] Deduced a trap composed of 10 places in 477 ms of which 1 ms to minimize.
[2023-03-12 14:46:21] [INFO ] Deduced a trap composed of 23 places in 595 ms of which 1 ms to minimize.
[2023-03-12 14:46:22] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 0 ms to minimize.
[2023-03-12 14:46:22] [INFO ] Deduced a trap composed of 83 places in 435 ms of which 0 ms to minimize.
[2023-03-12 14:46:23] [INFO ] Deduced a trap composed of 36 places in 396 ms of which 1 ms to minimize.
[2023-03-12 14:46:23] [INFO ] Deduced a trap composed of 90 places in 391 ms of which 1 ms to minimize.
[2023-03-12 14:46:23] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 0 ms to minimize.
[2023-03-12 14:46:24] [INFO ] Deduced a trap composed of 14 places in 524 ms of which 0 ms to minimize.
[2023-03-12 14:46:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4814 ms
[2023-03-12 14:46:24] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 203 ms.
[2023-03-12 14:46:25] [INFO ] Added : 6 causal constraints over 2 iterations in 528 ms. Result :sat
Minimization took 253 ms.
[2023-03-12 14:46:25] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 14:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:25] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-12 14:46:25] [INFO ] [Real]Added 241 Read/Feed constraints in 42 ms returned sat
[2023-03-12 14:46:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:26] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2023-03-12 14:46:26] [INFO ] [Nat]Added 241 Read/Feed constraints in 35 ms returned sat
[2023-03-12 14:46:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 239 ms.
[2023-03-12 14:46:26] [INFO ] Added : 2 causal constraints over 1 iterations in 435 ms. Result :sat
Minimization took 223 ms.
[2023-03-12 14:46:27] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2023-03-12 14:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:27] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-12 14:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:28] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2023-03-12 14:46:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 58 ms returned sat
[2023-03-12 14:46:28] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 336 ms.
[2023-03-12 14:46:29] [INFO ] Added : 2 causal constraints over 1 iterations in 633 ms. Result :sat
Minimization took 188 ms.
[2023-03-12 14:46:29] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:29] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2023-03-12 14:46:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:46:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:30] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2023-03-12 14:46:30] [INFO ] [Nat]Added 241 Read/Feed constraints in 90 ms returned sat
[2023-03-12 14:46:30] [INFO ] Deduced a trap composed of 22 places in 378 ms of which 1 ms to minimize.
[2023-03-12 14:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2023-03-12 14:46:31] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 269 ms.
[2023-03-12 14:46:31] [INFO ] Added : 7 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 209 ms.
[2023-03-12 14:46:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:32] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-12 14:46:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:32] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2023-03-12 14:46:33] [INFO ] [Nat]Added 241 Read/Feed constraints in 129 ms returned sat
[2023-03-12 14:46:33] [INFO ] Deduced a trap composed of 38 places in 290 ms of which 1 ms to minimize.
[2023-03-12 14:46:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2023-03-12 14:46:33] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 201 ms.
[2023-03-12 14:46:33] [INFO ] Added : 3 causal constraints over 1 iterations in 485 ms. Result :sat
Minimization took 3022 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1] Max seen :[0, 12, 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 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 47 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 58 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:46:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:46:37] [INFO ] Invariant cache hit.
[2023-03-12 14:46:40] [INFO ] Implicit Places using invariants in 3136 ms returned []
[2023-03-12 14:46:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:46:40] [INFO ] Invariant cache hit.
[2023-03-12 14:46:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:46:43] [INFO ] Implicit Places using invariants and state equation in 3181 ms returned []
Implicit Place search using SMT with State Equation took 6336 ms to find 0 implicit places.
[2023-03-12 14:46:44] [INFO ] Redundant transitions in 482 ms returned []
[2023-03-12 14:46:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:46:44] [INFO ] Invariant cache hit.
[2023-03-12 14:46:45] [INFO ] Dead Transitions using invariants and state equation in 1492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8393 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-00
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:46:45] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10130 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1688 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2023-03-12 14:46:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:46:45] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 14:46:46] [INFO ] [Real]Absence check using 8 positive place invariants in 53 ms returned sat
[2023-03-12 14:46:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:48] [INFO ] [Real]Absence check using state equation in 2466 ms returned sat
[2023-03-12 14:46:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:48] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2023-03-12 14:46:48] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:46:49] [INFO ] [Nat]Added 241 Read/Feed constraints in 148 ms returned sat
[2023-03-12 14:46:49] [INFO ] Deduced a trap composed of 10 places in 475 ms of which 0 ms to minimize.
[2023-03-12 14:46:50] [INFO ] Deduced a trap composed of 10 places in 435 ms of which 1 ms to minimize.
[2023-03-12 14:46:50] [INFO ] Deduced a trap composed of 23 places in 444 ms of which 0 ms to minimize.
[2023-03-12 14:46:51] [INFO ] Deduced a trap composed of 54 places in 390 ms of which 0 ms to minimize.
[2023-03-12 14:46:51] [INFO ] Deduced a trap composed of 83 places in 564 ms of which 1 ms to minimize.
[2023-03-12 14:46:52] [INFO ] Deduced a trap composed of 36 places in 536 ms of which 1 ms to minimize.
[2023-03-12 14:46:52] [INFO ] Deduced a trap composed of 90 places in 367 ms of which 0 ms to minimize.
[2023-03-12 14:46:53] [INFO ] Deduced a trap composed of 47 places in 589 ms of which 1 ms to minimize.
[2023-03-12 14:46:53] [INFO ] Deduced a trap composed of 14 places in 565 ms of which 0 ms to minimize.
[2023-03-12 14:46:53] [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 45 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 58 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 14:46:54] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000015 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2196 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
[2023-03-12 14:46:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:46:56] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-12 14:46:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:57] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2023-03-12 14:46:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:46:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:46:57] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-12 14:46:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:46:58] [INFO ] [Nat]Added 241 Read/Feed constraints in 121 ms returned sat
[2023-03-12 14:46:58] [INFO ] Deduced a trap composed of 10 places in 592 ms of which 1 ms to minimize.
[2023-03-12 14:46:59] [INFO ] Deduced a trap composed of 10 places in 367 ms of which 1 ms to minimize.
[2023-03-12 14:46:59] [INFO ] Deduced a trap composed of 23 places in 377 ms of which 1 ms to minimize.
[2023-03-12 14:46:59] [INFO ] Deduced a trap composed of 54 places in 340 ms of which 0 ms to minimize.
[2023-03-12 14:47:00] [INFO ] Deduced a trap composed of 83 places in 352 ms of which 0 ms to minimize.
[2023-03-12 14:47:00] [INFO ] Deduced a trap composed of 36 places in 356 ms of which 0 ms to minimize.
[2023-03-12 14:47:01] [INFO ] Deduced a trap composed of 90 places in 337 ms of which 0 ms to minimize.
[2023-03-12 14:47:01] [INFO ] Deduced a trap composed of 47 places in 363 ms of which 0 ms to minimize.
[2023-03-12 14:47:01] [INFO ] Deduced a trap composed of 14 places in 359 ms of which 1 ms to minimize.
[2023-03-12 14:47:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3984 ms
[2023-03-12 14:47:02] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 204 ms.
[2023-03-12 14:47:02] [INFO ] Added : 6 causal constraints over 2 iterations in 522 ms. Result :sat
Minimization took 278 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 40 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 41 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 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:47:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:03] [INFO ] Invariant cache hit.
[2023-03-12 14:47:03] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-12 14:47:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:03] [INFO ] Invariant cache hit.
[2023-03-12 14:47:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:05] [INFO ] Implicit Places using invariants and state equation in 2555 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2023-03-12 14:47:06] [INFO ] Redundant transitions in 201 ms returned []
[2023-03-12 14:47:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:06] [INFO ] Invariant cache hit.
[2023-03-12 14:47:07] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4136 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-00 in 21388 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-01
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:07] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10107 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2021 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :4
[2023-03-12 14:47:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:07] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 14:47:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:07] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2023-03-12 14:47:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:07] [INFO ] [Real]Added 241 Read/Feed constraints in 47 ms returned sat
[2023-03-12 14:47:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:47:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:08] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-12 14:47:08] [INFO ] [Nat]Added 241 Read/Feed constraints in 33 ms returned sat
[2023-03-12 14:47:08] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 200 ms.
[2023-03-12 14:47:08] [INFO ] Added : 2 causal constraints over 1 iterations in 414 ms. Result :sat
Minimization took 225 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
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 43 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 44 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 14:47:09] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000163 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=2193 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2137 ms. (steps per millisecond=467 ) properties (out of 1) seen :17
[2023-03-12 14:47:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:11] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 14:47:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:12] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-12 14:47:12] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:12] [INFO ] [Real]Added 241 Read/Feed constraints in 35 ms returned sat
[2023-03-12 14:47:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:47:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:12] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2023-03-12 14:47:12] [INFO ] [Nat]Added 241 Read/Feed constraints in 34 ms returned sat
[2023-03-12 14:47:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 198 ms.
[2023-03-12 14:47:13] [INFO ] Added : 2 causal constraints over 1 iterations in 374 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[17]
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 66 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 67 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 57 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:47:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:13] [INFO ] Invariant cache hit.
[2023-03-12 14:47:14] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-12 14:47:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:14] [INFO ] Invariant cache hit.
[2023-03-12 14:47:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:15] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
[2023-03-12 14:47:15] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-12 14:47:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:15] [INFO ] Invariant cache hit.
[2023-03-12 14:47:16] [INFO ] Dead Transitions using invariants and state equation in 1240 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3362 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 14:47:16] [INFO ] Computed 8 place invariants in 20 ms
Incomplete random walk after 1000057 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2223 ms. (steps per millisecond=449 ) properties (out of 1) seen :2
[2023-03-12 14:47:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:19] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 14:47:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:20] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-12 14:47:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:20] [INFO ] [Real]Added 241 Read/Feed constraints in 35 ms returned sat
[2023-03-12 14:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:47:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:20] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-12 14:47:20] [INFO ] [Nat]Added 241 Read/Feed constraints in 35 ms returned sat
[2023-03-12 14:47:20] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 202 ms.
[2023-03-12 14:47:21] [INFO ] Added : 2 causal constraints over 1 iterations in 458 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[17]
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 98 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 99 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 88 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:47:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:21] [INFO ] Invariant cache hit.
[2023-03-12 14:47:22] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-12 14:47:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:22] [INFO ] Invariant cache hit.
[2023-03-12 14:47:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:24] [INFO ] Implicit Places using invariants and state equation in 2591 ms returned []
Implicit Place search using SMT with State Equation took 2934 ms to find 0 implicit places.
[2023-03-12 14:47:24] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-12 14:47:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:24] [INFO ] Invariant cache hit.
[2023-03-12 14:47:26] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4320 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-01 in 18890 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-07
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:26] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10123 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2024 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
[2023-03-12 14:47:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:26] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 14:47:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:26] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2023-03-12 14:47:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:47:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:27] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-12 14:47:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:27] [INFO ] [Nat]Added 241 Read/Feed constraints in 31 ms returned sat
[2023-03-12 14:47:27] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 313 ms.
[2023-03-12 14:47:27] [INFO ] Added : 2 causal constraints over 1 iterations in 598 ms. Result :sat
Minimization took 180 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 32 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 34 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 14:47:28] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 1000247 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=2083 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2131 ms. (steps per millisecond=469 ) properties (out of 1) seen :0
[2023-03-12 14:47:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:30] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 14:47:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:31] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2023-03-12 14:47:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:47:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:31] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2023-03-12 14:47:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:32] [INFO ] [Nat]Added 241 Read/Feed constraints in 32 ms returned sat
[2023-03-12 14:47:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 181 ms.
[2023-03-12 14:47:32] [INFO ] Added : 2 causal constraints over 1 iterations in 350 ms. Result :sat
Minimization took 194 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 46 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 46 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 14:47:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:32] [INFO ] Invariant cache hit.
[2023-03-12 14:47:33] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 14:47:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:33] [INFO ] Invariant cache hit.
[2023-03-12 14:47:33] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:34] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
[2023-03-12 14:47:34] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-12 14:47:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:34] [INFO ] Invariant cache hit.
[2023-03-12 14:47:43] [INFO ] Dead Transitions using invariants and state equation in 9077 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11156 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-07 in 17897 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-14
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:43] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10166 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2033 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2023-03-12 14:47:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:44] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 14:47:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:44] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2023-03-12 14:47:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:47:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:45] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2023-03-12 14:47:45] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 81 ms returned sat
[2023-03-12 14:47:45] [INFO ] Deduced a trap composed of 22 places in 534 ms of which 1 ms to minimize.
[2023-03-12 14:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 652 ms
[2023-03-12 14:47:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 185 ms.
[2023-03-12 14:47:46] [INFO ] Added : 7 causal constraints over 2 iterations in 444 ms. Result :sat
Minimization took 214 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 41 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.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:46] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000041 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
[2023-03-12 14:47:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:49] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-12 14:47:49] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:50] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2023-03-12 14:47:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:47:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:50] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-12 14:47:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:51] [INFO ] [Nat]Added 241 Read/Feed constraints in 114 ms returned sat
[2023-03-12 14:47:54] [INFO ] Deduced a trap composed of 22 places in 3144 ms of which 1 ms to minimize.
[2023-03-12 14:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3301 ms
[2023-03-12 14:47:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 219 ms.
[2023-03-12 14:47:54] [INFO ] Added : 7 causal constraints over 2 iterations in 626 ms. Result :sat
Minimization took 280 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 85 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 85 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 73 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:47:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:55] [INFO ] Invariant cache hit.
[2023-03-12 14:47:55] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-12 14:47:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:55] [INFO ] Invariant cache hit.
[2023-03-12 14:47:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:47:57] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
[2023-03-12 14:47:57] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-12 14:47:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:47:57] [INFO ] Invariant cache hit.
[2023-03-12 14:47:58] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3529 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-14 in 15082 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-15
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:59] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10078 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2015 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-12 14:47:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:47:59] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-12 14:47:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:47:59] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-12 14:47:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:47:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:48:00] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2023-03-12 14:48:00] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:48:00] [INFO ] [Nat]Added 241 Read/Feed constraints in 137 ms returned sat
[2023-03-12 14:48:03] [INFO ] Deduced a trap composed of 38 places in 3620 ms of which 1 ms to minimize.
[2023-03-12 14:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3734 ms
[2023-03-12 14:48:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 191 ms.
[2023-03-12 14:48:04] [INFO ] Added : 3 causal constraints over 1 iterations in 474 ms. Result :sat
Minimization took 44 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 81 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 82 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 14:48:04] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000138 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=1683 ) 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 14:48:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:48:07] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 14:48:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:48:08] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2023-03-12 14:48:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:48:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:48:08] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2023-03-12 14:48:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:48:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 132 ms returned sat
[2023-03-12 14:48:09] [INFO ] Deduced a trap composed of 38 places in 434 ms of which 1 ms to minimize.
[2023-03-12 14:48:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2023-03-12 14:48:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 188 ms.
[2023-03-12 14:48:10] [INFO ] Added : 3 causal constraints over 1 iterations in 413 ms. Result :sat
Minimization took 3006 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 77 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 78 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 14:48:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:48:13] [INFO ] Invariant cache hit.
[2023-03-12 14:48:13] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-12 14:48:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:48:13] [INFO ] Invariant cache hit.
[2023-03-12 14:48:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:48:16] [INFO ] Implicit Places using invariants and state equation in 2620 ms returned []
Implicit Place search using SMT with State Equation took 3164 ms to find 0 implicit places.
[2023-03-12 14:48:16] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-12 14:48:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:48:16] [INFO ] Invariant cache hit.
[2023-03-12 14:48:17] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4273 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-15 in 18353 ms.
[2023-03-12 14:48:18] [INFO ] Flatten gal took : 414 ms
[2023-03-12 14:48:18] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 14:48:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 33 ms.
Total runtime 149929 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/916/ub_0_ --maxsum=/tmp/916/ub_1_ --maxsum=/tmp/916/ub_2_ --maxsum=/tmp/916/ub_3_ --maxsum=/tmp/916/ub_4_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15574280 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16080700 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-q3m256"
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-q3m256, 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-167813694600381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;