About the Execution of 2022-gold for BugTracking-PT-q8m032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.539 | 3600000.00 | 3735943.00 | 95525.50 | ? 0 0 0 0 0 0 0 ? 0 0 1 0 ? ? 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r063-tajo-167813711600053.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 gold2022
Input is BugTracking-PT-q8m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-tajo-167813711600053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Feb 26 06:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 06:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 07:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 07:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678930771456
Running Version 202205111006
[2023-03-16 01:39:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 01:39:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:39:35] [INFO ] Load time of PNML (sax parser for PT used): 1417 ms
[2023-03-16 01:39:35] [INFO ] Transformed 754 places.
[2023-03-16 01:39:35] [INFO ] Transformed 27370 transitions.
[2023-03-16 01:39:35] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 2135 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 36 ms.
Deduced a syphon composed of 474 places in 236 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-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-16 01:39:36] [INFO ] Computed 10 place invariants in 86 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 5) seen :1
FORMULA BugTracking-PT-q8m032-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :1
[2023-03-16 01:39:36] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-16 01:39:36] [INFO ] Computed 10 place invariants in 17 ms
[2023-03-16 01:39:37] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-16 01:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:39:38] [INFO ] [Real]Absence check using state equation in 888 ms returned sat
[2023-03-16 01:39:38] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-16 01:39:38] [INFO ] [Real]Added 303 Read/Feed constraints in 122 ms returned sat
[2023-03-16 01:39:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:39:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-16 01:39:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:39:39] [INFO ] [Nat]Absence check using state equation in 886 ms returned sat
[2023-03-16 01:39:39] [INFO ] [Nat]Added 303 Read/Feed constraints in 222 ms returned sat
[2023-03-16 01:39:40] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 627 ms.
[2023-03-16 01:39:42] [INFO ] Deduced a trap composed of 57 places in 578 ms of which 17 ms to minimize.
[2023-03-16 01:39:44] [INFO ] Deduced a trap composed of 29 places in 2216 ms of which 28 ms to minimize.
[2023-03-16 01:39:44] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-16 01:39:45] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-16 01:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:39:45] [INFO ] [Real]Absence check using state equation in 972 ms returned sat
[2023-03-16 01:39:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:39:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-16 01:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:39:46] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2023-03-16 01:39:46] [INFO ] [Nat]Added 303 Read/Feed constraints in 55 ms returned sat
[2023-03-16 01:39:47] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 392 ms.
[2023-03-16 01:39:47] [INFO ] Added : 2 causal constraints over 1 iterations in 869 ms. Result :sat
[2023-03-16 01:39:48] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-16 01:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:39:49] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2023-03-16 01:39:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:39:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-16 01:39:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:39:50] [INFO ] [Nat]Absence check using state equation in 1054 ms returned sat
[2023-03-16 01:39:50] [INFO ] [Nat]Added 303 Read/Feed constraints in 231 ms returned sat
[2023-03-16 01:39:51] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 245 ms.
[2023-03-16 01:39:52] [INFO ] Deduced a trap composed of 14 places in 721 ms of which 2 ms to minimize.
[2023-03-16 01:39:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1024 ms
[2023-03-16 01:39:52] [INFO ] Added : 10 causal constraints over 3 iterations in 2055 ms. Result :sat
[2023-03-16 01:39:53] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-16 01:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:39:54] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2023-03-16 01:39:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:39:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-16 01:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:39:54] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2023-03-16 01:39:55] [INFO ] [Nat]Added 303 Read/Feed constraints in 278 ms returned sat
[2023-03-16 01:39:55] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 2 ms to minimize.
[2023-03-16 01:39:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-16 01:39:55] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 304 ms.
[2023-03-16 01:39:56] [INFO ] Added : 14 causal constraints over 3 iterations in 1170 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1] Max seen :[1, 0, 0, 0]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.47 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 583 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. 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-16 01:39:57] [INFO ] Computed 8 place invariants in 38 ms
Incomplete random walk after 1000028 steps, including 2 resets, run finished after 1393 ms. (steps per millisecond=717 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1873 ms. (steps per millisecond=533 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2106 ms. (steps per millisecond=474 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1831 ms. (steps per millisecond=546 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2126 ms. (steps per millisecond=470 ) properties (out of 4) seen :2
[2023-03-16 01:40:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:40:07] [INFO ] Computed 8 place invariants in 63 ms
[2023-03-16 01:40:07] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2023-03-16 01:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:08] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2023-03-16 01:40:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:40:08] [INFO ] [Real]Added 283 Read/Feed constraints in 88 ms returned sat
[2023-03-16 01:40:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:40:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:09] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2023-03-16 01:40:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 177 ms returned sat
[2023-03-16 01:40:10] [INFO ] Deduced a trap composed of 19 places in 844 ms of which 1 ms to minimize.
[2023-03-16 01:40:11] [INFO ] Deduced a trap composed of 53 places in 723 ms of which 1 ms to minimize.
[2023-03-16 01:40:11] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 1 ms to minimize.
[2023-03-16 01:40:12] [INFO ] Deduced a trap composed of 7 places in 541 ms of which 2 ms to minimize.
[2023-03-16 01:40:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3132 ms
[2023-03-16 01:40:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 298 ms.
[2023-03-16 01:40:13] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 2 ms to minimize.
[2023-03-16 01:40:14] [INFO ] Deduced a trap composed of 44 places in 328 ms of which 1 ms to minimize.
[2023-03-16 01:40:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 975 ms
[2023-03-16 01:40:14] [INFO ] Added : 6 causal constraints over 3 iterations in 2153 ms. Result :sat
[2023-03-16 01:40:14] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:15] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2023-03-16 01:40:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:40:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:16] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2023-03-16 01:40:16] [INFO ] [Nat]Added 283 Read/Feed constraints in 84 ms returned sat
[2023-03-16 01:40:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 414 ms.
[2023-03-16 01:40:17] [INFO ] Added : 2 causal constraints over 1 iterations in 873 ms. Result :sat
[2023-03-16 01:40:18] [INFO ] [Real]Absence check using 8 positive place invariants in 66 ms returned sat
[2023-03-16 01:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:18] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2023-03-16 01:40:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:20] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2023-03-16 01:40:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 127 ms returned sat
[2023-03-16 01:40:20] [INFO ] Deduced a trap composed of 36 places in 355 ms of which 1 ms to minimize.
[2023-03-16 01:40:21] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 1 ms to minimize.
[2023-03-16 01:40:21] [INFO ] Deduced a trap composed of 56 places in 349 ms of which 1 ms to minimize.
[2023-03-16 01:40:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1479 ms
[2023-03-16 01:40:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 188 ms.
[2023-03-16 01:40:22] [INFO ] Added : 9 causal constraints over 2 iterations in 808 ms. Result :sat
[2023-03-16 01:40:22] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:23] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2023-03-16 01:40:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-16 01:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:24] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2023-03-16 01:40:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 241 ms returned sat
[2023-03-16 01:40:25] [INFO ] Deduced a trap composed of 43 places in 755 ms of which 1 ms to minimize.
[2023-03-16 01:40:26] [INFO ] Deduced a trap composed of 36 places in 461 ms of which 0 ms to minimize.
[2023-03-16 01:40:27] [INFO ] Deduced a trap composed of 17 places in 895 ms of which 28 ms to minimize.
[2023-03-16 01:40:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2572 ms
[2023-03-16 01:40:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 274 ms.
[2023-03-16 01:40:28] [INFO ] Added : 13 causal constraints over 4 iterations in 1345 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1] Max seen :[2, 0, 0, 0]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY 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-16 01:40:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:40:29] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-16 01:40:31] [INFO ] Implicit Places using invariants in 1599 ms returned []
[2023-03-16 01:40:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:40:31] [INFO ] Computed 8 place invariants in 33 ms
[2023-03-16 01:40:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:40:34] [INFO ] Implicit Places using invariants and state equation in 3493 ms returned []
Implicit Place search using SMT with State Equation took 5108 ms to find 0 implicit places.
[2023-03-16 01:40:35] [INFO ] Redundant transitions in 372 ms returned []
[2023-03-16 01:40:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:40:35] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-16 01:40:37] [INFO ] Dead Transitions using invariants and state equation in 2005 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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-16 01:40:37] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000018 steps, including 2 resets, run finished after 1630 ms. (steps per millisecond=613 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1937 ms. (steps per millisecond=516 ) properties (out of 4) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2253 ms. (steps per millisecond=443 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1913 ms. (steps per millisecond=522 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 4) seen :2
[2023-03-16 01:40:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:40:46] [INFO ] Computed 8 place invariants in 52 ms
[2023-03-16 01:40:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:47] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2023-03-16 01:40:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:40:48] [INFO ] [Real]Added 283 Read/Feed constraints in 100 ms returned sat
[2023-03-16 01:40:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:40:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:49] [INFO ] [Nat]Absence check using state equation in 1101 ms returned sat
[2023-03-16 01:40:49] [INFO ] [Nat]Added 283 Read/Feed constraints in 305 ms returned sat
[2023-03-16 01:40:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 421 ms.
[2023-03-16 01:40:50] [INFO ] Added : 3 causal constraints over 1 iterations in 831 ms. Result :sat
[2023-03-16 01:40:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:52] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
[2023-03-16 01:40:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:52] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2023-03-16 01:40:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 54 ms returned sat
[2023-03-16 01:40:53] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 356 ms.
[2023-03-16 01:40:53] [INFO ] Added : 2 causal constraints over 1 iterations in 780 ms. Result :sat
[2023-03-16 01:40:54] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:54] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2023-03-16 01:40:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:55] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-16 01:40:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 115 ms returned sat
[2023-03-16 01:40:56] [INFO ] Deduced a trap composed of 36 places in 551 ms of which 1 ms to minimize.
[2023-03-16 01:40:56] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 0 ms to minimize.
[2023-03-16 01:40:57] [INFO ] Deduced a trap composed of 56 places in 332 ms of which 1 ms to minimize.
[2023-03-16 01:40:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1579 ms
[2023-03-16 01:40:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 297 ms.
[2023-03-16 01:40:58] [INFO ] Added : 9 causal constraints over 2 iterations in 920 ms. Result :sat
[2023-03-16 01:40:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:40:58] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-16 01:40:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:40:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:40:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:00] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2023-03-16 01:41:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 206 ms returned sat
[2023-03-16 01:41:00] [INFO ] Deduced a trap composed of 43 places in 342 ms of which 0 ms to minimize.
[2023-03-16 01:41:01] [INFO ] Deduced a trap composed of 36 places in 536 ms of which 1 ms to minimize.
[2023-03-16 01:41:01] [INFO ] Deduced a trap composed of 17 places in 471 ms of which 2 ms to minimize.
[2023-03-16 01:41:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1861 ms
[2023-03-16 01:41:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 585 ms.
[2023-03-16 01:41:03] [INFO ] Added : 13 causal constraints over 4 iterations in 1683 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1] Max seen :[6, 0, 0, 0]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 109 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY 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-16 01:41:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:41:04] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-16 01:41:05] [INFO ] Implicit Places using invariants in 952 ms returned []
[2023-03-16 01:41:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:41:05] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-16 01:41:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:41:09] [INFO ] Implicit Places using invariants and state equation in 3737 ms returned []
Implicit Place search using SMT with State Equation took 4713 ms to find 0 implicit places.
[2023-03-16 01:41:09] [INFO ] Redundant transitions in 147 ms returned []
[2023-03-16 01:41:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:41:09] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-16 01:41:34] [INFO ] Dead Transitions using invariants and state equation in 25150 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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-16 01:41:34] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1428 ms. (steps per millisecond=700 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1681 ms. (steps per millisecond=594 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1714 ms. (steps per millisecond=583 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1676 ms. (steps per millisecond=596 ) properties (out of 4) seen :1
[2023-03-16 01:41:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:41:42] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:41:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:43] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2023-03-16 01:41:43] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:41:43] [INFO ] [Real]Added 283 Read/Feed constraints in 180 ms returned sat
[2023-03-16 01:41:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:41:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:44] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2023-03-16 01:41:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 312 ms returned sat
[2023-03-16 01:41:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 382 ms.
[2023-03-16 01:41:45] [INFO ] Added : 3 causal constraints over 1 iterations in 811 ms. Result :sat
[2023-03-16 01:41:46] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 01:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:46] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2023-03-16 01:41:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:41:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:47] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2023-03-16 01:41:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 54 ms returned sat
[2023-03-16 01:41:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 326 ms.
[2023-03-16 01:41:48] [INFO ] Added : 2 causal constraints over 1 iterations in 752 ms. Result :sat
[2023-03-16 01:41:48] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:49] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2023-03-16 01:41:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:41:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:50] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-16 01:41:50] [INFO ] [Nat]Added 283 Read/Feed constraints in 149 ms returned sat
[2023-03-16 01:41:50] [INFO ] Deduced a trap composed of 36 places in 449 ms of which 0 ms to minimize.
[2023-03-16 01:41:51] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 1 ms to minimize.
[2023-03-16 01:41:52] [INFO ] Deduced a trap composed of 56 places in 411 ms of which 0 ms to minimize.
[2023-03-16 01:41:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1760 ms
[2023-03-16 01:41:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 318 ms.
[2023-03-16 01:41:53] [INFO ] Added : 9 causal constraints over 2 iterations in 1010 ms. Result :sat
[2023-03-16 01:41:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:54] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2023-03-16 01:41:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:41:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:41:54] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2023-03-16 01:41:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 200 ms returned sat
[2023-03-16 01:41:55] [INFO ] Deduced a trap composed of 43 places in 396 ms of which 0 ms to minimize.
[2023-03-16 01:41:56] [INFO ] Deduced a trap composed of 36 places in 386 ms of which 1 ms to minimize.
[2023-03-16 01:41:56] [INFO ] Deduced a trap composed of 17 places in 297 ms of which 1 ms to minimize.
[2023-03-16 01:41:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1548 ms
[2023-03-16 01:41:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 297 ms.
[2023-03-16 01:41:58] [INFO ] Added : 13 causal constraints over 4 iterations in 1417 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 1] Max seen :[6, 0, 0, 0]
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:41:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:41:58] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:41:59] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-16 01:41:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:41:59] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-16 01:41:59] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:01] [INFO ] Implicit Places using invariants and state equation in 2315 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
[2023-03-16 01:42:01] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-16 01:42:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:01] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:42:03] [INFO ] Dead Transitions using invariants and state equation in 1505 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-00
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:03] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 10027 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :2
[2023-03-16 01:42:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:03] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-16 01:42:03] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:03] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2023-03-16 01:42:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:04] [INFO ] [Real]Added 283 Read/Feed constraints in 49 ms returned sat
[2023-03-16 01:42:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:04] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2023-03-16 01:42:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 244 ms returned sat
[2023-03-16 01:42:05] [INFO ] Deduced a trap composed of 19 places in 478 ms of which 1 ms to minimize.
[2023-03-16 01:42:06] [INFO ] Deduced a trap composed of 53 places in 484 ms of which 1 ms to minimize.
[2023-03-16 01:42:06] [INFO ] Deduced a trap composed of 35 places in 501 ms of which 0 ms to minimize.
[2023-03-16 01:42:07] [INFO ] Deduced a trap composed of 7 places in 499 ms of which 2 ms to minimize.
[2023-03-16 01:42:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2556 ms
[2023-03-16 01:42:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 316 ms.
[2023-03-16 01:42:09] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 1 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-16 01:42:09] [INFO ] Deduced a trap composed of 7 places in 820 ms of which 1 ms to minimize.
[2023-03-16 01:42: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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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 :[2]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 87 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. 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-16 01:42:10] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 1555 ms. (steps per millisecond=643 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=468 ) properties (out of 1) seen :4
[2023-03-16 01:42:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:13] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:42:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:14] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2023-03-16 01:42:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:14] [INFO ] [Real]Added 283 Read/Feed constraints in 137 ms returned sat
[2023-03-16 01:42:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:15] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2023-03-16 01:42:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 274 ms returned sat
[2023-03-16 01:42:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 331 ms.
[2023-03-16 01:42:16] [INFO ] Added : 3 causal constraints over 1 iterations in 894 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:42:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:17] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:42:17] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-16 01:42:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:17] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-16 01:42:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:19] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2234 ms to find 0 implicit places.
[2023-03-16 01:42:19] [INFO ] Redundant transitions in 201 ms returned []
[2023-03-16 01:42:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:19] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:42:21] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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-16 01:42:21] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties (out of 1) seen :2
[2023-03-16 01:42:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:24] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:42:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:25] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2023-03-16 01:42:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:25] [INFO ] [Real]Added 283 Read/Feed constraints in 86 ms returned sat
[2023-03-16 01:42:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:25] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2023-03-16 01:42:26] [INFO ] [Nat]Added 283 Read/Feed constraints in 284 ms returned sat
[2023-03-16 01:42:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 371 ms.
[2023-03-16 01:42:27] [INFO ] Added : 3 causal constraints over 1 iterations in 806 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 159 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:42:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:27] [INFO ] Computed 8 place invariants in 32 ms
[2023-03-16 01:42:28] [INFO ] Implicit Places using invariants in 785 ms returned []
[2023-03-16 01:42:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:28] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-16 01:42:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:30] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 3095 ms to find 0 implicit places.
[2023-03-16 01:42:30] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-16 01:42:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:30] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:42:32] [INFO ] Dead Transitions using invariants and state equation in 1956 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-00 in 29628 ms.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:32] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10023 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-16 01:42:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:32] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-16 01:42:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:33] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2023-03-16 01:42:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:34] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2023-03-16 01:42:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:34] [INFO ] [Nat]Added 283 Read/Feed constraints in 78 ms returned sat
[2023-03-16 01:42:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 364 ms.
[2023-03-16 01:42:35] [INFO ] Added : 2 causal constraints over 1 iterations in 781 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. 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-16 01:42:35] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000019 steps, including 2 resets, run finished after 1406 ms. (steps per millisecond=711 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1693 ms. (steps per millisecond=590 ) properties (out of 1) seen :0
[2023-03-16 01:42:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:39] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:42:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:39] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2023-03-16 01:42:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:42:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:40] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2023-03-16 01:42:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 74 ms returned sat
[2023-03-16 01:42:40] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 368 ms.
[2023-03-16 01:42:41] [INFO ] Added : 2 causal constraints over 1 iterations in 747 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 SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 87 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:42:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:41] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-16 01:42:42] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-16 01:42:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:42] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-16 01:42:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:43] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2023-03-16 01:42:44] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-16 01:42:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:44] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-16 01:42:45] [INFO ] Dead Transitions using invariants and state equation in 1460 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-08 in 12716 ms.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:45] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2023-03-16 01:42:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:45] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:42:45] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:46] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2023-03-16 01:42:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:47] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2023-03-16 01:42:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 135 ms returned sat
[2023-03-16 01:42:47] [INFO ] Deduced a trap composed of 36 places in 425 ms of which 5 ms to minimize.
[2023-03-16 01:42:48] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 1 ms to minimize.
[2023-03-16 01:42:48] [INFO ] Deduced a trap composed of 56 places in 440 ms of which 1 ms to minimize.
[2023-03-16 01:42:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1681 ms
[2023-03-16 01:42:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 333 ms.
[2023-03-16 01:42:50] [INFO ] Added : 9 causal constraints over 2 iterations in 961 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 SAFETY 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.
Finished structural reductions, in 1 iterations. 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-16 01:42:50] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1763 ms. (steps per millisecond=567 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1837 ms. (steps per millisecond=544 ) properties (out of 1) seen :0
[2023-03-16 01:42:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:53] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:42:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:42:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:54] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2023-03-16 01:42:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:42:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:42:55] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-16 01:42:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:42:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 165 ms returned sat
[2023-03-16 01:42:56] [INFO ] Deduced a trap composed of 36 places in 401 ms of which 1 ms to minimize.
[2023-03-16 01:42:56] [INFO ] Deduced a trap composed of 10 places in 530 ms of which 1 ms to minimize.
[2023-03-16 01:42:57] [INFO ] Deduced a trap composed of 56 places in 345 ms of which 1 ms to minimize.
[2023-03-16 01:42:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1875 ms
[2023-03-16 01:42:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 362 ms.
[2023-03-16 01:42:58] [INFO ] Added : 9 causal constraints over 2 iterations in 1064 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 SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 115 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 130 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:42:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:58] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:42:59] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-16 01:42:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:42:59] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:43:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:02] [INFO ] Implicit Places using invariants and state equation in 2825 ms returned []
Implicit Place search using SMT with State Equation took 3378 ms to find 0 implicit places.
[2023-03-16 01:43:02] [INFO ] Redundant transitions in 180 ms returned []
[2023-03-16 01:43:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:02] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:43:04] [INFO ] Dead Transitions using invariants and state equation in 2176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-13 in 19213 ms.
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-14
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:04] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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-16 01:43:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:04] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-16 01:43:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:43:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:05] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2023-03-16 01:43:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:43:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 01:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:06] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2023-03-16 01:43:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:06] [INFO ] [Nat]Added 283 Read/Feed constraints in 241 ms returned sat
[2023-03-16 01:43:07] [INFO ] Deduced a trap composed of 43 places in 383 ms of which 1 ms to minimize.
[2023-03-16 01:43:07] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 0 ms to minimize.
[2023-03-16 01:43:08] [INFO ] Deduced a trap composed of 17 places in 296 ms of which 0 ms to minimize.
[2023-03-16 01:43:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1528 ms
[2023-03-16 01:43:08] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 344 ms.
[2023-03-16 01:43:09] [INFO ] Added : 13 causal constraints over 4 iterations in 1423 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 SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. 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-16 01:43:10] [INFO ] Computed 8 place invariants in 23 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 1719 ms. (steps per millisecond=581 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1710 ms. (steps per millisecond=584 ) properties (out of 1) seen :0
[2023-03-16 01:43:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:13] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:43:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:14] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-16 01:43:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:43:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:43:14] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2023-03-16 01:43:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 233 ms returned sat
[2023-03-16 01:43:15] [INFO ] Deduced a trap composed of 43 places in 330 ms of which 1 ms to minimize.
[2023-03-16 01:43:15] [INFO ] Deduced a trap composed of 36 places in 366 ms of which 0 ms to minimize.
[2023-03-16 01:43:16] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 0 ms to minimize.
[2023-03-16 01:43:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1320 ms
[2023-03-16 01:43:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 398 ms.
[2023-03-16 01:43:17] [INFO ] Added : 13 causal constraints over 4 iterations in 1436 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 SAFETY 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 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:43:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:18] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-16 01:43:18] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-16 01:43:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:18] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-16 01:43:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:43:20] [INFO ] Implicit Places using invariants and state equation in 2047 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
[2023-03-16 01:43:21] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-16 01:43:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:43:21] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-16 01:43:32] [INFO ] Dead Transitions using invariants and state equation in 11718 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-14 in 28010 ms.
[2023-03-16 01:43:34] [INFO ] Flatten gal took : 1462 ms
[2023-03-16 01:43:35] [INFO ] Applying decomposition
[2023-03-16 01:43:35] [INFO ] Flatten gal took : 388 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15366301674903987395.txt' '-o' '/tmp/graph15366301674903987395.bin' '-w' '/tmp/graph15366301674903987395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15366301674903987395.bin' '-l' '-1' '-v' '-w' '/tmp/graph15366301674903987395.weights' '-q' '0' '-e' '0.001'
[2023-03-16 01:43:36] [INFO ] Decomposing Gal with order
[2023-03-16 01:43:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:43:37] [INFO ] Removed a total of 424 redundant transitions.
[2023-03-16 01:43:37] [INFO ] Flatten gal took : 878 ms
[2023-03-16 01:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 47 ms.
[2023-03-16 01:43:37] [INFO ] Time to serialize gal into /tmp/UpperBounds13345268997433512152.gal : 81 ms
[2023-03-16 01:43:37] [INFO ] Time to serialize properties into /tmp/UpperBounds5044396114928359743.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13345268997433512152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5044396114928359743.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds5044396114928359743.prop.
Detected timeout of ITS tools.
[2023-03-16 02:05:04] [INFO ] Flatten gal took : 3749 ms
[2023-03-16 02:05:05] [INFO ] Time to serialize gal into /tmp/UpperBounds12636014355528109385.gal : 142 ms
[2023-03-16 02:05:05] [INFO ] Time to serialize properties into /tmp/UpperBounds2621034380791904517.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12636014355528109385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2621034380791904517.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds2621034380791904517.prop.
Detected timeout of ITS tools.
[2023-03-16 02:26:26] [INFO ] Flatten gal took : 363 ms
[2023-03-16 02:26:27] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-16 02:26:27] [INFO ] Transformed 269 places.
[2023-03-16 02:26:27] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 02:26:28] [INFO ] Time to serialize gal into /tmp/UpperBounds17787126923127260370.gal : 42 ms
[2023-03-16 02:26:28] [INFO ] Time to serialize properties into /tmp/UpperBounds12393481164616090456.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17787126923127260370.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12393481164616090456.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12393481164616090456.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-q8m032"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is BugTracking-PT-q8m032, 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 r063-tajo-167813711600053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m032.tgz
mv BugTracking-PT-q8m032 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 ;