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-167813696800397.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-q8m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696800397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K 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:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678787158347

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-q8m004
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 09:46:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 09:46:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:46:01] [INFO ] Load time of PNML (sax parser for PT used): 759 ms
[2023-03-14 09:46:01] [INFO ] Transformed 754 places.
[2023-03-14 09:46:01] [INFO ] Transformed 27370 transitions.
[2023-03-14 09:46:01] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1002 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 474 places in 129 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 09:46:01] [INFO ] Computed 10 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 116 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 6) seen :4
FORMULA BugTracking-PT-q8m004-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
[2023-03-14 09:46:02] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 09:46:02] [INFO ] Computed 10 place invariants in 31 ms
[2023-03-14 09:46:02] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:03] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2023-03-14 09:46:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:46:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:04] [INFO ] [Nat]Absence check using state equation in 856 ms returned sat
[2023-03-14 09:46:04] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-14 09:46:04] [INFO ] [Nat]Added 303 Read/Feed constraints in 244 ms returned sat
[2023-03-14 09:46:06] [INFO ] Deduced a trap composed of 61 places in 1267 ms of which 35 ms to minimize.
[2023-03-14 09:46:06] [INFO ] Deduced a trap composed of 57 places in 470 ms of which 1 ms to minimize.
[2023-03-14 09:46:07] [INFO ] Deduced a trap composed of 58 places in 622 ms of which 1 ms to minimize.
[2023-03-14 09:46:08] [INFO ] Deduced a trap composed of 47 places in 699 ms of which 4 ms to minimize.
[2023-03-14 09:46:09] [INFO ] Deduced a trap composed of 53 places in 818 ms of which 2 ms to minimize.
[2023-03-14 09:46:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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 09:46:09] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:10] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2023-03-14 09:46:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:46:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:10] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2023-03-14 09:46:11] [INFO ] [Nat]Added 303 Read/Feed constraints in 342 ms returned sat
[2023-03-14 09:46:11] [INFO ] Deduced a trap composed of 23 places in 448 ms of which 2 ms to minimize.
[2023-03-14 09:46:12] [INFO ] Deduced a trap composed of 15 places in 528 ms of which 1 ms to minimize.
[2023-03-14 09:46:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1293 ms
[2023-03-14 09:46:13] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 429 ms.
[2023-03-14 09:46:13] [INFO ] Added : 11 causal constraints over 3 iterations in 1167 ms. Result :sat
[2023-03-14 09:46:14] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:14] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2023-03-14 09:46:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:15] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2023-03-14 09:46:15] [INFO ] [Nat]Added 303 Read/Feed constraints in 236 ms returned sat
[2023-03-14 09:46:16] [INFO ] Deduced a trap composed of 31 places in 505 ms of which 1 ms to minimize.
[2023-03-14 09:46:16] [INFO ] Deduced a trap composed of 37 places in 384 ms of which 0 ms to minimize.
[2023-03-14 09:46:17] [INFO ] Deduced a trap composed of 19 places in 641 ms of which 1 ms to minimize.
[2023-03-14 09:46:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1901 ms
[2023-03-14 09:46:18] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 552 ms.
[2023-03-14 09:46:18] [INFO ] Added : 6 causal constraints over 2 iterations in 1077 ms. Result :sat
[2023-03-14 09:46:19] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:19] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2023-03-14 09:46:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-14 09:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:20] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2023-03-14 09:46:20] [INFO ] [Nat]Added 303 Read/Feed constraints in 106 ms returned sat
[2023-03-14 09:46:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 323 ms.
[2023-03-14 09:46:21] [INFO ] Added : 6 causal constraints over 2 iterations in 1058 ms. Result :sat
[2023-03-14 09:46:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:22] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2023-03-14 09:46:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:23] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-14 09:46:23] [INFO ] [Nat]Added 303 Read/Feed constraints in 285 ms returned sat
[2023-03-14 09:46:24] [INFO ] Deduced a trap composed of 31 places in 663 ms of which 2 ms to minimize.
[2023-03-14 09:46:25] [INFO ] Deduced a trap composed of 14 places in 456 ms of which 0 ms to minimize.
[2023-03-14 09:46:25] [INFO ] Deduced a trap composed of 57 places in 472 ms of which 1 ms to minimize.
[2023-03-14 09:46:26] [INFO ] Deduced a trap composed of 95 places in 575 ms of which 0 ms to minimize.
[2023-03-14 09:46:26] [INFO ] Deduced a trap composed of 64 places in 480 ms of which 0 ms to minimize.
[2023-03-14 09:46:27] [INFO ] Deduced a trap composed of 82 places in 546 ms of which 1 ms to minimize.
[2023-03-14 09:46:28] [INFO ] Deduced a trap composed of 15 places in 771 ms of which 0 ms to minimize.
[2023-03-14 09:46:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 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.21 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 16 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 580 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 581 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 09:46:29] [INFO ] Computed 8 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5832 ms. (steps per millisecond=171 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2074 ms. (steps per millisecond=482 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1892 ms. (steps per millisecond=528 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2191 ms. (steps per millisecond=456 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2212 ms. (steps per millisecond=452 ) properties (out of 5) seen :0
[2023-03-14 09:46:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:46:45] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-14 09:46:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:46] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2023-03-14 09:46:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:47] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2023-03-14 09:46:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:46:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 232 ms returned sat
[2023-03-14 09:46:47] [INFO ] Deduced a trap composed of 17 places in 404 ms of which 0 ms to minimize.
[2023-03-14 09:46:48] [INFO ] Deduced a trap composed of 26 places in 479 ms of which 0 ms to minimize.
[2023-03-14 09:46:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1180 ms
[2023-03-14 09:46:48] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 367 ms.
[2023-03-14 09:46:49] [INFO ] Added : 2 causal constraints over 1 iterations in 763 ms. Result :sat
[2023-03-14 09:46:49] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-14 09:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:50] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2023-03-14 09:46:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-14 09:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:51] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2023-03-14 09:46:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 201 ms returned sat
[2023-03-14 09:46:51] [INFO ] Deduced a trap composed of 57 places in 292 ms of which 0 ms to minimize.
[2023-03-14 09:46:52] [INFO ] Deduced a trap composed of 10 places in 311 ms of which 1 ms to minimize.
[2023-03-14 09:46:52] [INFO ] Deduced a trap composed of 54 places in 305 ms of which 1 ms to minimize.
[2023-03-14 09:46:53] [INFO ] Deduced a trap composed of 55 places in 501 ms of which 0 ms to minimize.
[2023-03-14 09:46:53] [INFO ] Deduced a trap composed of 54 places in 295 ms of which 0 ms to minimize.
[2023-03-14 09:46:54] [INFO ] Deduced a trap composed of 68 places in 267 ms of which 1 ms to minimize.
[2023-03-14 09:46:54] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 1 ms to minimize.
[2023-03-14 09:46:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2822 ms
[2023-03-14 09:46:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 267 ms.
[2023-03-14 09:46:55] [INFO ] Added : 5 causal constraints over 1 iterations in 679 ms. Result :sat
[2023-03-14 09:46:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:55] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2023-03-14 09:46:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-14 09:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:56] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2023-03-14 09:46:56] [INFO ] [Nat]Added 283 Read/Feed constraints in 238 ms returned sat
[2023-03-14 09:46:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 298 ms.
[2023-03-14 09:46:57] [INFO ] Added : 4 causal constraints over 1 iterations in 723 ms. Result :sat
[2023-03-14 09:46:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:58] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2023-03-14 09:46:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:46:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:46:59] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2023-03-14 09:46:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 303 ms returned sat
[2023-03-14 09:47:00] [INFO ] Deduced a trap composed of 40 places in 451 ms of which 0 ms to minimize.
[2023-03-14 09:47:00] [INFO ] Deduced a trap composed of 54 places in 401 ms of which 6 ms to minimize.
[2023-03-14 09:47:01] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 1 ms to minimize.
[2023-03-14 09:47:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1721 ms
[2023-03-14 09:47:01] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 334 ms.
[2023-03-14 09:47:02] [INFO ] Deduced a trap composed of 10 places in 413 ms of which 1 ms to minimize.
[2023-03-14 09:47:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 665 ms
[2023-03-14 09:47:02] [INFO ] Added : 6 causal constraints over 2 iterations in 1690 ms. Result :sat
[2023-03-14 09:47:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:03] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2023-03-14 09:47:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:47:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-14 09:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:04] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2023-03-14 09:47:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 357 ms returned sat
[2023-03-14 09:47:05] [INFO ] Deduced a trap composed of 31 places in 503 ms of which 1 ms to minimize.
[2023-03-14 09:47:06] [INFO ] Deduced a trap composed of 28 places in 441 ms of which 1 ms to minimize.
[2023-03-14 09:47:06] [INFO ] Deduced a trap composed of 99 places in 461 ms of which 0 ms to minimize.
[2023-03-14 09:47:07] [INFO ] Deduced a trap composed of 39 places in 369 ms of which 13 ms to minimize.
[2023-03-14 09:47:07] [INFO ] Deduced a trap composed of 91 places in 469 ms of which 4 ms to minimize.
[2023-03-14 09:47:08] [INFO ] Deduced a trap composed of 95 places in 473 ms of which 0 ms to minimize.
[2023-03-14 09:47:09] [INFO ] Deduced a trap composed of 76 places in 436 ms of which 1 ms to minimize.
[2023-03-14 09:47:09] [INFO ] Deduced a trap composed of 44 places in 682 ms of which 0 ms to minimize.
[2023-03-14 09:47:10] [INFO ] Deduced a trap composed of 68 places in 343 ms of which 0 ms to minimize.
[2023-03-14 09:47:10] [INFO ] Deduced a trap composed of 23 places in 449 ms of which 1 ms to minimize.
[2023-03-14 09:47:11] [INFO ] Deduced a trap composed of 47 places in 384 ms of which 1 ms to minimize.
[2023-03-14 09:47:11] [INFO ] Deduced a trap composed of 62 places in 382 ms of which 0 ms to minimize.
[2023-03-14 09:47:12] [INFO ] Deduced a trap composed of 90 places in 469 ms of which 0 ms to minimize.
[2023-03-14 09:47:13] [INFO ] Deduced a trap composed of 42 places in 421 ms of which 1 ms to minimize.
[2023-03-14 09:47:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 8198 ms
[2023-03-14 09:47:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 331 ms.
[2023-03-14 09:47:14] [INFO ] Deduced a trap composed of 54 places in 392 ms of which 0 ms to minimize.
[2023-03-14 09:47:15] [INFO ] Deduced a trap composed of 69 places in 381 ms of which 1 ms to minimize.
[2023-03-14 09:47:15] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 1 ms to minimize.
[2023-03-14 09:47:16] [INFO ] Deduced a trap composed of 57 places in 354 ms of which 0 ms to minimize.
[2023-03-14 09:47:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2299 ms
[2023-03-14 09:47:16] [INFO ] Added : 8 causal constraints over 3 iterations in 3537 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 81 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 81 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 78 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:47:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:47:17] [INFO ] Invariant cache hit.
[2023-03-14 09:47:17] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-14 09:47:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:47:17] [INFO ] Invariant cache hit.
[2023-03-14 09:47:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:47:20] [INFO ] Implicit Places using invariants and state equation in 2341 ms returned []
Implicit Place search using SMT with State Equation took 2965 ms to find 0 implicit places.
[2023-03-14 09:47:20] [INFO ] Redundant transitions in 344 ms returned []
[2023-03-14 09:47:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:47:20] [INFO ] Invariant cache hit.
[2023-03-14 09:47:21] [INFO ] Dead Transitions using invariants and state equation in 1295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4689 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:47:21] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) 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 09:47:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:47:21] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-14 09:47:21] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:22] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-14 09:47:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:47:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:22] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2023-03-14 09:47:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:47:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 173 ms returned sat
[2023-03-14 09:47:23] [INFO ] Deduced a trap composed of 17 places in 454 ms of which 1 ms to minimize.
[2023-03-14 09:47:24] [INFO ] Deduced a trap composed of 26 places in 440 ms of which 1 ms to minimize.
[2023-03-14 09:47:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1224 ms
[2023-03-14 09:47:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 335 ms.
[2023-03-14 09:47:25] [INFO ] Added : 2 causal constraints over 1 iterations in 720 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 73 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 09:47:25] [INFO ] Computed 8 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5679 ms. (steps per millisecond=176 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1848 ms. (steps per millisecond=541 ) properties (out of 1) seen :0
[2023-03-14 09:47:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:47:32] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-14 09:47:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:33] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2023-03-14 09:47:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:47:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:34] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2023-03-14 09:47:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:47:34] [INFO ] [Nat]Added 283 Read/Feed constraints in 194 ms returned sat
[2023-03-14 09:47:34] [INFO ] Deduced a trap composed of 17 places in 377 ms of which 13 ms to minimize.
[2023-03-14 09:47:35] [INFO ] Deduced a trap composed of 26 places in 329 ms of which 0 ms to minimize.
[2023-03-14 09:47:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 943 ms
[2023-03-14 09:47:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 258 ms.
[2023-03-14 09:47:36] [INFO ] Added : 2 causal constraints over 1 iterations in 653 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 64 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 64 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 09:47:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:47:36] [INFO ] Invariant cache hit.
[2023-03-14 09:47:36] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-14 09:47:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:47:36] [INFO ] Invariant cache hit.
[2023-03-14 09:47:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:47:38] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
[2023-03-14 09:47:38] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-14 09:47:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:47:38] [INFO ] Invariant cache hit.
[2023-03-14 09:47:39] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3561 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-01 in 18021 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:47:39] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2023-03-14 09:47:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:47:39] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-14 09:47:40] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:40] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-14 09:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:47:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:41] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2023-03-14 09:47:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:47:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 228 ms returned sat
[2023-03-14 09:47:41] [INFO ] Deduced a trap composed of 57 places in 268 ms of which 0 ms to minimize.
[2023-03-14 09:47:42] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 0 ms to minimize.
[2023-03-14 09:47:42] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 1 ms to minimize.
[2023-03-14 09:47:42] [INFO ] Deduced a trap composed of 55 places in 290 ms of which 0 ms to minimize.
[2023-03-14 09:47:43] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 0 ms to minimize.
[2023-03-14 09:47:43] [INFO ] Deduced a trap composed of 68 places in 286 ms of which 0 ms to minimize.
[2023-03-14 09:47:44] [INFO ] Deduced a trap composed of 54 places in 305 ms of which 0 ms to minimize.
[2023-03-14 09:47:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2665 ms
[2023-03-14 09:47:44] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 339 ms.
[2023-03-14 09:47:44] [INFO ] Added : 5 causal constraints over 1 iterations in 795 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 84 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.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:47:45] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5999 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1888 ms. (steps per millisecond=529 ) properties (out of 1) seen :0
[2023-03-14 09:47:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:47:53] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-14 09:47:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:47:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:53] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2023-03-14 09:47:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:47:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:47:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:47:54] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2023-03-14 09:47:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:47:54] [INFO ] [Nat]Added 283 Read/Feed constraints in 186 ms returned sat
[2023-03-14 09:47:55] [INFO ] Deduced a trap composed of 57 places in 542 ms of which 1 ms to minimize.
[2023-03-14 09:47:55] [INFO ] Deduced a trap composed of 10 places in 393 ms of which 1 ms to minimize.
[2023-03-14 09:47:56] [INFO ] Deduced a trap composed of 54 places in 384 ms of which 1 ms to minimize.
[2023-03-14 09:47:56] [INFO ] Deduced a trap composed of 55 places in 382 ms of which 0 ms to minimize.
[2023-03-14 09:47:57] [INFO ] Deduced a trap composed of 54 places in 395 ms of which 1 ms to minimize.
[2023-03-14 09:47:57] [INFO ] Deduced a trap composed of 68 places in 392 ms of which 1 ms to minimize.
[2023-03-14 09:47:58] [INFO ] Deduced a trap composed of 54 places in 377 ms of which 1 ms to minimize.
[2023-03-14 09:47:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3650 ms
[2023-03-14 09:47:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 312 ms.
[2023-03-14 09:47:58] [INFO ] Added : 5 causal constraints over 1 iterations in 759 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 98 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.
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.
[2023-03-14 09:47:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:47:59] [INFO ] Invariant cache hit.
[2023-03-14 09:47:59] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-14 09:47:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:47:59] [INFO ] Invariant cache hit.
[2023-03-14 09:48:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:01] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2023-03-14 09:48:01] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-14 09:48:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:48:01] [INFO ] Invariant cache hit.
[2023-03-14 09:48:02] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3356 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-08 in 22783 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-10
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:02] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2023-03-14 09:48:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:02] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-14 09:48:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:03] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2023-03-14 09:48:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:48:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:03] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2023-03-14 09:48:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 266 ms returned sat
[2023-03-14 09:48:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 317 ms.
[2023-03-14 09:48:05] [INFO ] Added : 4 causal constraints over 1 iterations in 745 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 63 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 65 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 09:48:05] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 4651 ms. (steps per millisecond=215 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1768 ms. (steps per millisecond=565 ) properties (out of 1) seen :0
[2023-03-14 09:48:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:11] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-14 09:48:11] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:12] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2023-03-14 09:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:48:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:13] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2023-03-14 09:48:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 219 ms returned sat
[2023-03-14 09:48:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 327 ms.
[2023-03-14 09:48:14] [INFO ] Added : 4 causal constraints over 1 iterations in 741 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 65 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 66 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 95 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:48:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:48:14] [INFO ] Invariant cache hit.
[2023-03-14 09:48:15] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-14 09:48:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:48:15] [INFO ] Invariant cache hit.
[2023-03-14 09:48:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:16] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2244 ms to find 0 implicit places.
[2023-03-14 09:48:16] [INFO ] Redundant transitions in 162 ms returned []
[2023-03-14 09:48:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:48:16] [INFO ] Invariant cache hit.
[2023-03-14 09:48:18] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3649 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-10 in 15470 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:18] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2023-03-14 09:48:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:18] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-14 09:48:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:18] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-14 09:48:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:48:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:48:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:19] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2023-03-14 09:48:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:19] [INFO ] [Nat]Added 283 Read/Feed constraints in 229 ms returned sat
[2023-03-14 09:48:20] [INFO ] Deduced a trap composed of 40 places in 470 ms of which 2 ms to minimize.
[2023-03-14 09:48:20] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 1 ms to minimize.
[2023-03-14 09:48:21] [INFO ] Deduced a trap composed of 17 places in 388 ms of which 14 ms to minimize.
[2023-03-14 09:48:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1582 ms
[2023-03-14 09:48:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 371 ms.
[2023-03-14 09:48:22] [INFO ] Deduced a trap composed of 10 places in 356 ms of which 0 ms to minimize.
[2023-03-14 09:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 573 ms
[2023-03-14 09:48:23] [INFO ] Added : 6 causal constraints over 2 iterations in 1559 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 53 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 55 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 09:48:23] [INFO ] Computed 8 place invariants in 23 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 4495 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1668 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
[2023-03-14 09:48:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:29] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-14 09:48:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:30] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2023-03-14 09:48:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:48:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:30] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2023-03-14 09:48:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 301 ms returned sat
[2023-03-14 09:48:31] [INFO ] Deduced a trap composed of 40 places in 554 ms of which 0 ms to minimize.
[2023-03-14 09:48:32] [INFO ] Deduced a trap composed of 54 places in 495 ms of which 0 ms to minimize.
[2023-03-14 09:48:33] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 0 ms to minimize.
[2023-03-14 09:48:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1995 ms
[2023-03-14 09:48:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 273 ms.
[2023-03-14 09:48:34] [INFO ] Deduced a trap composed of 10 places in 700 ms of which 1 ms to minimize.
[2023-03-14 09:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 947 ms
[2023-03-14 09:48:35] [INFO ] Added : 6 causal constraints over 2 iterations in 1921 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 107 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 107 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 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:48:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:48:35] [INFO ] Invariant cache hit.
[2023-03-14 09:48:36] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-14 09:48:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:48:36] [INFO ] Invariant cache hit.
[2023-03-14 09:48:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:37] [INFO ] Implicit Places using invariants and state equation in 1854 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
[2023-03-14 09:48:38] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-14 09:48:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:48:38] [INFO ] Invariant cache hit.
[2023-03-14 09:48:39] [INFO ] Dead Transitions using invariants and state equation in 1274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3800 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-11 in 21256 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:39] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-14 09:48:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:39] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-14 09:48:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:40] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2023-03-14 09:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:48:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:40] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-14 09:48:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 237 ms returned sat
[2023-03-14 09:48:41] [INFO ] Deduced a trap composed of 31 places in 506 ms of which 0 ms to minimize.
[2023-03-14 09:48:41] [INFO ] Deduced a trap composed of 28 places in 391 ms of which 0 ms to minimize.
[2023-03-14 09:48:42] [INFO ] Deduced a trap composed of 99 places in 450 ms of which 0 ms to minimize.
[2023-03-14 09:48:42] [INFO ] Deduced a trap composed of 39 places in 390 ms of which 0 ms to minimize.
[2023-03-14 09:48:43] [INFO ] Deduced a trap composed of 91 places in 458 ms of which 1 ms to minimize.
[2023-03-14 09:48:43] [INFO ] Deduced a trap composed of 95 places in 420 ms of which 0 ms to minimize.
[2023-03-14 09:48:44] [INFO ] Deduced a trap composed of 76 places in 372 ms of which 0 ms to minimize.
[2023-03-14 09:48:44] [INFO ] Deduced a trap composed of 44 places in 377 ms of which 1 ms to minimize.
[2023-03-14 09:48:45] [INFO ] Deduced a trap composed of 7 places in 839 ms of which 0 ms to minimize.
[2023-03-14 09:48:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 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 09:48:46] [INFO ] Computed 8 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5251 ms. (steps per millisecond=190 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 1) seen :0
[2023-03-14 09:48:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:48:53] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-14 09:48:53] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:54] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2023-03-14 09:48:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:48:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:48:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:48:55] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2023-03-14 09:48:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:48:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 409 ms returned sat
[2023-03-14 09:48:56] [INFO ] Deduced a trap composed of 31 places in 481 ms of which 0 ms to minimize.
[2023-03-14 09:48:56] [INFO ] Deduced a trap composed of 28 places in 637 ms of which 1 ms to minimize.
[2023-03-14 09:48:57] [INFO ] Deduced a trap composed of 99 places in 620 ms of which 1 ms to minimize.
[2023-03-14 09:48:58] [INFO ] Deduced a trap composed of 39 places in 420 ms of which 0 ms to minimize.
[2023-03-14 09:48:59] [INFO ] Deduced a trap composed of 91 places in 600 ms of which 1 ms to minimize.
[2023-03-14 09:48:59] [INFO ] Deduced a trap composed of 95 places in 593 ms of which 0 ms to minimize.
[2023-03-14 09:49:00] [INFO ] Deduced a trap composed of 76 places in 554 ms of which 1 ms to minimize.
[2023-03-14 09:49:01] [INFO ] Deduced a trap composed of 44 places in 549 ms of which 0 ms to minimize.
[2023-03-14 09:49:01] [INFO ] Deduced a trap composed of 68 places in 468 ms of which 0 ms to minimize.
[2023-03-14 09:49:02] [INFO ] Deduced a trap composed of 23 places in 561 ms of which 0 ms to minimize.
[2023-03-14 09:49:03] [INFO ] Deduced a trap composed of 47 places in 477 ms of which 0 ms to minimize.
[2023-03-14 09:49:03] [INFO ] Deduced a trap composed of 62 places in 481 ms of which 0 ms to minimize.
[2023-03-14 09:49:04] [INFO ] Deduced a trap composed of 90 places in 561 ms of which 1 ms to minimize.
[2023-03-14 09:49:04] [INFO ] Deduced a trap composed of 42 places in 557 ms of which 1 ms to minimize.
[2023-03-14 09:49:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 9358 ms
[2023-03-14 09:49:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 261 ms.
[2023-03-14 09:49:06] [INFO ] Deduced a trap composed of 54 places in 420 ms of which 0 ms to minimize.
[2023-03-14 09:49:06] [INFO ] Deduced a trap composed of 69 places in 557 ms of which 0 ms to minimize.
[2023-03-14 09:49:07] [INFO ] Deduced a trap composed of 36 places in 456 ms of which 0 ms to minimize.
[2023-03-14 09:49:08] [INFO ] Deduced a trap composed of 57 places in 388 ms of which 0 ms to minimize.
[2023-03-14 09:49:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2508 ms
[2023-03-14 09:49:08] [INFO ] Added : 8 causal constraints over 3 iterations in 3616 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 69 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 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:49:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:49:08] [INFO ] Invariant cache hit.
[2023-03-14 09:49:09] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-14 09:49:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:49:09] [INFO ] Invariant cache hit.
[2023-03-14 09:49:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:49:11] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 2606 ms to find 0 implicit places.
[2023-03-14 09:49:11] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-14 09:49:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:49:11] [INFO ] Invariant cache hit.
[2023-03-14 09:49:12] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3985 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-13 in 33540 ms.
[2023-03-14 09:49:13] [INFO ] Flatten gal took : 302 ms
[2023-03-14 09:49:13] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-14 09:49:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 17 ms.
Total runtime 193029 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q8m004
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: 50549.497
Took : 90 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678788375968

--------------------
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: 1051 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-q8m004"
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-q8m004, 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-167813696800397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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