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-165472292500013.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-q3m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.6K Jun 7 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 7 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 16:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 16:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 19K Jun 7 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Jun 7 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 7 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-q3m032-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m032-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654730179436

Running Version 0
[2022-06-08 23:16:21] [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 23:16:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:16:21] [INFO ] Load time of PNML (sax parser for PT used): 660 ms
[2022-06-08 23:16:21] [INFO ] Transformed 754 places.
[2022-06-08 23:16:21] [INFO ] Transformed 27370 transitions.
[2022-06-08 23:16:21] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 797 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 514 places in 138 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-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 23:16:22] [INFO ] Computed 10 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 10 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :1
[2022-06-08 23:16:22] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 23:16:22] [INFO ] Computed 10 place invariants in 16 ms
[2022-06-08 23:16:22] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-08 23:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:23] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2022-06-08 23:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:23] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2022-06-08 23:16:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-08 23:16:23] [INFO ] [Nat]Added 268 Read/Feed constraints in 132 ms returned sat
[2022-06-08 23:16:24] [INFO ] Deduced a trap composed of 121 places in 356 ms of which 3 ms to minimize.
[2022-06-08 23:16:24] [INFO ] Deduced a trap composed of 73 places in 329 ms of which 2 ms to minimize.
[2022-06-08 23:16:24] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 1 ms to minimize.
[2022-06-08 23:16:25] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 2 ms to minimize.
[2022-06-08 23:16:25] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 1 ms to minimize.
[2022-06-08 23:16:26] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 0 ms to minimize.
[2022-06-08 23:16:26] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 0 ms to minimize.
[2022-06-08 23:16:26] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2022-06-08 23:16:26] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2022-06-08 23:16:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3372 ms
[2022-06-08 23:16:27] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 184 ms.
[2022-06-08 23:16:28] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 0 ms to minimize.
[2022-06-08 23:16:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 23:16:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:28] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2022-06-08 23:16:29] [INFO ] [Real]Added 268 Read/Feed constraints in 111 ms returned sat
[2022-06-08 23:16:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:29] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-06-08 23:16:29] [INFO ] [Nat]Added 268 Read/Feed constraints in 129 ms returned sat
[2022-06-08 23:16:29] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 0 ms to minimize.
[2022-06-08 23:16:30] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 0 ms to minimize.
[2022-06-08 23:16:30] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 0 ms to minimize.
[2022-06-08 23:16:31] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 0 ms to minimize.
[2022-06-08 23:16:31] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 0 ms to minimize.
[2022-06-08 23:16:31] [INFO ] Deduced a trap composed of 18 places in 299 ms of which 0 ms to minimize.
[2022-06-08 23:16:32] [INFO ] Deduced a trap composed of 51 places in 295 ms of which 1 ms to minimize.
[2022-06-08 23:16:32] [INFO ] Deduced a trap composed of 39 places in 315 ms of which 0 ms to minimize.
[2022-06-08 23:16:32] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 0 ms to minimize.
[2022-06-08 23:16:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3245 ms
[2022-06-08 23:16:33] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 149 ms.
[2022-06-08 23:16:34] [INFO ] Deduced a trap composed of 12 places in 374 ms of which 0 ms to minimize.
[2022-06-08 23:16:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 23:16:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 23:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:34] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-06-08 23:16:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:35] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-08 23:16:35] [INFO ] [Nat]Added 268 Read/Feed constraints in 127 ms returned sat
[2022-06-08 23:16:35] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 0 ms to minimize.
[2022-06-08 23:16:36] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 0 ms to minimize.
[2022-06-08 23:16:36] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 0 ms to minimize.
[2022-06-08 23:16:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1190 ms
[2022-06-08 23:16:36] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 138 ms.
[2022-06-08 23:16:38] [INFO ] Deduced a trap composed of 108 places in 297 ms of which 1 ms to minimize.
[2022-06-08 23:16:38] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 1 ms to minimize.
[2022-06-08 23:16:39] [INFO ] Deduced a trap composed of 119 places in 279 ms of which 0 ms to minimize.
[2022-06-08 23:16:39] [INFO ] Deduced a trap composed of 118 places in 295 ms of which 0 ms to minimize.
[2022-06-08 23:16:40] [INFO ] Deduced a trap composed of 108 places in 299 ms of which 0 ms to minimize.
[2022-06-08 23:16:40] [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)
[2022-06-08 23:16:40] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:40] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2022-06-08 23:16:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:40] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2022-06-08 23:16:41] [INFO ] [Nat]Added 268 Read/Feed constraints in 131 ms returned sat
[2022-06-08 23:16:41] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:16:41] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:16:41] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2022-06-08 23:16:42] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2022-06-08 23:16:42] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-06-08 23:16:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1194 ms
[2022-06-08 23:16:42] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 138 ms.
[2022-06-08 23:16:44] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 1 ms to minimize.
[2022-06-08 23:16:44] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 10 ms to minimize.
[2022-06-08 23:16:45] [INFO ] Deduced a trap composed of 51 places in 247 ms of which 0 ms to minimize.
[2022-06-08 23:16:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1117 ms
[2022-06-08 23:16:45] [INFO ] Added : 88 causal constraints over 18 iterations in 3290 ms. Result :sat
Minimization took 34 ms.
[2022-06-08 23:16:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:45] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-06-08 23:16:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:46] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2022-06-08 23:16:46] [INFO ] [Nat]Added 268 Read/Feed constraints in 141 ms returned sat
[2022-06-08 23:16:46] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:16:46] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:16:47] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:16:47] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:16:47] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:16:47] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:16:48] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:16:48] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:16:48] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 0 ms to minimize.
[2022-06-08 23:16:49] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:16:49] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:16:49] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:16:49] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:16:50] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:16:50] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:16:50] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:16:50] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 1 ms to minimize.
[2022-06-08 23:16:50] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 1 ms to minimize.
[2022-06-08 23:16:51] [INFO ] Deduced a trap composed of 12 places in 371 ms of which 0 ms to minimize.
[2022-06-08 23:16:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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 23:16:51] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:51] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2022-06-08 23:16:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:52] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2022-06-08 23:16:52] [INFO ] [Nat]Added 268 Read/Feed constraints in 130 ms returned sat
[2022-06-08 23:16:52] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2022-06-08 23:16:52] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-06-08 23:16:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 459 ms
[2022-06-08 23:16:52] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 138 ms.
[2022-06-08 23:16:55] [INFO ] Deduced a trap composed of 70 places in 304 ms of which 0 ms to minimize.
[2022-06-08 23:16:55] [INFO ] Deduced a trap composed of 46 places in 314 ms of which 1 ms to minimize.
[2022-06-08 23:16:55] [INFO ] Deduced a trap composed of 55 places in 291 ms of which 0 ms to minimize.
[2022-06-08 23:16:56] [INFO ] Deduced a trap composed of 55 places in 290 ms of which 0 ms to minimize.
[2022-06-08 23:16:56] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 0 ms to minimize.
[2022-06-08 23:16:56] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 0 ms to minimize.
[2022-06-08 23:16:56] [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 5
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 23:16:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:57] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-06-08 23:16:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:57] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-06-08 23:16:57] [INFO ] [Nat]Added 268 Read/Feed constraints in 124 ms returned sat
[2022-06-08 23:16:58] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:16:58] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:16:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 565 ms
[2022-06-08 23:16:58] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 148 ms.
[2022-06-08 23:17:00] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 6 ms to minimize.
[2022-06-08 23:17:00] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 4 ms to minimize.
[2022-06-08 23:17:00] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 8 ms to minimize.
[2022-06-08 23:17:01] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:17:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1178 ms
[2022-06-08 23:17:01] [INFO ] Added : 64 causal constraints over 13 iterations in 2909 ms. Result :sat
Minimization took 379 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1, -1, 1] Max seen :[0, 2, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 893800 steps, including 3015 resets, run finished after 5986 ms. (steps per millisecond=149 ) properties (out of 7) seen :2 could not realise parikh vector
Support contains 7 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.25 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 6 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 253 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 23:17:08] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2037 ms. (steps per millisecond=490 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2167 ms. (steps per millisecond=461 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2080 ms. (steps per millisecond=480 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2090 ms. (steps per millisecond=478 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2095 ms. (steps per millisecond=477 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2091 ms. (steps per millisecond=478 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2074 ms. (steps per millisecond=482 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2094 ms. (steps per millisecond=477 ) properties (out of 7) seen :1
[2022-06-08 23:17:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:24] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-08 23:17:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-08 23:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:25] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-06-08 23:17:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:25] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2022-06-08 23:17:25] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:17:25] [INFO ] [Nat]Added 254 Read/Feed constraints in 140 ms returned sat
[2022-06-08 23:17:25] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:17:26] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:17:26] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:17:26] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 0 ms to minimize.
[2022-06-08 23:17:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1071 ms
[2022-06-08 23:17:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 135 ms.
[2022-06-08 23:17:29] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:17:29] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 0 ms to minimize.
[2022-06-08 23:17:29] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2022-06-08 23:17:30] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:17:30] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 1 ms to minimize.
[2022-06-08 23:17:30] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2022-06-08 23:17:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1701 ms
[2022-06-08 23:17:31] [INFO ] Added : 101 causal constraints over 23 iterations in 4424 ms. Result :sat
Minimization took 449 ms.
[2022-06-08 23:17:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:32] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-06-08 23:17:32] [INFO ] [Real]Added 254 Read/Feed constraints in 105 ms returned sat
[2022-06-08 23:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:32] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-06-08 23:17:32] [INFO ] [Nat]Added 254 Read/Feed constraints in 114 ms returned sat
[2022-06-08 23:17:32] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:17:33] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:17:33] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:17:33] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 0 ms to minimize.
[2022-06-08 23:17:33] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:17:34] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:17:34] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:17:34] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:17:34] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:17:35] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:17:35] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:17:35] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:17:35] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 0 ms to minimize.
[2022-06-08 23:17:36] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 1 ms to minimize.
[2022-06-08 23:17:36] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 0 ms to minimize.
[2022-06-08 23:17:36] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:17:36] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 0 ms to minimize.
[2022-06-08 23:17:37] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:17:37] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 0 ms to minimize.
[2022-06-08 23:17:37] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:17:37] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 0 ms to minimize.
[2022-06-08 23:17:38] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:17:38] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:17:38] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 0 ms to minimize.
[2022-06-08 23:17:38] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 1 ms to minimize.
[2022-06-08 23:17:38] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6266 ms
[2022-06-08 23:17:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 139 ms.
[2022-06-08 23:17:40] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:17:41] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:17:41] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:17:41] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:17:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1160 ms
[2022-06-08 23:17:41] [INFO ] Added : 75 causal constraints over 15 iterations in 3012 ms. Result :sat
Minimization took 439 ms.
[2022-06-08 23:17:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:42] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-06-08 23:17:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:43] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2022-06-08 23:17:43] [INFO ] [Nat]Added 254 Read/Feed constraints in 121 ms returned sat
[2022-06-08 23:17:43] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:17:43] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:17:44] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:17:44] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 0 ms to minimize.
[2022-06-08 23:17:44] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2022-06-08 23:17:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1232 ms
[2022-06-08 23:17:44] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 137 ms.
[2022-06-08 23:17:46] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:17:46] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:17:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 615 ms
[2022-06-08 23:17:47] [INFO ] Added : 75 causal constraints over 15 iterations in 2486 ms. Result :sat
Minimization took 326 ms.
[2022-06-08 23:17:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:47] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2022-06-08 23:17:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:48] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2022-06-08 23:17:48] [INFO ] [Nat]Added 254 Read/Feed constraints in 125 ms returned sat
[2022-06-08 23:17:48] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:17:48] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:17:49] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:17:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 815 ms
[2022-06-08 23:17:49] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 144 ms.
[2022-06-08 23:17:51] [INFO ] Added : 99 causal constraints over 20 iterations in 2366 ms. Result :sat
Minimization took 401 ms.
[2022-06-08 23:17:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:52] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-06-08 23:17:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:52] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2022-06-08 23:17:52] [INFO ] [Nat]Added 254 Read/Feed constraints in 124 ms returned sat
[2022-06-08 23:17:53] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:17:53] [INFO ] Deduced a trap composed of 78 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:17:53] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 1 ms to minimize.
[2022-06-08 23:17:53] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 1 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 1 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:17:56] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:17:56] [INFO ] Deduced a trap composed of 71 places in 220 ms of which 1 ms to minimize.
[2022-06-08 23:17:56] [INFO ] Deduced a trap composed of 61 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:17:56] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:17:57] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:17:57] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:17:57] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 1 ms to minimize.
[2022-06-08 23:17:57] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:17:58] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:17:58] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:17:58] [INFO ] Deduced a trap composed of 60 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:17:59] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 1 ms to minimize.
[2022-06-08 23:17:59] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:17:59] [INFO ] Deduced a trap composed of 62 places in 181 ms of which 1 ms to minimize.
[2022-06-08 23:17:59] [INFO ] Deduced a trap composed of 62 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:18:00] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:18:00] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:18:00] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:18:00] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:18:01] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 1 ms to minimize.
[2022-06-08 23:18:01] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:18:01] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:18:01] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 1 ms to minimize.
[2022-06-08 23:18:02] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:18:02] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:18:02] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:18:02] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:18:03] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 1 ms to minimize.
[2022-06-08 23:18:03] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:18:03] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:18:03] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:18:04] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:18:04] [INFO ] Deduced a trap composed of 59 places in 193 ms of which 1 ms to minimize.
[2022-06-08 23:18:04] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:18:05] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:18:05] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:18:05] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 1 ms to minimize.
[2022-06-08 23:18:05] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:18:06] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:18:06] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:18:06] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:18:06] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:18:07] [INFO ] Deduced a trap composed of 62 places in 188 ms of which 1 ms to minimize.
[2022-06-08 23:18:07] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:18:07] [INFO ] Deduced a trap composed of 83 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:18:07] [INFO ] Deduced a trap composed of 83 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:18:08] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:18:08] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:18:08] [INFO ] Deduced a trap composed of 60 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:18:08] [INFO ] Deduced a trap composed of 62 places in 182 ms of which 1 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 60 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 1 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 1 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 1 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:18:11] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:18:11] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 0 ms to minimize.
[2022-06-08 23:18:11] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:18:11] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 0 ms to minimize.
[2022-06-08 23:18:12] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 0 ms to minimize.
[2022-06-08 23:18:12] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 0 ms to minimize.
[2022-06-08 23:18:12] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 0 ms to minimize.
[2022-06-08 23:18:12] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 1 ms to minimize.
[2022-06-08 23:18:13] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 0 ms to minimize.
[2022-06-08 23:18:13] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 20363 ms
[2022-06-08 23:18:13] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 133 ms.
[2022-06-08 23:18:15] [INFO ] Added : 97 causal constraints over 20 iterations in 2227 ms. Result :sat
Minimization took 704 ms.
[2022-06-08 23:18:16] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 23:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:16] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-06-08 23:18:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:18:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:16] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-06-08 23:18:16] [INFO ] [Nat]Added 254 Read/Feed constraints in 131 ms returned sat
[2022-06-08 23:18:17] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 1 ms to minimize.
[2022-06-08 23:18:17] [INFO ] Deduced a trap composed of 68 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:18:17] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 1 ms to minimize.
[2022-06-08 23:18:18] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:18:18] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:18:18] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 1 ms to minimize.
[2022-06-08 23:18:18] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:18:19] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:18:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2164 ms
[2022-06-08 23:18:19] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2022-06-08 23:18:20] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 0 ms to minimize.
[2022-06-08 23:18:21] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 1 ms to minimize.
[2022-06-08 23:18:21] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 0 ms to minimize.
[2022-06-08 23:18:22] [INFO ] Deduced a trap composed of 18 places in 299 ms of which 0 ms to minimize.
[2022-06-08 23:18:22] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 1 ms to minimize.
[2022-06-08 23:18:22] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 1 ms to minimize.
[2022-06-08 23:18:23] [INFO ] Deduced a trap composed of 114 places in 264 ms of which 0 ms to minimize.
[2022-06-08 23:18:23] [INFO ] Deduced a trap composed of 114 places in 270 ms of which 1 ms to minimize.
[2022-06-08 23:18:24] [INFO ] Deduced a trap composed of 112 places in 265 ms of which 1 ms to minimize.
[2022-06-08 23:18:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3537 ms
[2022-06-08 23:18:24] [INFO ] Added : 59 causal constraints over 13 iterations in 5294 ms. Result :sat
Minimization took 389 ms.
[2022-06-08 23:18:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:25] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2022-06-08 23:18:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:18:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:25] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-06-08 23:18:25] [INFO ] [Nat]Added 254 Read/Feed constraints in 117 ms returned sat
[2022-06-08 23:18:26] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2022-06-08 23:18:26] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:18:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 595 ms
[2022-06-08 23:18:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 136 ms.
[2022-06-08 23:18:28] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2022-06-08 23:18:29] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:18:29] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:18:29] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:18:29] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2022-06-08 23:18:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1396 ms
[2022-06-08 23:18:30] [INFO ] Added : 99 causal constraints over 20 iterations in 3807 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 1, -1, -1, 1] Max seen :[0, 2, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 758200 steps, including 1000 resets, run finished after 8127 ms. (steps per millisecond=93 ) properties (out of 7) seen :1 could not realise parikh vector
Incomplete Parikh walk after 619600 steps, including 999 resets, run finished after 6624 ms. (steps per millisecond=93 ) properties (out of 7) seen :1 could not realise parikh vector
Incomplete Parikh walk after 489200 steps, including 1000 resets, run finished after 4579 ms. (steps per millisecond=106 ) properties (out of 7) seen :2 could not realise parikh vector
Incomplete Parikh walk after 628200 steps, including 1000 resets, run finished after 5806 ms. (steps per millisecond=108 ) properties (out of 7) seen :1 could not realise parikh vector
Incomplete Parikh walk after 719000 steps, including 1000 resets, run finished after 6669 ms. (steps per millisecond=107 ) properties (out of 7) seen :1 could not realise parikh vector
Incomplete Parikh walk after 612500 steps, including 1000 resets, run finished after 5689 ms. (steps per millisecond=107 ) properties (out of 7) seen :1 could not realise parikh vector
Incomplete Parikh walk after 635100 steps, including 924 resets, run finished after 7052 ms. (steps per millisecond=90 ) properties (out of 7) seen :1 could not realise parikh vector
Support contains 7 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 44 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 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:19:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:15] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-08 23:19:15] [INFO ] Implicit Places using invariants in 322 ms returned []
[2022-06-08 23:19:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:15] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-08 23:19:15] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:19:19] [INFO ] Implicit Places using invariants and state equation in 4284 ms returned []
Implicit Place search using SMT with State Equation took 4607 ms to find 0 implicit places.
[2022-06-08 23:19:20] [INFO ] Redundant transitions in 214 ms returned []
[2022-06-08 23:19:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:20] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 23:19:20] [INFO ] Dead Transitions using invariants and state equation in 691 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-00
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:20] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10011 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-08 23:19:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:20] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:19:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:21] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-06-08 23:19:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:19:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:21] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-06-08 23:19:21] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:19:21] [INFO ] [Nat]Added 254 Read/Feed constraints in 143 ms returned sat
[2022-06-08 23:19:22] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:19:22] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 1 ms to minimize.
[2022-06-08 23:19:22] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:19:22] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:19:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1107 ms
[2022-06-08 23:19:23] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 140 ms.
[2022-06-08 23:19:25] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:25] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 1 ms to minimize.
[2022-06-08 23:19:25] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:19:26] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:19:26] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 0 ms to minimize.
[2022-06-08 23:19:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 23:19:26] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1759 ms. (steps per millisecond=568 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2117 ms. (steps per millisecond=472 ) properties (out of 1) seen :0
[2022-06-08 23:19:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:30] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 23:19:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:30] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-06-08 23:19:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:19:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:31] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2022-06-08 23:19:31] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:19:31] [INFO ] [Nat]Added 254 Read/Feed constraints in 136 ms returned sat
[2022-06-08 23:19:31] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 1 ms to minimize.
[2022-06-08 23:19:32] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:19:32] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:19:32] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 1 ms to minimize.
[2022-06-08 23:19:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1065 ms
[2022-06-08 23:19:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 134 ms.
[2022-06-08 23:19:35] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:19:35] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:19:35] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:19:35] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:19:36] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:19:36] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:19:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1729 ms
[2022-06-08 23:19:37] [INFO ] Added : 101 causal constraints over 23 iterations in 4490 ms. Result :sat
Minimization took 466 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 635100 steps, including 925 resets, run finished after 7144 ms. (steps per millisecond=88 ) 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 35 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:19:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:44] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-08 23:19:45] [INFO ] Implicit Places using invariants in 296 ms returned []
[2022-06-08 23:19:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:45] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:19:45] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:19:49] [INFO ] Implicit Places using invariants and state equation in 4550 ms returned []
Implicit Place search using SMT with State Equation took 4849 ms to find 0 implicit places.
[2022-06-08 23:19:49] [INFO ] Redundant transitions in 214 ms returned []
[2022-06-08 23:19:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:49] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 23:19:50] [INFO ] Dead Transitions using invariants and state equation in 709 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-00 in 29805 ms.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-01
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:50] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :3
[2022-06-08 23:19:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:50] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:19:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:51] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2022-06-08 23:19:51] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:19:51] [INFO ] [Real]Added 254 Read/Feed constraints in 115 ms returned sat
[2022-06-08 23:19:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:19:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:19:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:51] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2022-06-08 23:19:51] [INFO ] [Nat]Added 254 Read/Feed constraints in 124 ms returned sat
[2022-06-08 23:19:52] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 1 ms to minimize.
[2022-06-08 23:19:52] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:19:52] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 1 ms to minimize.
[2022-06-08 23:19:52] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:19:53] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2022-06-08 23:19:53] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:19:53] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:19:53] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:19:54] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:19:54] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 1 ms to minimize.
[2022-06-08 23:19:54] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:19:54] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:19:55] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:19:55] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 1 ms to minimize.
[2022-06-08 23:19:55] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 1 ms to minimize.
[2022-06-08 23:19:55] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
[2022-06-08 23:19:56] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:19:56] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 1 ms to minimize.
[2022-06-08 23:19:56] [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.verifyPossible(DeadlockTester.java:588)
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 :[3]
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 49 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 23:19:56] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1513 ms. (steps per millisecond=660 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1887 ms. (steps per millisecond=529 ) properties (out of 1) seen :2
[2022-06-08 23:19:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:19:59] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 23:19:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 23:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:00] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-06-08 23:20:00] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:00] [INFO ] [Real]Added 254 Read/Feed constraints in 113 ms returned sat
[2022-06-08 23:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:00] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2022-06-08 23:20:01] [INFO ] [Nat]Added 254 Read/Feed constraints in 121 ms returned sat
[2022-06-08 23:20:01] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:01] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:20:01] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:20:02] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:02] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:02] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:20:02] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:20:03] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:20:03] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2022-06-08 23:20:03] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:20:03] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:20:04] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:20:04] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:20:04] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 0 ms to minimize.
[2022-06-08 23:20:04] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:20:05] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:20:05] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 0 ms to minimize.
[2022-06-08 23:20:05] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:20:05] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:20:05] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 1 ms to minimize.
[2022-06-08 23:20:06] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 0 ms to minimize.
[2022-06-08 23:20:06] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 0 ms to minimize.
[2022-06-08 23:20:06] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 0 ms to minimize.
[2022-06-08 23:20:06] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 0 ms to minimize.
[2022-06-08 23:20:07] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:20:07] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 0 ms to minimize.
[2022-06-08 23:20:07] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:20:07] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 0 ms to minimize.
[2022-06-08 23:20:08] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 0 ms to minimize.
[2022-06-08 23:20:08] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 0 ms to minimize.
[2022-06-08 23:20:08] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 1 ms to minimize.
[2022-06-08 23:20:08] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 1 ms to minimize.
[2022-06-08 23:20:08] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7905 ms
[2022-06-08 23:20:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 138 ms.
[2022-06-08 23:20:11] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:20:11] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2022-06-08 23:20:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 606 ms
[2022-06-08 23:20:11] [INFO ] Added : 100 causal constraints over 20 iterations in 2977 ms. Result :sat
Minimization took 436 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Incomplete Parikh walk after 919700 steps, including 1000 resets, run finished after 8618 ms. (steps per millisecond=106 ) properties (out of 1) seen :1 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 23:20:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:21] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 23:20:21] [INFO ] Implicit Places using invariants in 305 ms returned []
[2022-06-08 23:20:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:21] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:20:21] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:26] [INFO ] Implicit Places using invariants and state equation in 4695 ms returned []
Implicit Place search using SMT with State Equation took 5002 ms to find 0 implicit places.
[2022-06-08 23:20:26] [INFO ] Redundant transitions in 64 ms returned []
[2022-06-08 23:20:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:26] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 23:20:26] [INFO ] Dead Transitions using invariants and state equation in 700 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-01 in 36246 ms.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-02
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:26] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2022-06-08 23:20:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:26] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-08 23:20:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:27] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2022-06-08 23:20:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:20:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:27] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-06-08 23:20:27] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:27] [INFO ] [Nat]Added 254 Read/Feed constraints in 125 ms returned sat
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 1 ms to minimize.
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:20:28] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-06-08 23:20:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1255 ms
[2022-06-08 23:20:29] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 137 ms.
[2022-06-08 23:20:31] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:20:31] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:20:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2022-06-08 23:20:31] [INFO ] Added : 75 causal constraints over 15 iterations in 2521 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 719000 steps, including 1000 resets, run finished after 6717 ms. (steps per millisecond=107 ) 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.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:38] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 1930 ms. (steps per millisecond=518 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2123 ms. (steps per millisecond=471 ) properties (out of 1) seen :0
[2022-06-08 23:20:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:42] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 23:20:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:43] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-06-08 23:20:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:43] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-06-08 23:20:43] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:43] [INFO ] [Nat]Added 254 Read/Feed constraints in 127 ms returned sat
[2022-06-08 23:20:43] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:20:44] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 0 ms to minimize.
[2022-06-08 23:20:44] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:20:44] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:20:44] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2022-06-08 23:20:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1258 ms
[2022-06-08 23:20:45] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 140 ms.
[2022-06-08 23:20:46] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:20:47] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:20:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 608 ms
[2022-06-08 23:20:47] [INFO ] Added : 75 causal constraints over 15 iterations in 2478 ms. Result :sat
Minimization took 320 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 719000 steps, including 1000 resets, run finished after 6688 ms. (steps per millisecond=107 ) 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 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.
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 23:20:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:54] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:20:54] [INFO ] Implicit Places using invariants in 299 ms returned []
[2022-06-08 23:20:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:54] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:20:55] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:59] [INFO ] Implicit Places using invariants and state equation in 4575 ms returned []
Implicit Place search using SMT with State Equation took 4876 ms to find 0 implicit places.
[2022-06-08 23:20:59] [INFO ] Redundant transitions in 67 ms returned []
[2022-06-08 23:20:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:59] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 23:21:00] [INFO ] Dead Transitions using invariants and state equation in 713 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-02 in 33358 ms.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-04
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:00] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10019 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-08 23:21:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:00] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 23:21:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:00] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-06-08 23:21:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:01] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2022-06-08 23:21:01] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:21:01] [INFO ] [Nat]Added 254 Read/Feed constraints in 135 ms returned sat
[2022-06-08 23:21:01] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:21:01] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:21:01] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:21:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 850 ms
[2022-06-08 23:21:02] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2022-06-08 23:21:04] [INFO ] Added : 99 causal constraints over 20 iterations in 2419 ms. Result :sat
Minimization took 437 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 628200 steps, including 1000 resets, run finished after 5990 ms. (steps per millisecond=104 ) 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 33 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 23:21:11] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 1797 ms. (steps per millisecond=556 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2142 ms. (steps per millisecond=466 ) properties (out of 1) seen :0
[2022-06-08 23:21:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:14] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:21:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:15] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2022-06-08 23:21:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:15] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2022-06-08 23:21:15] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:21:15] [INFO ] [Nat]Added 254 Read/Feed constraints in 129 ms returned sat
[2022-06-08 23:21:16] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:16] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:21:16] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2022-06-08 23:21:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 874 ms
[2022-06-08 23:21:16] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 144 ms.
[2022-06-08 23:21:19] [INFO ] Added : 99 causal constraints over 20 iterations in 2412 ms. Result :sat
Minimization took 428 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 628200 steps, including 1000 resets, run finished after 5982 ms. (steps per millisecond=105 ) 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 40 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 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:21:25] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:25] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:21:26] [INFO ] Implicit Places using invariants in 308 ms returned []
[2022-06-08 23:21:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:26] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:21:26] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:21:31] [INFO ] Implicit Places using invariants and state equation in 5044 ms returned []
Implicit Place search using SMT with State Equation took 5353 ms to find 0 implicit places.
[2022-06-08 23:21:31] [INFO ] Redundant transitions in 67 ms returned []
[2022-06-08 23:21:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:31] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 23:21:31] [INFO ] Dead Transitions using invariants and state equation in 720 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-04 in 31698 ms.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-10
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:31] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-08 23:21:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:31] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 23:21:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:32] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2022-06-08 23:21:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:32] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-06-08 23:21:32] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:21:32] [INFO ] [Nat]Added 254 Read/Feed constraints in 133 ms returned sat
[2022-06-08 23:21:33] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:21:33] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:21:33] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 1 ms to minimize.
[2022-06-08 23:21:33] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:21:34] [INFO ] Deduced a trap composed of 67 places in 211 ms of which 1 ms to minimize.
[2022-06-08 23:21:34] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:21:34] [INFO ] Deduced a trap composed of 84 places in 225 ms of which 0 ms to minimize.
[2022-06-08 23:21:35] [INFO ] Deduced a trap composed of 59 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:21:35] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:21:35] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:21:35] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:21:36] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:21:36] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 1 ms to minimize.
[2022-06-08 23:21:36] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:21:37] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:21:37] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:21:37] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:37] [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.verifyPossible(DeadlockTester.java:588)
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 32 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 23:21:37] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000019 steps, including 2 resets, run finished after 1786 ms. (steps per millisecond=559 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2173 ms. (steps per millisecond=460 ) properties (out of 1) seen :0
[2022-06-08 23:21:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:41] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 23:21:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:41] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2022-06-08 23:21:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:42] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2022-06-08 23:21:42] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:21:42] [INFO ] [Nat]Added 254 Read/Feed constraints in 136 ms returned sat
[2022-06-08 23:21:42] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:21:43] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:21:43] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:21:43] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:21:43] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:21:44] [INFO ] Deduced a trap composed of 67 places in 208 ms of which 1 ms to minimize.
[2022-06-08 23:21:44] [INFO ] Deduced a trap composed of 84 places in 216 ms of which 1 ms to minimize.
[2022-06-08 23:21:44] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 1 ms to minimize.
[2022-06-08 23:21:45] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:21:45] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:21:45] [INFO ] Deduced a trap composed of 59 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:21:45] [INFO ] Deduced a trap composed of 60 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:21:46] [INFO ] Deduced a trap composed of 71 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:21:46] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:21:46] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 1 ms to minimize.
[2022-06-08 23:21:47] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:21:47] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:21:47] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:21:47] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 1 ms to minimize.
[2022-06-08 23:21:48] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:21:48] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:21:48] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:21:48] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 1 ms to minimize.
[2022-06-08 23:21:49] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:21:49] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:21:49] [INFO ] Deduced a trap composed of 62 places in 198 ms of which 1 ms to minimize.
[2022-06-08 23:21:50] [INFO ] Deduced a trap composed of 62 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:21:50] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:21:50] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:21:50] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:21:51] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:21:51] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:21:51] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:21:51] [INFO ] Deduced a trap composed of 48 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:21:52] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:52] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 1 ms to minimize.
[2022-06-08 23:21:52] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2022-06-08 23:21:53] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:21:53] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:21:53] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:21:53] [INFO ] Deduced a trap composed of 82 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:54] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:21:54] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:21:54] [INFO ] Deduced a trap composed of 58 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:21:55] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 1 ms to minimize.
[2022-06-08 23:21:55] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 1 ms to minimize.
[2022-06-08 23:21:55] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:21:55] [INFO ] Deduced a trap composed of 59 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:21:56] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:21:56] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 1 ms to minimize.
[2022-06-08 23:21:56] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:21:56] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:57] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:21:57] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:21:57] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:21:58] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 1 ms to minimize.
[2022-06-08 23:21:58] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:21:58] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 1 ms to minimize.
[2022-06-08 23:21:58] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:21:59] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:21:59] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:21:59] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:22:00] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 1 ms to minimize.
[2022-06-08 23:22:00] [INFO ] Deduced a trap composed of 63 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:22:00] [INFO ] Deduced a trap composed of 60 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:22:00] [INFO ] Deduced a trap composed of 64 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:22:01] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:22:01] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:22:01] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:22:01] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 1 ms to minimize.
[2022-06-08 23:22:02] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:22:02] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:22:02] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:22:02] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:22:03] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:22:03] [INFO ] Deduced a trap composed of 78 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:22:03] [INFO ] Deduced a trap composed of 78 places in 181 ms of which 0 ms to minimize.
[2022-06-08 23:22:04] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 1 ms to minimize.
[2022-06-08 23:22:04] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:22:04] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 21805 ms
[2022-06-08 23:22:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 157 ms.
[2022-06-08 23:22:06] [INFO ] Added : 97 causal constraints over 20 iterations in 2447 ms. Result :sat
Minimization took 767 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 489200 steps, including 1000 resets, run finished after 4669 ms. (steps per millisecond=104 ) 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 33 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 32 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:22:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:12] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 23:22:12] [INFO ] Implicit Places using invariants in 288 ms returned []
[2022-06-08 23:22:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:12] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-08 23:22:13] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:17] [INFO ] Implicit Places using invariants and state equation in 4854 ms returned []
Implicit Place search using SMT with State Equation took 5144 ms to find 0 implicit places.
[2022-06-08 23:22:17] [INFO ] Redundant transitions in 61 ms returned []
[2022-06-08 23:22:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:17] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:22:18] [INFO ] Dead Transitions using invariants and state equation in 722 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-10 in 46404 ms.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-11
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:18] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10022 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2022-06-08 23:22:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:18] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 23:22:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:18] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2022-06-08 23:22:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:22:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:19] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2022-06-08 23:22:19] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:19] [INFO ] [Nat]Added 254 Read/Feed constraints in 146 ms returned sat
[2022-06-08 23:22:19] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:22:19] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:22:20] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 1 ms to minimize.
[2022-06-08 23:22:20] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:22:20] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:22:20] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:22:21] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:22:21] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:22:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2251 ms
[2022-06-08 23:22:21] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2022-06-08 23:22:23] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 0 ms to minimize.
[2022-06-08 23:22:23] [INFO ] Deduced a trap composed of 16 places in 316 ms of which 0 ms to minimize.
[2022-06-08 23:22: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 32 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 23:22:23] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2167 ms. (steps per millisecond=461 ) properties (out of 1) seen :0
[2022-06-08 23:22:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:27] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 23:22:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:28] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2022-06-08 23:22:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:22:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:28] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2022-06-08 23:22:28] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:28] [INFO ] [Nat]Added 254 Read/Feed constraints in 151 ms returned sat
[2022-06-08 23:22:29] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 1 ms to minimize.
[2022-06-08 23:22:29] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:22:29] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 0 ms to minimize.
[2022-06-08 23:22:29] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:22:30] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 1 ms to minimize.
[2022-06-08 23:22:30] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 1 ms to minimize.
[2022-06-08 23:22:30] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 1 ms to minimize.
[2022-06-08 23:22:30] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:22:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2265 ms
[2022-06-08 23:22:31] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 144 ms.
[2022-06-08 23:22:32] [INFO ] Deduced a trap composed of 35 places in 319 ms of which 0 ms to minimize.
[2022-06-08 23:22:33] [INFO ] Deduced a trap composed of 16 places in 353 ms of which 0 ms to minimize.
[2022-06-08 23:22:33] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 0 ms to minimize.
[2022-06-08 23:22:34] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 1 ms to minimize.
[2022-06-08 23:22:34] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 0 ms to minimize.
[2022-06-08 23:22:35] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 1 ms to minimize.
[2022-06-08 23:22:35] [INFO ] Deduced a trap composed of 114 places in 279 ms of which 0 ms to minimize.
[2022-06-08 23:22:35] [INFO ] Deduced a trap composed of 114 places in 279 ms of which 0 ms to minimize.
[2022-06-08 23:22:36] [INFO ] Deduced a trap composed of 112 places in 288 ms of which 1 ms to minimize.
[2022-06-08 23:22:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3745 ms
[2022-06-08 23:22:36] [INFO ] Added : 59 causal constraints over 13 iterations in 5579 ms. Result :sat
Minimization took 409 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 619600 steps, including 989 resets, run finished after 6738 ms. (steps per millisecond=91 ) 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 32 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 31 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:22:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:43] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:22:44] [INFO ] Implicit Places using invariants in 304 ms returned []
[2022-06-08 23:22:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:44] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 23:22:44] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:49] [INFO ] Implicit Places using invariants and state equation in 4862 ms returned []
Implicit Place search using SMT with State Equation took 5168 ms to find 0 implicit places.
[2022-06-08 23:22:49] [INFO ] Redundant transitions in 68 ms returned []
[2022-06-08 23:22:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:49] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-08 23:22:49] [INFO ] Dead Transitions using invariants and state equation in 718 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-11 in 31547 ms.
Starting property specific reduction for BugTracking-PT-q3m032-UpperBounds-14
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:49] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2022-06-08 23:22:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:49] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:22:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:50] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-06-08 23:22:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:22:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:50] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-06-08 23:22:50] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:50] [INFO ] [Nat]Added 254 Read/Feed constraints in 133 ms returned sat
[2022-06-08 23:22:51] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:22:51] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:22:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
[2022-06-08 23:22:51] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2022-06-08 23:22:54] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2022-06-08 23:22:54] [INFO ] Deduced a trap composed of 74 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:22:54] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:22:54] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:22:55] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2022-06-08 23:22:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1471 ms
[2022-06-08 23:22:55] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 0 ms to minimize.
[2022-06-08 23:22:55] [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 33 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 23:22:55] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1912 ms. (steps per millisecond=523 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2144 ms. (steps per millisecond=466 ) properties (out of 1) seen :0
[2022-06-08 23:22:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:59] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-08 23:22:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:23:00] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2022-06-08 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:23:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:23:00] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-06-08 23:23:00] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:23:00] [INFO ] [Nat]Added 254 Read/Feed constraints in 130 ms returned sat
[2022-06-08 23:23:01] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:23:01] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 1 ms to minimize.
[2022-06-08 23:23:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 608 ms
[2022-06-08 23:23:01] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 160 ms.
[2022-06-08 23:23:03] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2022-06-08 23:23:04] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:23:04] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 1 ms to minimize.
[2022-06-08 23:23:04] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:23:05] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 0 ms to minimize.
[2022-06-08 23:23:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1476 ms
[2022-06-08 23:23:05] [INFO ] Added : 99 causal constraints over 20 iterations in 4001 ms. Result :sat
Minimization took 449 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 758200 steps, including 1000 resets, run finished after 8287 ms. (steps per millisecond=91 ) 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 31 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 31 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:23:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:23:14] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:23:14] [INFO ] Implicit Places using invariants in 308 ms returned []
[2022-06-08 23:23:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:23:14] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:23:14] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:23:19] [INFO ] Implicit Places using invariants and state equation in 4850 ms returned []
Implicit Place search using SMT with State Equation took 5158 ms to find 0 implicit places.
[2022-06-08 23:23:19] [INFO ] Redundant transitions in 60 ms returned []
[2022-06-08 23:23:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:23:19] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-08 23:23:20] [INFO ] Dead Transitions using invariants and state equation in 697 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m032-UpperBounds-14 in 30322 ms.
[2022-06-08 23:23:20] [INFO ] Flatten gal took : 278 ms
[2022-06-08 23:23:20] [INFO ] Applying decomposition
[2022-06-08 23:23:21] [INFO ] Flatten gal took : 165 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/graph13155591236240748535.txt, -o, /tmp/graph13155591236240748535.bin, -w, /tmp/graph13155591236240748535.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/graph13155591236240748535.bin, -l, -1, -v, -w, /tmp/graph13155591236240748535.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:23:21] [INFO ] Decomposing Gal with order
[2022-06-08 23:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:23:21] [INFO ] Removed a total of 280 redundant transitions.
[2022-06-08 23:23:21] [INFO ] Flatten gal took : 359 ms
[2022-06-08 23:23:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 19 ms.
[2022-06-08 23:23:22] [INFO ] Time to serialize gal into /tmp/UpperBounds15448394559834991128.gal : 60 ms
[2022-06-08 23:23:22] [INFO ] Time to serialize properties into /tmp/UpperBounds18203219423909168235.prop : 1 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/UpperBounds15448394559834991128.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds18203219423909168235.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/UpperBounds15448394559834991128.gal -t CGAL -reachable-file /tmp/UpperBounds18203219423909168235.prop --nowitness
Loading property file /tmp/UpperBounds18203219423909168235.prop.
Detected timeout of ITS tools.
[2022-06-08 23:45:50] [INFO ] Flatten gal took : 605 ms
[2022-06-08 23:45:51] [INFO ] Time to serialize gal into /tmp/UpperBounds13170999876235448386.gal : 79 ms
[2022-06-08 23:45:51] [INFO ] Time to serialize properties into /tmp/UpperBounds17712070658293642076.prop : 1 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/UpperBounds13170999876235448386.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17712070658293642076.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/UpperBounds13170999876235448386.gal -t CGAL -reachable-file /tmp/UpperBounds17712070658293642076.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds17712070658293642076.prop.
Detected timeout of ITS tools.
[2022-06-09 00:08:11] [INFO ] Flatten gal took : 436 ms
[2022-06-09 00:08:14] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-09 00:08:14] [INFO ] Transformed 229 places.
[2022-06-09 00:08:14] [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-09 00:08:14] [INFO ] Time to serialize gal into /tmp/UpperBounds1807343013185495238.gal : 10 ms
[2022-06-09 00:08:14] [INFO ] Time to serialize properties into /tmp/UpperBounds15411167554721214462.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/UpperBounds1807343013185495238.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15411167554721214462.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/UpperBounds1807343013185495238.gal -t CGAL -reachable-file /tmp/UpperBounds15411167554721214462.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/UpperBounds15411167554721214462.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-q3m032"
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-q3m032, 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-165472292500013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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