About the Execution of LTSMin+red for BugTracking-PT-q8m004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1123.752 | 3600000.00 | 13886978.00 | 173.80 | 0 ? 0 0 0 0 0 4 ? 0 ? 1 0 ? 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694600397.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q8m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600397
=====================================================================
--------------------
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 1678633956483
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:12:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 15:12:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:12:39] [INFO ] Load time of PNML (sax parser for PT used): 769 ms
[2023-03-12 15:12:39] [INFO ] Transformed 754 places.
[2023-03-12 15:12:39] [INFO ] Transformed 27370 transitions.
[2023-03-12 15:12:39] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 946 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 474 places in 111 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-12 15:12:39] [INFO ] Computed 10 place invariants in 63 ms
Incomplete random walk after 10001 steps, including 119 resets, run finished after 153 ms. (steps per millisecond=65 ) 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 21 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
[2023-03-12 15:12:39] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-12 15:12:39] [INFO ] Computed 10 place invariants in 44 ms
[2023-03-12 15:12:40] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-12 15:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:40] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2023-03-12 15:12:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:12:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 15:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:41] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-12 15:12:41] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 15:12:41] [INFO ] [Nat]Added 303 Read/Feed constraints in 212 ms returned sat
[2023-03-12 15:12:42] [INFO ] Deduced a trap composed of 61 places in 503 ms of which 6 ms to minimize.
[2023-03-12 15:12:42] [INFO ] Deduced a trap composed of 57 places in 539 ms of which 1 ms to minimize.
[2023-03-12 15:12:43] [INFO ] Deduced a trap composed of 58 places in 592 ms of which 2 ms to minimize.
[2023-03-12 15:12:44] [INFO ] Deduced a trap composed of 47 places in 562 ms of which 3 ms to minimize.
[2023-03-12 15:12:44] [INFO ] Deduced a trap composed of 53 places in 528 ms of which 1 ms to minimize.
[2023-03-12 15:12:45] [INFO ] Deduced a trap composed of 40 places in 541 ms of which 0 ms to minimize.
[2023-03-12 15:12:46] [INFO ] Deduced a trap composed of 15 places in 500 ms of which 0 ms to minimize.
[2023-03-12 15:12:46] [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-12 15:12:46] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 15:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:46] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-12 15:12:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:12:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 15:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:47] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-12 15:12:47] [INFO ] [Nat]Added 303 Read/Feed constraints in 262 ms returned sat
[2023-03-12 15:12:48] [INFO ] Deduced a trap composed of 23 places in 387 ms of which 2 ms to minimize.
[2023-03-12 15:12:48] [INFO ] Deduced a trap composed of 15 places in 319 ms of which 3 ms to minimize.
[2023-03-12 15:12:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 968 ms
[2023-03-12 15:12:49] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 402 ms.
[2023-03-12 15:12:49] [INFO ] Added : 11 causal constraints over 3 iterations in 1079 ms. Result :sat
[2023-03-12 15:12:50] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 15:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:50] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-12 15:12:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:12:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 15:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:51] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2023-03-12 15:12:51] [INFO ] [Nat]Added 303 Read/Feed constraints in 149 ms returned sat
[2023-03-12 15:12:51] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 0 ms to minimize.
[2023-03-12 15:12:52] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 0 ms to minimize.
[2023-03-12 15:12:52] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 1 ms to minimize.
[2023-03-12 15:12:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1179 ms
[2023-03-12 15:12:52] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 311 ms.
[2023-03-12 15:12:53] [INFO ] Added : 6 causal constraints over 2 iterations in 709 ms. Result :sat
[2023-03-12 15:12:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 15:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:53] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-12 15:12:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:12:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 15:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:54] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2023-03-12 15:12:54] [INFO ] [Nat]Added 303 Read/Feed constraints in 57 ms returned sat
[2023-03-12 15:12:54] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 246 ms.
[2023-03-12 15:12:55] [INFO ] Added : 6 causal constraints over 2 iterations in 704 ms. Result :sat
[2023-03-12 15:12:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 15:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:55] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-12 15:12:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:12:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 15:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:12:56] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-12 15:12:56] [INFO ] [Nat]Added 303 Read/Feed constraints in 299 ms returned sat
[2023-03-12 15:12:57] [INFO ] Deduced a trap composed of 31 places in 526 ms of which 1 ms to minimize.
[2023-03-12 15:12:57] [INFO ] Deduced a trap composed of 14 places in 462 ms of which 1 ms to minimize.
[2023-03-12 15:12:58] [INFO ] Deduced a trap composed of 57 places in 471 ms of which 1 ms to minimize.
[2023-03-12 15:12:58] [INFO ] Deduced a trap composed of 95 places in 474 ms of which 0 ms to minimize.
[2023-03-12 15:12:59] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 0 ms to minimize.
[2023-03-12 15:12:59] [INFO ] Deduced a trap composed of 82 places in 343 ms of which 1 ms to minimize.
[2023-03-12 15:13:00] [INFO ] Deduced a trap composed of 62 places in 383 ms of which 1 ms to minimize.
[2023-03-12 15:13:00] [INFO ] Deduced a trap composed of 63 places in 362 ms of which 1 ms to minimize.
[2023-03-12 15:13:01] [INFO ] Deduced a trap composed of 96 places in 444 ms of which 1 ms to minimize.
[2023-03-12 15:13:01] [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.18 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 3 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 477 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 479 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-12 15:13:02] [INFO ] Computed 8 place invariants in 42 ms
Incomplete random walk after 1000003 steps, including 3 resets, run finished after 5957 ms. (steps per millisecond=167 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 1930 ms. (steps per millisecond=518 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1894 ms. (steps per millisecond=527 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2085 ms. (steps per millisecond=479 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1987 ms. (steps per millisecond=503 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1988 ms. (steps per millisecond=503 ) properties (out of 5) seen :0
[2023-03-12 15:13:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:13:18] [INFO ] Computed 8 place invariants in 31 ms
[2023-03-12 15:13:18] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:18] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2023-03-12 15:13:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:13:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:19] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2023-03-12 15:13:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:13:19] [INFO ] [Nat]Added 283 Read/Feed constraints in 221 ms returned sat
[2023-03-12 15:13:19] [INFO ] Deduced a trap composed of 17 places in 402 ms of which 0 ms to minimize.
[2023-03-12 15:13:20] [INFO ] Deduced a trap composed of 26 places in 388 ms of which 1 ms to minimize.
[2023-03-12 15:13:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 987 ms
[2023-03-12 15:13:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 218 ms.
[2023-03-12 15:13:21] [INFO ] Added : 2 causal constraints over 1 iterations in 575 ms. Result :sat
[2023-03-12 15:13:21] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-12 15:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:21] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2023-03-12 15:13:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:13:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:22] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2023-03-12 15:13:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 245 ms returned sat
[2023-03-12 15:13:23] [INFO ] Deduced a trap composed of 57 places in 314 ms of which 1 ms to minimize.
[2023-03-12 15:13:23] [INFO ] Deduced a trap composed of 10 places in 284 ms of which 0 ms to minimize.
[2023-03-12 15:13:23] [INFO ] Deduced a trap composed of 54 places in 291 ms of which 0 ms to minimize.
[2023-03-12 15:13:24] [INFO ] Deduced a trap composed of 55 places in 315 ms of which 0 ms to minimize.
[2023-03-12 15:13:24] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 1 ms to minimize.
[2023-03-12 15:13:25] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 0 ms to minimize.
[2023-03-12 15:13:25] [INFO ] Deduced a trap composed of 54 places in 312 ms of which 0 ms to minimize.
[2023-03-12 15:13:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2848 ms
[2023-03-12 15:13:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 344 ms.
[2023-03-12 15:13:26] [INFO ] Added : 5 causal constraints over 1 iterations in 851 ms. Result :sat
[2023-03-12 15:13:26] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 15:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:27] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2023-03-12 15:13:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:13:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:13:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:28] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2023-03-12 15:13:28] [INFO ] [Nat]Added 283 Read/Feed constraints in 240 ms returned sat
[2023-03-12 15:13:28] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 261 ms.
[2023-03-12 15:13:29] [INFO ] Added : 4 causal constraints over 1 iterations in 632 ms. Result :sat
[2023-03-12 15:13:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:29] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2023-03-12 15:13:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:13:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:30] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2023-03-12 15:13:30] [INFO ] [Nat]Added 283 Read/Feed constraints in 271 ms returned sat
[2023-03-12 15:13:31] [INFO ] Deduced a trap composed of 40 places in 526 ms of which 1 ms to minimize.
[2023-03-12 15:13:31] [INFO ] Deduced a trap composed of 54 places in 362 ms of which 1 ms to minimize.
[2023-03-12 15:13:32] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 0 ms to minimize.
[2023-03-12 15:13:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1711 ms
[2023-03-12 15:13:32] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 299 ms.
[2023-03-12 15:13:33] [INFO ] Deduced a trap composed of 10 places in 399 ms of which 2 ms to minimize.
[2023-03-12 15:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 592 ms
[2023-03-12 15:13:34] [INFO ] Added : 6 causal constraints over 2 iterations in 1562 ms. Result :sat
[2023-03-12 15:13:34] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:34] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2023-03-12 15:13:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:13:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:35] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2023-03-12 15:13:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 300 ms returned sat
[2023-03-12 15:13:36] [INFO ] Deduced a trap composed of 31 places in 505 ms of which 5 ms to minimize.
[2023-03-12 15:13:37] [INFO ] Deduced a trap composed of 28 places in 461 ms of which 0 ms to minimize.
[2023-03-12 15:13:37] [INFO ] Deduced a trap composed of 99 places in 448 ms of which 0 ms to minimize.
[2023-03-12 15:13:38] [INFO ] Deduced a trap composed of 39 places in 411 ms of which 1 ms to minimize.
[2023-03-12 15:13:38] [INFO ] Deduced a trap composed of 91 places in 436 ms of which 1 ms to minimize.
[2023-03-12 15:13:39] [INFO ] Deduced a trap composed of 95 places in 448 ms of which 0 ms to minimize.
[2023-03-12 15:13:39] [INFO ] Deduced a trap composed of 76 places in 384 ms of which 0 ms to minimize.
[2023-03-12 15:13:40] [INFO ] Deduced a trap composed of 44 places in 420 ms of which 0 ms to minimize.
[2023-03-12 15:13:40] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 0 ms to minimize.
[2023-03-12 15:13:41] [INFO ] Deduced a trap composed of 23 places in 450 ms of which 1 ms to minimize.
[2023-03-12 15:13:41] [INFO ] Deduced a trap composed of 47 places in 346 ms of which 1 ms to minimize.
[2023-03-12 15:13:42] [INFO ] Deduced a trap composed of 62 places in 326 ms of which 1 ms to minimize.
[2023-03-12 15:13:42] [INFO ] Deduced a trap composed of 90 places in 330 ms of which 2 ms to minimize.
[2023-03-12 15:13:43] [INFO ] Deduced a trap composed of 42 places in 378 ms of which 1 ms to minimize.
[2023-03-12 15:13:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7205 ms
[2023-03-12 15:13:43] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 308 ms.
[2023-03-12 15:13:44] [INFO ] Deduced a trap composed of 54 places in 465 ms of which 0 ms to minimize.
[2023-03-12 15:13:45] [INFO ] Deduced a trap composed of 69 places in 417 ms of which 2 ms to minimize.
[2023-03-12 15:13:45] [INFO ] Deduced a trap composed of 36 places in 433 ms of which 3 ms to minimize.
[2023-03-12 15:13:46] [INFO ] Deduced a trap composed of 57 places in 395 ms of which 0 ms to minimize.
[2023-03-12 15:13:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2459 ms
[2023-03-12 15:13:46] [INFO ] Added : 8 causal constraints over 3 iterations in 3666 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 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 81 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:13:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:13:47] [INFO ] Invariant cache hit.
[2023-03-12 15:13:47] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-12 15:13:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:13:47] [INFO ] Invariant cache hit.
[2023-03-12 15:13:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:13:49] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
[2023-03-12 15:13:50] [INFO ] Redundant transitions in 354 ms returned []
[2023-03-12 15:13:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:13:50] [INFO ] Invariant cache hit.
[2023-03-12 15:13:51] [INFO ] Dead Transitions using invariants and state equation in 1250 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4112 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-12 15:13:51] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2023-03-12 15:13:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:13:51] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-12 15:13:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:52] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2023-03-12 15:13:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:13:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:13:52] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2023-03-12 15:13:52] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:13:52] [INFO ] [Nat]Added 283 Read/Feed constraints in 198 ms returned sat
[2023-03-12 15:13:53] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
[2023-03-12 15:13:53] [INFO ] Deduced a trap composed of 26 places in 375 ms of which 0 ms to minimize.
[2023-03-12 15:13:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1056 ms
[2023-03-12 15:13:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 265 ms.
[2023-03-12 15:13:54] [INFO ] Added : 2 causal constraints over 1 iterations in 647 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 61 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 62 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-12 15:13:54] [INFO ] Computed 8 place invariants in 25 ms
Incomplete random walk after 1000001 steps, including 3 resets, run finished after 5705 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2006 ms. (steps per millisecond=498 ) properties (out of 1) seen :0
[2023-03-12 15:14:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:14:02] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-12 15:14:02] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:03] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-03-12 15:14:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:14:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:03] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2023-03-12 15:14:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 272 ms returned sat
[2023-03-12 15:14:04] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 0 ms to minimize.
[2023-03-12 15:14:04] [INFO ] Deduced a trap composed of 26 places in 395 ms of which 4 ms to minimize.
[2023-03-12 15:14:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1026 ms
[2023-03-12 15:14:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 249 ms.
[2023-03-12 15:14:05] [INFO ] Added : 2 causal constraints over 1 iterations in 599 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 54 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 54 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 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:14:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:05] [INFO ] Invariant cache hit.
[2023-03-12 15:14:06] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-12 15:14:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:06] [INFO ] Invariant cache hit.
[2023-03-12 15:14:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:08] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 2713 ms to find 0 implicit places.
[2023-03-12 15:14:08] [INFO ] Redundant transitions in 228 ms returned []
[2023-03-12 15:14:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:08] [INFO ] Invariant cache hit.
[2023-03-12 15:14:09] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4150 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-01 in 18660 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-12 15:14:10] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-12 15:14:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:14:10] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-12 15:14:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:10] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2023-03-12 15:14:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:14:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:14:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:11] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2023-03-12 15:14:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:11] [INFO ] [Nat]Added 283 Read/Feed constraints in 210 ms returned sat
[2023-03-12 15:14:12] [INFO ] Deduced a trap composed of 57 places in 338 ms of which 1 ms to minimize.
[2023-03-12 15:14:12] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 0 ms to minimize.
[2023-03-12 15:14:12] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 0 ms to minimize.
[2023-03-12 15:14:13] [INFO ] Deduced a trap composed of 55 places in 280 ms of which 0 ms to minimize.
[2023-03-12 15:14:13] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 3 ms to minimize.
[2023-03-12 15:14:13] [INFO ] Deduced a trap composed of 68 places in 272 ms of which 0 ms to minimize.
[2023-03-12 15:14:14] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 0 ms to minimize.
[2023-03-12 15:14:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2813 ms
[2023-03-12 15:14:14] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 312 ms.
[2023-03-12 15:14:15] [INFO ] Added : 5 causal constraints over 1 iterations in 711 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-12 15:14:15] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 5708 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1926 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
[2023-03-12 15:14:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:14:23] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-12 15:14:23] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:23] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2023-03-12 15:14:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:14:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:14:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:24] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2023-03-12 15:14:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 241 ms returned sat
[2023-03-12 15:14:24] [INFO ] Deduced a trap composed of 57 places in 285 ms of which 0 ms to minimize.
[2023-03-12 15:14:25] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 1 ms to minimize.
[2023-03-12 15:14:25] [INFO ] Deduced a trap composed of 54 places in 303 ms of which 0 ms to minimize.
[2023-03-12 15:14:26] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 3 ms to minimize.
[2023-03-12 15:14:26] [INFO ] Deduced a trap composed of 54 places in 331 ms of which 4 ms to minimize.
[2023-03-12 15:14:27] [INFO ] Deduced a trap composed of 68 places in 316 ms of which 1 ms to minimize.
[2023-03-12 15:14:27] [INFO ] Deduced a trap composed of 54 places in 291 ms of which 0 ms to minimize.
[2023-03-12 15:14:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2983 ms
[2023-03-12 15:14:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 282 ms.
[2023-03-12 15:14:28] [INFO ] Added : 5 causal constraints over 1 iterations in 659 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 86 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 72 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:14:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:28] [INFO ] Invariant cache hit.
[2023-03-12 15:14:28] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-12 15:14:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:28] [INFO ] Invariant cache hit.
[2023-03-12 15:14:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:30] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 2348 ms to find 0 implicit places.
[2023-03-12 15:14:31] [INFO ] Redundant transitions in 155 ms returned []
[2023-03-12 15:14:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:31] [INFO ] Invariant cache hit.
[2023-03-12 15:14:32] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3835 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-08 in 22294 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-12 15:14:32] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2023-03-12 15:14:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:14:32] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-12 15:14:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:33] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2023-03-12 15:14:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:14:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:33] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2023-03-12 15:14:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:33] [INFO ] [Nat]Added 283 Read/Feed constraints in 215 ms returned sat
[2023-03-12 15:14:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 348 ms.
[2023-03-12 15:14:34] [INFO ] Added : 4 causal constraints over 1 iterations in 709 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 86 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-12 15:14:34] [INFO ] Computed 8 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 5757 ms. (steps per millisecond=173 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2152 ms. (steps per millisecond=464 ) properties (out of 1) seen :0
[2023-03-12 15:14:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:14:42] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:14:42] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:43] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2023-03-12 15:14:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:14:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:44] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2023-03-12 15:14:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 220 ms returned sat
[2023-03-12 15:14:44] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 355 ms.
[2023-03-12 15:14:45] [INFO ] Added : 4 causal constraints over 1 iterations in 669 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 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 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:14:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:45] [INFO ] Invariant cache hit.
[2023-03-12 15:14:45] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-12 15:14:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:45] [INFO ] Invariant cache hit.
[2023-03-12 15:14:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:47] [INFO ] Implicit Places using invariants and state equation in 1925 ms returned []
Implicit Place search using SMT with State Equation took 2378 ms to find 0 implicit places.
[2023-03-12 15:14:48] [INFO ] Redundant transitions in 192 ms returned []
[2023-03-12 15:14:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:14:48] [INFO ] Invariant cache hit.
[2023-03-12 15:14:49] [INFO ] Dead Transitions using invariants and state equation in 1304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3955 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-10 in 17136 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-12 15:14:49] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
[2023-03-12 15:14:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:14:49] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 15:14:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:50] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2023-03-12 15:14:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:14:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 15:14:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:14:50] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-12 15:14:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:14:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 244 ms returned sat
[2023-03-12 15:14:51] [INFO ] Deduced a trap composed of 40 places in 350 ms of which 0 ms to minimize.
[2023-03-12 15:14:51] [INFO ] Deduced a trap composed of 54 places in 349 ms of which 1 ms to minimize.
[2023-03-12 15:14:52] [INFO ] Deduced a trap composed of 17 places in 386 ms of which 0 ms to minimize.
[2023-03-12 15:14:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1380 ms
[2023-03-12 15:14:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 214 ms.
[2023-03-12 15:14:53] [INFO ] Deduced a trap composed of 10 places in 366 ms of which 1 ms to minimize.
[2023-03-12 15:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2023-03-12 15:14:53] [INFO ] Added : 6 causal constraints over 2 iterations in 1252 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 49 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 51 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-12 15:14:53] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 5627 ms. (steps per millisecond=177 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2370 ms. (steps per millisecond=421 ) properties (out of 1) seen :0
[2023-03-12 15:15:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:15:01] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 15:15:01] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:15:02] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2023-03-12 15:15:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:15:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:15:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:15:03] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2023-03-12 15:15:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:15:03] [INFO ] [Nat]Added 283 Read/Feed constraints in 232 ms returned sat
[2023-03-12 15:15:03] [INFO ] Deduced a trap composed of 40 places in 434 ms of which 1 ms to minimize.
[2023-03-12 15:15:04] [INFO ] Deduced a trap composed of 54 places in 299 ms of which 1 ms to minimize.
[2023-03-12 15:15:04] [INFO ] Deduced a trap composed of 17 places in 338 ms of which 0 ms to minimize.
[2023-03-12 15:15:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1367 ms
[2023-03-12 15:15:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 227 ms.
[2023-03-12 15:15:05] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 0 ms to minimize.
[2023-03-12 15:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 561 ms
[2023-03-12 15:15:06] [INFO ] Added : 6 causal constraints over 2 iterations in 1374 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA BugTracking-PT-q8m004-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-11 in 16745 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-12 15:15:06] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2023-03-12 15:15:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:15:06] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 15:15:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:15:06] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2023-03-12 15:15:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:15:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:15:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:15:07] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2023-03-12 15:15:07] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:15:07] [INFO ] [Nat]Added 283 Read/Feed constraints in 261 ms returned sat
[2023-03-12 15:15:08] [INFO ] Deduced a trap composed of 31 places in 364 ms of which 0 ms to minimize.
[2023-03-12 15:15:08] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 1 ms to minimize.
[2023-03-12 15:15:08] [INFO ] Deduced a trap composed of 99 places in 329 ms of which 1 ms to minimize.
[2023-03-12 15:15:09] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 1 ms to minimize.
[2023-03-12 15:15:09] [INFO ] Deduced a trap composed of 91 places in 298 ms of which 0 ms to minimize.
[2023-03-12 15:15:10] [INFO ] Deduced a trap composed of 95 places in 341 ms of which 0 ms to minimize.
[2023-03-12 15:15:10] [INFO ] Deduced a trap composed of 76 places in 354 ms of which 1 ms to minimize.
[2023-03-12 15:15:11] [INFO ] Deduced a trap composed of 44 places in 320 ms of which 0 ms to minimize.
[2023-03-12 15:15:11] [INFO ] Deduced a trap composed of 68 places in 276 ms of which 0 ms to minimize.
[2023-03-12 15:15:11] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 0 ms to minimize.
[2023-03-12 15:15: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 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 51 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 52 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-12 15:15:12] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 6032 ms. (steps per millisecond=165 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2274 ms. (steps per millisecond=439 ) properties (out of 1) seen :0
[2023-03-12 15:15:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:15:20] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 15:15:20] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:15:21] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2023-03-12 15:15:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:15:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:15:21] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2023-03-12 15:15:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:15:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 308 ms returned sat
[2023-03-12 15:15:22] [INFO ] Deduced a trap composed of 31 places in 441 ms of which 1 ms to minimize.
[2023-03-12 15:15:22] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 1 ms to minimize.
[2023-03-12 15:15:23] [INFO ] Deduced a trap composed of 99 places in 309 ms of which 0 ms to minimize.
[2023-03-12 15:15:23] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 0 ms to minimize.
[2023-03-12 15:15:24] [INFO ] Deduced a trap composed of 91 places in 427 ms of which 1 ms to minimize.
[2023-03-12 15:15:24] [INFO ] Deduced a trap composed of 95 places in 417 ms of which 0 ms to minimize.
[2023-03-12 15:15:25] [INFO ] Deduced a trap composed of 76 places in 360 ms of which 0 ms to minimize.
[2023-03-12 15:15:25] [INFO ] Deduced a trap composed of 44 places in 390 ms of which 1 ms to minimize.
[2023-03-12 15:15:26] [INFO ] Deduced a trap composed of 68 places in 327 ms of which 1 ms to minimize.
[2023-03-12 15:15:26] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 0 ms to minimize.
[2023-03-12 15:15:26] [INFO ] Deduced a trap composed of 47 places in 320 ms of which 0 ms to minimize.
[2023-03-12 15:15:27] [INFO ] Deduced a trap composed of 62 places in 318 ms of which 0 ms to minimize.
[2023-03-12 15:15:27] [INFO ] Deduced a trap composed of 90 places in 394 ms of which 1 ms to minimize.
[2023-03-12 15:15:28] [INFO ] Deduced a trap composed of 42 places in 375 ms of which 1 ms to minimize.
[2023-03-12 15:15:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6331 ms
[2023-03-12 15:15:28] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 233 ms.
[2023-03-12 15:15:29] [INFO ] Deduced a trap composed of 54 places in 325 ms of which 1 ms to minimize.
[2023-03-12 15:15:29] [INFO ] Deduced a trap composed of 69 places in 358 ms of which 1 ms to minimize.
[2023-03-12 15:15:30] [INFO ] Deduced a trap composed of 36 places in 433 ms of which 1 ms to minimize.
[2023-03-12 15:15:30] [INFO ] Deduced a trap composed of 57 places in 268 ms of which 0 ms to minimize.
[2023-03-12 15:15:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1919 ms
[2023-03-12 15:15:31] [INFO ] Added : 8 causal constraints over 3 iterations in 2717 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 80 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:15:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:15:31] [INFO ] Invariant cache hit.
[2023-03-12 15:15:31] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-12 15:15:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:15:31] [INFO ] Invariant cache hit.
[2023-03-12 15:15:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:15:33] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
[2023-03-12 15:15:33] [INFO ] Redundant transitions in 118 ms returned []
[2023-03-12 15:15:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:15:33] [INFO ] Invariant cache hit.
[2023-03-12 15:15:34] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3377 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-13 in 28491 ms.
[2023-03-12 15:15:35] [INFO ] Flatten gal took : 466 ms
[2023-03-12 15:15:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-12 15:15:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 24 ms.
Total runtime 177300 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1005/ub_0_ --maxsum=/tmp/1005/ub_1_ --maxsum=/tmp/1005/ub_2_ --maxsum=/tmp/1005/ub_3_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 15547648 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16081760 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-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 r041-tajo-167813694600397"
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 '
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 ;