Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292500007.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BugTracking-PT-q3m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 10K Jun 7 16:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Jun 7 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 7 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 7 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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-q3m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654726497700

Running Version 0
[2022-06-08 22:15:00] [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]
[2022-06-08 22:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 22:15:02] [INFO ] Load time of PNML (sax parser for PT used): 1058 ms
[2022-06-08 22:15:02] [INFO ] Transformed 754 places.
[2022-06-08 22:15:02] [INFO ] Transformed 27370 transitions.
[2022-06-08 22:15:02] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 514 places in 151 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m008-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 22:15:02] [INFO ] Computed 10 place invariants in 43 ms
FORMULA BugTracking-PT-q3m008-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :1
FORMULA BugTracking-PT-q3m008-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
[2022-06-08 22:15:02] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 22:15:02] [INFO ] Computed 10 place invariants in 22 ms
[2022-06-08 22:15:03] [INFO ] [Real]Absence check using 10 positive place invariants in 43 ms returned sat
[2022-06-08 22:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:03] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2022-06-08 22:15:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:04] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2022-06-08 22:15:04] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-08 22:15:04] [INFO ] [Nat]Added 268 Read/Feed constraints in 139 ms returned sat
[2022-06-08 22:15:04] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 9 ms to minimize.
[2022-06-08 22:15:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2022-06-08 22:15:05] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 235 ms.
[2022-06-08 22:15:07] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 1 ms to minimize.
[2022-06-08 22:15:07] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 1 ms to minimize.
[2022-06-08 22:15:08] [INFO ] Deduced a trap composed of 76 places in 297 ms of which 2 ms to minimize.
[2022-06-08 22:15:08] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 1 ms to minimize.
[2022-06-08 22:15:08] [INFO ] Deduced a trap composed of 56 places in 213 ms of which 1 ms to minimize.
[2022-06-08 22:15:09] [INFO ] Deduced a trap composed of 12 places in 383 ms of which 0 ms to minimize.
[2022-06-08 22:15: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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 22:15:09] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:09] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2022-06-08 22:15:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:10] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-06-08 22:15:10] [INFO ] [Nat]Added 268 Read/Feed constraints in 128 ms returned sat
[2022-06-08 22:15:10] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 0 ms to minimize.
[2022-06-08 22:15:10] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 0 ms to minimize.
[2022-06-08 22:15:11] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-06-08 22:15:11] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2022-06-08 22:15:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1020 ms
[2022-06-08 22:15:11] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 155 ms.
[2022-06-08 22:15:13] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-06-08 22:15:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2022-06-08 22:15:14] [INFO ] Added : 96 causal constraints over 20 iterations in 2858 ms. Result :sat
Minimization took 437 ms.
[2022-06-08 22:15:14] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:15] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2022-06-08 22:15:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:15] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2022-06-08 22:15:15] [INFO ] [Nat]Added 268 Read/Feed constraints in 139 ms returned sat
[2022-06-08 22:15:16] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 1 ms to minimize.
[2022-06-08 22:15:16] [INFO ] Deduced a trap composed of 57 places in 281 ms of which 1 ms to minimize.
[2022-06-08 22:15:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 817 ms
[2022-06-08 22:15:16] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 178 ms.
[2022-06-08 22:15:19] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 1 ms to minimize.
[2022-06-08 22:15:19] [INFO ] Deduced a trap composed of 57 places in 266 ms of which 1 ms to minimize.
[2022-06-08 22:15:20] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 1 ms to minimize.
[2022-06-08 22:15:20] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 1 ms to minimize.
[2022-06-08 22:15:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, -1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 950200 steps, including 13973 resets, run finished after 7632 ms. (steps per millisecond=124 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 249 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:15:28] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4833 ms. (steps per millisecond=206 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2356 ms. (steps per millisecond=424 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2337 ms. (steps per millisecond=427 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2252 ms. (steps per millisecond=444 ) properties (out of 3) seen :0
[2022-06-08 22:15:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:15:40] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 22:15:40] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:40] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2022-06-08 22:15:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:40] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-08 22:15:40] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:15:41] [INFO ] [Nat]Added 254 Read/Feed constraints in 128 ms returned sat
[2022-06-08 22:15:41] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 0 ms to minimize.
[2022-06-08 22:15:41] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 0 ms to minimize.
[2022-06-08 22:15:41] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 0 ms to minimize.
[2022-06-08 22:15:42] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2022-06-08 22:15:42] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 14 ms to minimize.
[2022-06-08 22:15:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1199 ms
[2022-06-08 22:15:42] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 151 ms.
[2022-06-08 22:15:44] [INFO ] Added : 95 causal constraints over 19 iterations in 2331 ms. Result :sat
Minimization took 371 ms.
[2022-06-08 22:15:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:45] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2022-06-08 22:15:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 22:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:45] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2022-06-08 22:15:45] [INFO ] [Nat]Added 254 Read/Feed constraints in 124 ms returned sat
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2022-06-08 22:15:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2022-06-08 22:15:46] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 160 ms.
[2022-06-08 22:15:48] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 0 ms to minimize.
[2022-06-08 22:15:48] [INFO ] Deduced a trap composed of 69 places in 229 ms of which 0 ms to minimize.
[2022-06-08 22:15:49] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 0 ms to minimize.
[2022-06-08 22:15:49] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 1 ms to minimize.
[2022-06-08 22:15:49] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 0 ms to minimize.
[2022-06-08 22:15:50] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 0 ms to minimize.
[2022-06-08 22:15:50] [INFO ] Deduced a trap composed of 80 places in 218 ms of which 0 ms to minimize.
[2022-06-08 22:15:50] [INFO ] Deduced a trap composed of 80 places in 232 ms of which 0 ms to minimize.
[2022-06-08 22:15:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2630 ms
[2022-06-08 22:15:51] [INFO ] Added : 71 causal constraints over 15 iterations in 4628 ms. Result :sat
Minimization took 346 ms.
[2022-06-08 22:15:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:15:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:51] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-06-08 22:15:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:15:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:15:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:15:52] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-06-08 22:15:52] [INFO ] [Nat]Added 254 Read/Feed constraints in 136 ms returned sat
[2022-06-08 22:15:52] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 5 ms to minimize.
[2022-06-08 22:15:52] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 6 ms to minimize.
[2022-06-08 22:15:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 535 ms
[2022-06-08 22:15:53] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 154 ms.
[2022-06-08 22:15:54] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 0 ms to minimize.
[2022-06-08 22:15:55] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2022-06-08 22:15:55] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 0 ms to minimize.
[2022-06-08 22:15:55] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 1 ms to minimize.
[2022-06-08 22:15:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1061 ms
[2022-06-08 22:15:55] [INFO ] Added : 63 causal constraints over 13 iterations in 2820 ms. Result :sat
Minimization took 381 ms.
Current structural bounds on expressions (after SMT) : [1, -1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 620500 steps, including 1000 resets, run finished after 7245 ms. (steps per millisecond=85 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 897200 steps, including 1001 resets, run finished after 8637 ms. (steps per millisecond=103 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1149700 steps, including 1000 resets, run finished after 11460 ms. (steps per millisecond=100 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 65 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 43 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:16:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:23] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 22:16:24] [INFO ] Implicit Places using invariants in 429 ms returned []
[2022-06-08 22:16:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:24] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-08 22:16:24] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:16:28] [INFO ] Implicit Places using invariants and state equation in 4373 ms returned []
Implicit Place search using SMT with State Equation took 4814 ms to find 0 implicit places.
[2022-06-08 22:16:28] [INFO ] Redundant transitions in 209 ms returned []
[2022-06-08 22:16:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:28] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 22:16:29] [INFO ] Dead Transitions using invariants and state equation in 803 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-02
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:29] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2022-06-08 22:16:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:29] [INFO ] Computed 8 place invariants in 30 ms
[2022-06-08 22:16:29] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2022-06-08 22:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:30] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2022-06-08 22:16:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:30] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2022-06-08 22:16:30] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:16:30] [INFO ] [Nat]Added 254 Read/Feed constraints in 124 ms returned sat
[2022-06-08 22:16:30] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 1 ms to minimize.
[2022-06-08 22:16:31] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2022-06-08 22:16:31] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 1 ms to minimize.
[2022-06-08 22:16:31] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2022-06-08 22:16:31] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2022-06-08 22:16:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1227 ms
[2022-06-08 22:16:31] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2022-06-08 22:16:34] [INFO ] Added : 95 causal constraints over 19 iterations in 2326 ms. Result :sat
Minimization took 363 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1149700 steps, including 1000 resets, run finished after 11600 ms. (steps per millisecond=99 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 61 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:46] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6473 ms. (steps per millisecond=154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2321 ms. (steps per millisecond=430 ) properties (out of 1) seen :0
[2022-06-08 22:16:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:16:55] [INFO ] Computed 8 place invariants in 21 ms
[2022-06-08 22:16:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:55] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2022-06-08 22:16:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:16:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:16:55] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-08 22:16:55] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:16:56] [INFO ] [Nat]Added 254 Read/Feed constraints in 124 ms returned sat
[2022-06-08 22:16:56] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 0 ms to minimize.
[2022-06-08 22:16:56] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-06-08 22:16:56] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 0 ms to minimize.
[2022-06-08 22:16:56] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2022-06-08 22:16:57] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2022-06-08 22:16:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1211 ms
[2022-06-08 22:16:57] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 144 ms.
[2022-06-08 22:16:59] [INFO ] Added : 95 causal constraints over 19 iterations in 2325 ms. Result :sat
Minimization took 387 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1149700 steps, including 1000 resets, run finished after 11782 ms. (steps per millisecond=97 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 35 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:17:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:11] [INFO ] Computed 8 place invariants in 23 ms
[2022-06-08 22:17:12] [INFO ] Implicit Places using invariants in 311 ms returned []
[2022-06-08 22:17:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:12] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-08 22:17:12] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:16] [INFO ] Implicit Places using invariants and state equation in 4307 ms returned []
Implicit Place search using SMT with State Equation took 4621 ms to find 0 implicit places.
[2022-06-08 22:17:16] [INFO ] Redundant transitions in 172 ms returned []
[2022-06-08 22:17:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:16] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-08 22:17:17] [INFO ] Dead Transitions using invariants and state equation in 749 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-02 in 47900 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-04
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:17] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2022-06-08 22:17:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:17] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:17:17] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 22:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:17] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2022-06-08 22:17:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:17:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:18] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2022-06-08 22:17:18] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:18] [INFO ] [Nat]Added 254 Read/Feed constraints in 124 ms returned sat
[2022-06-08 22:17:18] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2022-06-08 22:17:18] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2022-06-08 22:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2022-06-08 22:17:19] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 164 ms.
[2022-06-08 22:17:20] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 0 ms to minimize.
[2022-06-08 22:17:21] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 1 ms to minimize.
[2022-06-08 22:17:21] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 1 ms to minimize.
[2022-06-08 22:17:21] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 0 ms to minimize.
[2022-06-08 22:17:22] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 11 ms to minimize.
[2022-06-08 22:17:22] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 1 ms to minimize.
[2022-06-08 22:17:22] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 1 ms to minimize.
[2022-06-08 22:17:23] [INFO ] Deduced a trap composed of 80 places in 202 ms of which 1 ms to minimize.
[2022-06-08 22:17:23] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 38 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:23] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6588 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2298 ms. (steps per millisecond=435 ) properties (out of 1) seen :0
[2022-06-08 22:17:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:32] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 22:17:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:32] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2022-06-08 22:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 22:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:32] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-06-08 22:17:32] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:32] [INFO ] [Nat]Added 254 Read/Feed constraints in 130 ms returned sat
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2022-06-08 22:17:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
[2022-06-08 22:17:33] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 153 ms.
[2022-06-08 22:17:35] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2022-06-08 22:17:35] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 0 ms to minimize.
[2022-06-08 22:17:36] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 1 ms to minimize.
[2022-06-08 22:17:36] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2022-06-08 22:17:36] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 2 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 2 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Deduced a trap composed of 80 places in 226 ms of which 1 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Deduced a trap composed of 80 places in 225 ms of which 1 ms to minimize.
[2022-06-08 22:17:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2598 ms
[2022-06-08 22:17:37] [INFO ] Added : 71 causal constraints over 15 iterations in 4560 ms. Result :sat
Minimization took 334 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 897200 steps, including 1002 resets, run finished after 8054 ms. (steps per millisecond=111 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:17:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:46] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 22:17:46] [INFO ] Implicit Places using invariants in 328 ms returned []
[2022-06-08 22:17:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:46] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 22:17:47] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:51] [INFO ] Implicit Places using invariants and state equation in 4383 ms returned []
Implicit Place search using SMT with State Equation took 4715 ms to find 0 implicit places.
[2022-06-08 22:17:51] [INFO ] Redundant transitions in 58 ms returned []
[2022-06-08 22:17:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:51] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 22:17:51] [INFO ] Dead Transitions using invariants and state equation in 751 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-04 in 34552 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-10
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:51] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2022-06-08 22:17:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:17:52] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 22:17:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:52] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-06-08 22:17:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:17:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:17:52] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-06-08 22:17:52] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:17:53] [INFO ] [Nat]Added 254 Read/Feed constraints in 143 ms returned sat
[2022-06-08 22:17:53] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2022-06-08 22:17:53] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2022-06-08 22:17:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
[2022-06-08 22:17:53] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 168 ms.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 0 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2022-06-08 22:17:55] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 1 ms to minimize.
[2022-06-08 22:17:56] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 1 ms to minimize.
[2022-06-08 22:17:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1076 ms
[2022-06-08 22:17:56] [INFO ] Added : 63 causal constraints over 13 iterations in 2870 ms. Result :sat
Minimization took 366 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 620500 steps, including 1000 resets, run finished after 7381 ms. (steps per millisecond=84 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:04] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6024 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2312 ms. (steps per millisecond=432 ) properties (out of 1) seen :0
[2022-06-08 22:18:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:12] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-08 22:18:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:13] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2022-06-08 22:18:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 22:18:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 22:18:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 22:18:13] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-06-08 22:18:13] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:13] [INFO ] [Nat]Added 254 Read/Feed constraints in 135 ms returned sat
[2022-06-08 22:18:13] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 0 ms to minimize.
[2022-06-08 22:18:14] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2022-06-08 22:18:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 531 ms
[2022-06-08 22:18:14] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 156 ms.
[2022-06-08 22:18:15] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 0 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 1 ms to minimize.
[2022-06-08 22:18:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1001 ms
[2022-06-08 22:18:16] [INFO ] Added : 63 causal constraints over 13 iterations in 2728 ms. Result :sat
Minimization took 352 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 620500 steps, including 1000 resets, run finished after 7094 ms. (steps per millisecond=87 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 22:18:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:24] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 22:18:24] [INFO ] Implicit Places using invariants in 300 ms returned []
[2022-06-08 22:18:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:24] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 22:18:25] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 22:18:29] [INFO ] Implicit Places using invariants and state equation in 5019 ms returned []
Implicit Place search using SMT with State Equation took 5323 ms to find 0 implicit places.
[2022-06-08 22:18:29] [INFO ] Redundant transitions in 59 ms returned []
[2022-06-08 22:18:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 22:18:29] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 22:18:30] [INFO ] Dead Transitions using invariants and state equation in 699 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-10 in 38526 ms.
[2022-06-08 22:18:30] [INFO ] Flatten gal took : 285 ms
[2022-06-08 22:18:31] [INFO ] Applying decomposition
[2022-06-08 22:18:31] [INFO ] Flatten gal took : 152 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1615953253328079289.txt, -o, /tmp/graph1615953253328079289.bin, -w, /tmp/graph1615953253328079289.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1615953253328079289.bin, -l, -1, -v, -w, /tmp/graph1615953253328079289.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 22:18:31] [INFO ] Decomposing Gal with order
[2022-06-08 22:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 22:18:31] [INFO ] Removed a total of 280 redundant transitions.
[2022-06-08 22:18:32] [INFO ] Flatten gal took : 303 ms
[2022-06-08 22:18:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 16 ms.
[2022-06-08 22:18:32] [INFO ] Time to serialize gal into /tmp/UpperBounds10134704969797912021.gal : 30 ms
[2022-06-08 22:18:32] [INFO ] Time to serialize properties into /tmp/UpperBounds4937742070237055390.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10134704969797912021.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4937742070237055390.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10134704969797912021.gal -t CGAL -reachable-file /tmp/UpperBounds4937742070237055390.prop --nowitness
Loading property file /tmp/UpperBounds4937742070237055390.prop.
Detected timeout of ITS tools.
[2022-06-08 22:39:52] [INFO ] Flatten gal took : 775 ms
[2022-06-08 22:39:52] [INFO ] Time to serialize gal into /tmp/UpperBounds8887353550541283496.gal : 112 ms
[2022-06-08 22:39:52] [INFO ] Time to serialize properties into /tmp/UpperBounds12424954782142526585.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8887353550541283496.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12424954782142526585.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8887353550541283496.gal -t CGAL -reachable-file /tmp/UpperBounds12424954782142526585.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds12424954782142526585.prop.
Detected timeout of ITS tools.
[2022-06-08 23:01:02] [INFO ] Flatten gal took : 530 ms
[2022-06-08 23:01:06] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-08 23:01:06] [INFO ] Transformed 229 places.
[2022-06-08 23:01:06] [INFO ] Transformed 2747 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-08 23:01:06] [INFO ] Time to serialize gal into /tmp/UpperBounds8310517293326630923.gal : 13 ms
[2022-06-08 23:01:06] [INFO ] Time to serialize properties into /tmp/UpperBounds13988115389581018274.prop : 24 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8310517293326630923.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13988115389581018274.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8310517293326630923.gal -t CGAL -reachable-file /tmp/UpperBounds13988115389581018274.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13988115389581018274.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-q3m008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is BugTracking-PT-q3m008, 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 r323-tall-165472292500007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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