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.r043-tajo-167813696800445.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 smartxred
Input is BugTracking-PT-q8m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696800445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 06:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 06:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K 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.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 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-q8m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678789619049

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:27:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 10:27:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:27:01] [INFO ] Load time of PNML (sax parser for PT used): 864 ms
[2023-03-14 10:27:01] [INFO ] Transformed 754 places.
[2023-03-14 10:27:01] [INFO ] Transformed 27370 transitions.
[2023-03-14 10:27:01] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 474 places in 133 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 10:27:02] [INFO ] Computed 10 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
[2023-03-14 10:27:02] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 10:27:02] [INFO ] Computed 10 place invariants in 15 ms
[2023-03-14 10:27:02] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-14 10:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:03] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2023-03-14 10:27:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-14 10:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:04] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2023-03-14 10:27:04] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-14 10:27:04] [INFO ] [Nat]Added 303 Read/Feed constraints in 73 ms returned sat
[2023-03-14 10:27:05] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 380 ms.
[2023-03-14 10:27:05] [INFO ] Added : 2 causal constraints over 1 iterations in 833 ms. Result :sat
[2023-03-14 10:27:05] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 10:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:06] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2023-03-14 10:27:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 10:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:06] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-14 10:27:06] [INFO ] [Nat]Added 303 Read/Feed constraints in 149 ms returned sat
[2023-03-14 10:27:07] [INFO ] Deduced a trap composed of 87 places in 413 ms of which 12 ms to minimize.
[2023-03-14 10:27:08] [INFO ] Deduced a trap composed of 95 places in 1282 ms of which 0 ms to minimize.
[2023-03-14 10:27:09] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 1 ms to minimize.
[2023-03-14 10:27:10] [INFO ] Deduced a trap composed of 54 places in 415 ms of which 2 ms to minimize.
[2023-03-14 10:27:10] [INFO ] Deduced a trap composed of 56 places in 397 ms of which 0 ms to minimize.
[2023-03-14 10:27:11] [INFO ] Deduced a trap composed of 87 places in 449 ms of which 1 ms to minimize.
[2023-03-14 10:27:11] [INFO ] Deduced a trap composed of 52 places in 386 ms of which 1 ms to minimize.
[2023-03-14 10:27:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2023-03-14 10:27:11] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 10:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:12] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2023-03-14 10:27:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 10:27:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:13] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2023-03-14 10:27:13] [INFO ] [Nat]Added 303 Read/Feed constraints in 237 ms returned sat
[2023-03-14 10:27:13] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2023-03-14 10:27:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2023-03-14 10:27:14] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 285 ms.
[2023-03-14 10:27:14] [INFO ] Added : 8 causal constraints over 2 iterations in 888 ms. Result :sat
[2023-03-14 10:27:14] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 10:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:15] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-03-14 10:27:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 10:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:16] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-14 10:27:16] [INFO ] [Nat]Added 303 Read/Feed constraints in 140 ms returned sat
[2023-03-14 10:27:17] [INFO ] Deduced a trap composed of 59 places in 555 ms of which 0 ms to minimize.
[2023-03-14 10:27:17] [INFO ] Deduced a trap composed of 107 places in 637 ms of which 1 ms to minimize.
[2023-03-14 10:27:18] [INFO ] Deduced a trap composed of 52 places in 625 ms of which 2 ms to minimize.
[2023-03-14 10:27:19] [INFO ] Deduced a trap composed of 14 places in 661 ms of which 1 ms to minimize.
[2023-03-14 10:27:19] [INFO ] Deduced a trap composed of 19 places in 623 ms of which 0 ms to minimize.
[2023-03-14 10:27:20] [INFO ] Deduced a trap composed of 59 places in 577 ms of which 1 ms to minimize.
[2023-03-14 10:27:20] [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 3
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)
[2023-03-14 10:27:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 10:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:21] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2023-03-14 10:27:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-14 10:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:21] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2023-03-14 10:27:21] [INFO ] [Nat]Added 303 Read/Feed constraints in 95 ms returned sat
[2023-03-14 10:27:22] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 0 ms to minimize.
[2023-03-14 10:27:22] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 0 ms to minimize.
[2023-03-14 10:27:23] [INFO ] Deduced a trap composed of 36 places in 348 ms of which 1 ms to minimize.
[2023-03-14 10:27:23] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 1 ms to minimize.
[2023-03-14 10:27:24] [INFO ] Deduced a trap composed of 59 places in 362 ms of which 0 ms to minimize.
[2023-03-14 10:27:24] [INFO ] Deduced a trap composed of 60 places in 376 ms of which 0 ms to minimize.
[2023-03-14 10:27:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3025 ms
[2023-03-14 10:27:25] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 318 ms.
[2023-03-14 10:27:26] [INFO ] Deduced a trap composed of 59 places in 483 ms of which 0 ms to minimize.
[2023-03-14 10:27:26] [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.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)
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 295 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:27:27] [INFO ] Computed 8 place invariants in 30 ms
Incomplete random walk after 1000179 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=1815 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1485 ms. (steps per millisecond=673 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1516 ms. (steps per millisecond=659 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1521 ms. (steps per millisecond=657 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1481 ms. (steps per millisecond=675 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1461 ms. (steps per millisecond=684 ) properties (out of 5) seen :0
[2023-03-14 10:27:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:27:35] [INFO ] Computed 8 place invariants in 36 ms
[2023-03-14 10:27:35] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2023-03-14 10:27:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:36] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-14 10:27:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:36] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2023-03-14 10:27:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:27:37] [INFO ] [Nat]Added 283 Read/Feed constraints in 51 ms returned sat
[2023-03-14 10:27:37] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 282 ms.
[2023-03-14 10:27:37] [INFO ] Added : 2 causal constraints over 1 iterations in 719 ms. Result :sat
[2023-03-14 10:27:38] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-14 10:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:38] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2023-03-14 10:27:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:39] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2023-03-14 10:27:39] [INFO ] [Nat]Added 283 Read/Feed constraints in 92 ms returned sat
[2023-03-14 10:27:40] [INFO ] Deduced a trap composed of 54 places in 480 ms of which 2 ms to minimize.
[2023-03-14 10:27:40] [INFO ] Deduced a trap composed of 88 places in 516 ms of which 1 ms to minimize.
[2023-03-14 10:27:41] [INFO ] Deduced a trap composed of 89 places in 496 ms of which 1 ms to minimize.
[2023-03-14 10:27:42] [INFO ] Deduced a trap composed of 49 places in 443 ms of which 1 ms to minimize.
[2023-03-14 10:27:42] [INFO ] Deduced a trap composed of 81 places in 458 ms of which 0 ms to minimize.
[2023-03-14 10:27:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3551 ms
[2023-03-14 10:27:43] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 306 ms.
[2023-03-14 10:27:43] [INFO ] Added : 4 causal constraints over 1 iterations in 727 ms. Result :sat
[2023-03-14 10:27:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:44] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2023-03-14 10:27:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:27:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:45] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2023-03-14 10:27:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 176 ms returned sat
[2023-03-14 10:27:45] [INFO ] Deduced a trap composed of 36 places in 511 ms of which 1 ms to minimize.
[2023-03-14 10:27:46] [INFO ] Deduced a trap composed of 23 places in 510 ms of which 0 ms to minimize.
[2023-03-14 10:27:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1348 ms
[2023-03-14 10:27:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 332 ms.
[2023-03-14 10:27:47] [INFO ] Added : 2 causal constraints over 1 iterations in 784 ms. Result :sat
[2023-03-14 10:27:47] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:48] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2023-03-14 10:27:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:49] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2023-03-14 10:27:49] [INFO ] [Nat]Added 283 Read/Feed constraints in 215 ms returned sat
[2023-03-14 10:27:49] [INFO ] Deduced a trap composed of 10 places in 479 ms of which 1 ms to minimize.
[2023-03-14 10:27:50] [INFO ] Deduced a trap composed of 55 places in 497 ms of which 0 ms to minimize.
[2023-03-14 10:27:51] [INFO ] Deduced a trap composed of 55 places in 493 ms of which 1 ms to minimize.
[2023-03-14 10:27:51] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 1 ms to minimize.
[2023-03-14 10:27:52] [INFO ] Deduced a trap composed of 36 places in 464 ms of which 0 ms to minimize.
[2023-03-14 10:27:52] [INFO ] Deduced a trap composed of 90 places in 410 ms of which 1 ms to minimize.
[2023-03-14 10:27:53] [INFO ] Deduced a trap composed of 53 places in 435 ms of which 4 ms to minimize.
[2023-03-14 10:27:53] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 0 ms to minimize.
[2023-03-14 10:27:54] [INFO ] Deduced a trap composed of 52 places in 448 ms of which 1 ms to minimize.
[2023-03-14 10:27:54] [INFO ] Deduced a trap composed of 44 places in 326 ms of which 1 ms to minimize.
[2023-03-14 10:27:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5356 ms
[2023-03-14 10:27:55] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 289 ms.
[2023-03-14 10:27:55] [INFO ] Added : 9 causal constraints over 4 iterations in 1213 ms. Result :sat
[2023-03-14 10:27:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:56] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2023-03-14 10:27:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:27:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:27:57] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2023-03-14 10:27:57] [INFO ] [Nat]Added 283 Read/Feed constraints in 199 ms returned sat
[2023-03-14 10:27:58] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 1 ms to minimize.
[2023-03-14 10:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
[2023-03-14 10:27:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 264 ms.
[2023-03-14 10:27:58] [INFO ] Added : 5 causal constraints over 1 iterations in 682 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 81 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:27:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:27:59] [INFO ] Invariant cache hit.
[2023-03-14 10:28:00] [INFO ] Implicit Places using invariants in 731 ms returned []
[2023-03-14 10:28:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:00] [INFO ] Invariant cache hit.
[2023-03-14 10:28:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:02] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 3043 ms to find 0 implicit places.
[2023-03-14 10:28:02] [INFO ] Redundant transitions in 349 ms returned []
[2023-03-14 10:28:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:02] [INFO ] Invariant cache hit.
[2023-03-14 10:28:03] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4469 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:03] [INFO ] Computed 8 place invariants in 25 ms
Incomplete random walk after 10099 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2019 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2023-03-14 10:28:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:03] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-14 10:28:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:04] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2023-03-14 10:28:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:28:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:04] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2023-03-14 10:28:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:05] [INFO ] [Nat]Added 283 Read/Feed constraints in 39 ms returned sat
[2023-03-14 10:28:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 319 ms.
[2023-03-14 10:28:05] [INFO ] Added : 2 causal constraints over 1 iterations in 744 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 96 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:06] [INFO ] Computed 8 place invariants in 20 ms
Incomplete random walk after 1000184 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=1815 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1583 ms. (steps per millisecond=631 ) properties (out of 1) seen :0
[2023-03-14 10:28:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:08] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-14 10:28:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:08] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2023-03-14 10:28:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:28:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:09] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2023-03-14 10:28:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 50 ms returned sat
[2023-03-14 10:28:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 303 ms.
[2023-03-14 10:28:10] [INFO ] Added : 2 causal constraints over 1 iterations in 712 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:28:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:10] [INFO ] Invariant cache hit.
[2023-03-14 10:28:11] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-14 10:28:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:11] [INFO ] Invariant cache hit.
[2023-03-14 10:28:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:13] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2240 ms to find 0 implicit places.
[2023-03-14 10:28:13] [INFO ] Redundant transitions in 221 ms returned []
[2023-03-14 10:28:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:13] [INFO ] Invariant cache hit.
[2023-03-14 10:28:14] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3651 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-02 in 10626 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:14] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10143 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2535 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2023-03-14 10:28:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:14] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-14 10:28:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:28:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:14] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2023-03-14 10:28:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:28:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:15] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-14 10:28:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 99 ms returned sat
[2023-03-14 10:28:16] [INFO ] Deduced a trap composed of 54 places in 520 ms of which 1 ms to minimize.
[2023-03-14 10:28:16] [INFO ] Deduced a trap composed of 88 places in 464 ms of which 0 ms to minimize.
[2023-03-14 10:28:17] [INFO ] Deduced a trap composed of 89 places in 403 ms of which 1 ms to minimize.
[2023-03-14 10:28:18] [INFO ] Deduced a trap composed of 49 places in 408 ms of which 1 ms to minimize.
[2023-03-14 10:28:18] [INFO ] Deduced a trap composed of 81 places in 463 ms of which 0 ms to minimize.
[2023-03-14 10:28:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3305 ms
[2023-03-14 10:28:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 305 ms.
[2023-03-14 10:28:19] [INFO ] Added : 4 causal constraints over 1 iterations in 722 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:19] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000251 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=1656 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1714 ms. (steps per millisecond=583 ) properties (out of 1) seen :0
[2023-03-14 10:28:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:22] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-14 10:28:22] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:22] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-14 10:28:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:28:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:23] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-14 10:28:23] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 80 ms returned sat
[2023-03-14 10:28:24] [INFO ] Deduced a trap composed of 54 places in 412 ms of which 1 ms to minimize.
[2023-03-14 10:28:24] [INFO ] Deduced a trap composed of 88 places in 393 ms of which 0 ms to minimize.
[2023-03-14 10:28:25] [INFO ] Deduced a trap composed of 89 places in 383 ms of which 0 ms to minimize.
[2023-03-14 10:28:25] [INFO ] Deduced a trap composed of 49 places in 394 ms of which 1 ms to minimize.
[2023-03-14 10:28:26] [INFO ] Deduced a trap composed of 81 places in 456 ms of which 0 ms to minimize.
[2023-03-14 10:28:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3039 ms
[2023-03-14 10:28:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 339 ms.
[2023-03-14 10:28:27] [INFO ] Added : 4 causal constraints over 1 iterations in 767 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 76 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:28:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:27] [INFO ] Invariant cache hit.
[2023-03-14 10:28:28] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-14 10:28:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:28] [INFO ] Invariant cache hit.
[2023-03-14 10:28:28] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:30] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2023-03-14 10:28:30] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-14 10:28:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:30] [INFO ] Invariant cache hit.
[2023-03-14 10:28:31] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3850 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-08 in 17146 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:31] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10136 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1689 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-14 10:28:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:31] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-14 10:28:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:32] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-14 10:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:28:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:32] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-14 10:28:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 165 ms returned sat
[2023-03-14 10:28:33] [INFO ] Deduced a trap composed of 36 places in 493 ms of which 1 ms to minimize.
[2023-03-14 10:28:34] [INFO ] Deduced a trap composed of 23 places in 454 ms of which 1 ms to minimize.
[2023-03-14 10:28:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1303 ms
[2023-03-14 10:28:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 338 ms.
[2023-03-14 10:28:34] [INFO ] Added : 2 causal constraints over 1 iterations in 739 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 89 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:35] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000051 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=1782 ) 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-14 10:28:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:37] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-14 10:28:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:28:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:38] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2023-03-14 10:28:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:28:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:39] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2023-03-14 10:28:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:39] [INFO ] [Nat]Added 283 Read/Feed constraints in 136 ms returned sat
[2023-03-14 10:28:39] [INFO ] Deduced a trap composed of 36 places in 400 ms of which 0 ms to minimize.
[2023-03-14 10:28:40] [INFO ] Deduced a trap composed of 23 places in 495 ms of which 0 ms to minimize.
[2023-03-14 10:28:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1175 ms
[2023-03-14 10:28:40] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 319 ms.
[2023-03-14 10:28:41] [INFO ] Added : 2 causal constraints over 1 iterations in 726 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:28:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:41] [INFO ] Invariant cache hit.
[2023-03-14 10:28:42] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-14 10:28:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:42] [INFO ] Invariant cache hit.
[2023-03-14 10:28:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:44] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2579 ms to find 0 implicit places.
[2023-03-14 10:28:44] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-14 10:28:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:28:44] [INFO ] Invariant cache hit.
[2023-03-14 10:28:45] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3889 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-11 in 13939 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:45] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10163 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2540 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-14 10:28:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:45] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-14 10:28:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:46] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-14 10:28:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:28:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:46] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2023-03-14 10:28:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:46] [INFO ] [Nat]Added 283 Read/Feed constraints in 211 ms returned sat
[2023-03-14 10:28:47] [INFO ] Deduced a trap composed of 10 places in 425 ms of which 0 ms to minimize.
[2023-03-14 10:28:47] [INFO ] Deduced a trap composed of 55 places in 495 ms of which 0 ms to minimize.
[2023-03-14 10:28:48] [INFO ] Deduced a trap composed of 55 places in 494 ms of which 9 ms to minimize.
[2023-03-14 10:28:49] [INFO ] Deduced a trap composed of 35 places in 466 ms of which 0 ms to minimize.
[2023-03-14 10:28:49] [INFO ] Deduced a trap composed of 36 places in 475 ms of which 0 ms to minimize.
[2023-03-14 10:28:50] [INFO ] Deduced a trap composed of 90 places in 472 ms of which 1 ms to minimize.
[2023-03-14 10:28:50] [INFO ] Deduced a trap composed of 53 places in 481 ms of which 1 ms to minimize.
[2023-03-14 10:28:51] [INFO ] Deduced a trap composed of 53 places in 472 ms of which 1 ms to minimize.
[2023-03-14 10:28:51] [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 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 92 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:51] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1603 ms. (steps per millisecond=623 ) properties (out of 1) seen :0
[2023-03-14 10:28:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:28:53] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-14 10:28:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:54] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2023-03-14 10:28:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:28:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:28:54] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2023-03-14 10:28:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:28:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 157 ms returned sat
[2023-03-14 10:28:55] [INFO ] Deduced a trap composed of 10 places in 413 ms of which 0 ms to minimize.
[2023-03-14 10:28:56] [INFO ] Deduced a trap composed of 55 places in 447 ms of which 1 ms to minimize.
[2023-03-14 10:28:56] [INFO ] Deduced a trap composed of 55 places in 438 ms of which 1 ms to minimize.
[2023-03-14 10:28:57] [INFO ] Deduced a trap composed of 35 places in 442 ms of which 0 ms to minimize.
[2023-03-14 10:28:57] [INFO ] Deduced a trap composed of 36 places in 389 ms of which 0 ms to minimize.
[2023-03-14 10:28:58] [INFO ] Deduced a trap composed of 90 places in 428 ms of which 2 ms to minimize.
[2023-03-14 10:28:58] [INFO ] Deduced a trap composed of 53 places in 426 ms of which 1 ms to minimize.
[2023-03-14 10:28:59] [INFO ] Deduced a trap composed of 53 places in 428 ms of which 0 ms to minimize.
[2023-03-14 10:28:59] [INFO ] Deduced a trap composed of 52 places in 419 ms of which 0 ms to minimize.
[2023-03-14 10:29:00] [INFO ] Deduced a trap composed of 44 places in 364 ms of which 1 ms to minimize.
[2023-03-14 10:29:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5273 ms
[2023-03-14 10:29:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 348 ms.
[2023-03-14 10:29:01] [INFO ] Added : 9 causal constraints over 4 iterations in 1431 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 82 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:29:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:29:02] [INFO ] Invariant cache hit.
[2023-03-14 10:29:02] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-14 10:29:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:29:02] [INFO ] Invariant cache hit.
[2023-03-14 10:29:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:29:03] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
[2023-03-14 10:29:04] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-14 10:29:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:29:04] [INFO ] Invariant cache hit.
[2023-03-14 10:29:05] [INFO ] Dead Transitions using invariants and state equation in 1338 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3339 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-12 in 19991 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-15
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:29:05] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10201 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1700 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-14 10:29:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:29:05] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-14 10:29:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:29:06] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2023-03-14 10:29:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:29:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 10:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:29:06] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2023-03-14 10:29:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:29:06] [INFO ] [Nat]Added 283 Read/Feed constraints in 199 ms returned sat
[2023-03-14 10:29:07] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-14 10:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 489 ms
[2023-03-14 10:29:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 343 ms.
[2023-03-14 10:29:08] [INFO ] Added : 5 causal constraints over 1 iterations in 781 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 77 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:29:08] [INFO ] Computed 8 place invariants in 23 ms
Incomplete random walk after 1000232 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1770 ms. (steps per millisecond=564 ) properties (out of 1) seen :0
[2023-03-14 10:29:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 10:29:10] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-14 10:29:10] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 10:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:29:11] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2023-03-14 10:29:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:29:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 10:29:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:29:12] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2023-03-14 10:29:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:29:12] [INFO ] [Nat]Added 283 Read/Feed constraints in 210 ms returned sat
[2023-03-14 10:29:12] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 0 ms to minimize.
[2023-03-14 10:29:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 469 ms
[2023-03-14 10:29:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 318 ms.
[2023-03-14 10:29:13] [INFO ] Added : 5 causal constraints over 1 iterations in 680 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 10:29:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:29:13] [INFO ] Invariant cache hit.
[2023-03-14 10:29:14] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-14 10:29:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:29:14] [INFO ] Invariant cache hit.
[2023-03-14 10:29:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 10:29:16] [INFO ] Implicit Places using invariants and state equation in 2062 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2023-03-14 10:29:16] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-14 10:29:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 10:29:16] [INFO ] Invariant cache hit.
[2023-03-14 10:29:17] [INFO ] Dead Transitions using invariants and state equation in 1147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3893 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-15 in 12168 ms.
[2023-03-14 10:29:18] [INFO ] Flatten gal took : 354 ms
[2023-03-14 10:29:18] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-14 10:29:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 16 ms.
Total runtime 137526 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q8m256
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 269 places, 3871 transitions, 19045 arcs.
Final Score: 52463.031
Took : 78 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678792430289

--------------------
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
ERROR:
Generation failed in Meddly with error code:
Insufficient memory
within model automodel instantiated in file model.sm near line 23213
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 962 Segmentation fault ${SMART}/smart ${INPUT_SM}

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-q8m256"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BugTracking-PT-q8m256, 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 r043-tajo-167813696800445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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