Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414700256.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BugTracking-PT-q8m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700256
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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-q8m016-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716646691510

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 14:18:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 14:18:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:18:14] [INFO ] Load time of PNML (sax parser for PT used): 837 ms
[2024-05-25 14:18:14] [INFO ] Transformed 754 places.
[2024-05-25 14:18:14] [INFO ] Transformed 27370 transitions.
[2024-05-25 14:18:14] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1031 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 474 places in 165 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2024-05-25 14:18:15] [INFO ] Computed 10 invariants in 73 ms
Incomplete random walk after 10003 steps, including 42 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 6) seen :3
FORMULA BugTracking-PT-q8m016-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :1
[2024-05-25 14:18:15] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-25 14:18:15] [INFO ] Computed 10 invariants in 33 ms
[2024-05-25 14:18:15] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-25 14:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:16] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-25 14:18:16] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-25 14:18:16] [INFO ] [Real]Added 303 Read/Feed constraints in 52 ms returned sat
[2024-05-25 14:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:18:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:17] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2024-05-25 14:18:17] [INFO ] [Nat]Added 303 Read/Feed constraints in 297 ms returned sat
[2024-05-25 14:18:18] [INFO ] Deduced a trap composed of 43 places in 688 ms of which 4 ms to minimize.
[2024-05-25 14:18:19] [INFO ] Deduced a trap composed of 29 places in 490 ms of which 1 ms to minimize.
[2024-05-25 14:18:20] [INFO ] Deduced a trap composed of 12 places in 1012 ms of which 1 ms to minimize.
[2024-05-25 14:18:20] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 2 ms to minimize.
[2024-05-25 14:18:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2960 ms
[2024-05-25 14:18:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 362 ms.
[2024-05-25 14:18:22] [INFO ] Deduced a trap composed of 15 places in 785 ms of which 2 ms to minimize.
[2024-05-25 14:18:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:18:22] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:23] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2024-05-25 14:18:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:18:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 14:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:24] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2024-05-25 14:18:24] [INFO ] [Nat]Added 303 Read/Feed constraints in 205 ms returned sat
[2024-05-25 14:18:24] [INFO ] Deduced a trap composed of 50 places in 437 ms of which 1 ms to minimize.
[2024-05-25 14:18:25] [INFO ] Deduced a trap composed of 12 places in 522 ms of which 1 ms to minimize.
[2024-05-25 14:18:26] [INFO ] Deduced a trap composed of 65 places in 565 ms of which 2 ms to minimize.
[2024-05-25 14:18:26] [INFO ] Deduced a trap composed of 90 places in 522 ms of which 0 ms to minimize.
[2024-05-25 14:18:27] [INFO ] Deduced a trap composed of 59 places in 374 ms of which 0 ms to minimize.
[2024-05-25 14:18:27] [INFO ] Deduced a trap composed of 9 places in 364 ms of which 1 ms to minimize.
[2024-05-25 14:18:28] [INFO ] Deduced a trap composed of 24 places in 421 ms of which 0 ms to minimize.
[2024-05-25 14:18:28] [INFO ] Deduced a trap composed of 17 places in 475 ms of which 1 ms to minimize.
[2024-05-25 14:18: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:18:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 14:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:29] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2024-05-25 14:18:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:18:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 14:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:30] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2024-05-25 14:18:30] [INFO ] [Nat]Added 303 Read/Feed constraints in 74 ms returned sat
[2024-05-25 14:18:30] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 547 ms.
[2024-05-25 14:18:32] [INFO ] Deduced a trap composed of 17 places in 524 ms of which 0 ms to minimize.
[2024-05-25 14:18:33] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 1 ms to minimize.
[2024-05-25 14:18:33] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 1 ms to minimize.
[2024-05-25 14:18:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1815 ms
[2024-05-25 14:18:34] [INFO ] Added : 15 causal constraints over 4 iterations in 3923 ms. Result :sat
[2024-05-25 14:18:34] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:35] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2024-05-25 14:18:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:18:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:35] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2024-05-25 14:18:35] [INFO ] [Nat]Added 303 Read/Feed constraints in 88 ms returned sat
[2024-05-25 14:18:36] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 295 ms.
[2024-05-25 14:18:37] [INFO ] Deduced a trap composed of 64 places in 357 ms of which 1 ms to minimize.
[2024-05-25 14:18:38] [INFO ] Deduced a trap composed of 62 places in 407 ms of which 1 ms to minimize.
[2024-05-25 14:18:38] [INFO ] Deduced a trap composed of 61 places in 382 ms of which 0 ms to minimize.
[2024-05-25 14:18:39] [INFO ] Deduced a trap composed of 38 places in 343 ms of which 0 ms to minimize.
[2024-05-25 14:18:39] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 0 ms to minimize.
[2024-05-25 14:18:40] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 1 ms to minimize.
[2024-05-25 14:18: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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:18:40] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:40] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2024-05-25 14:18:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:18:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:41] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2024-05-25 14:18:41] [INFO ] [Nat]Added 303 Read/Feed constraints in 276 ms returned sat
[2024-05-25 14:18:42] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 1 ms to minimize.
[2024-05-25 14:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2024-05-25 14:18:42] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 268 ms.
[2024-05-25 14:18:42] [INFO ] Added : 8 causal constraints over 2 iterations in 640 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, -1, -1] Max seen :[2, 0, 0, 0, 0]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 339 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:18:43] [INFO ] Computed 8 invariants in 46 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2797 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1941 ms. (steps per millisecond=515 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1839 ms. (steps per millisecond=543 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1871 ms. (steps per millisecond=534 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1879 ms. (steps per millisecond=532 ) properties (out of 5) seen :1
[2024-05-25 14:18:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:18:55] [INFO ] Computed 8 invariants in 42 ms
[2024-05-25 14:18:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:56] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2024-05-25 14:18:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:18:56] [INFO ] [Real]Added 283 Read/Feed constraints in 70 ms returned sat
[2024-05-25 14:18:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:18:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:18:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:57] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2024-05-25 14:18:57] [INFO ] [Nat]Added 283 Read/Feed constraints in 243 ms returned sat
[2024-05-25 14:18:58] [INFO ] Deduced a trap composed of 16 places in 447 ms of which 1 ms to minimize.
[2024-05-25 14:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 682 ms
[2024-05-25 14:18:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 323 ms.
[2024-05-25 14:18:59] [INFO ] Added : 4 causal constraints over 1 iterations in 741 ms. Result :sat
[2024-05-25 14:18:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:18:59] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2024-05-25 14:19:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:19:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:00] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2024-05-25 14:19:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 185 ms returned sat
[2024-05-25 14:19:01] [INFO ] Deduced a trap composed of 60 places in 463 ms of which 1 ms to minimize.
[2024-05-25 14:19:01] [INFO ] Deduced a trap composed of 95 places in 347 ms of which 1 ms to minimize.
[2024-05-25 14:19:02] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
[2024-05-25 14:19:02] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 1 ms to minimize.
[2024-05-25 14:19:02] [INFO ] Deduced a trap composed of 16 places in 310 ms of which 1 ms to minimize.
[2024-05-25 14:19:03] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 0 ms to minimize.
[2024-05-25 14:19:03] [INFO ] Deduced a trap composed of 41 places in 307 ms of which 0 ms to minimize.
[2024-05-25 14:19:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3024 ms
[2024-05-25 14:19:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 344 ms.
[2024-05-25 14:19:04] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 1 ms to minimize.
[2024-05-25 14:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2024-05-25 14:19:05] [INFO ] Added : 5 causal constraints over 2 iterations in 1525 ms. Result :sat
[2024-05-25 14:19:05] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:06] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2024-05-25 14:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:19:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:06] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2024-05-25 14:19:07] [INFO ] [Nat]Added 283 Read/Feed constraints in 256 ms returned sat
[2024-05-25 14:19:07] [INFO ] Deduced a trap composed of 37 places in 513 ms of which 1 ms to minimize.
[2024-05-25 14:19:08] [INFO ] Deduced a trap composed of 69 places in 531 ms of which 2 ms to minimize.
[2024-05-25 14:19:08] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 3 ms to minimize.
[2024-05-25 14:19:09] [INFO ] Deduced a trap composed of 55 places in 426 ms of which 0 ms to minimize.
[2024-05-25 14:19:09] [INFO ] Deduced a trap composed of 24 places in 432 ms of which 1 ms to minimize.
[2024-05-25 14:19:10] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2024-05-25 14:19:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3282 ms
[2024-05-25 14:19:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 261 ms.
[2024-05-25 14:19:10] [INFO ] Added : 4 causal constraints over 1 iterations in 610 ms. Result :sat
[2024-05-25 14:19:11] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:11] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-25 14:19:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:19:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:12] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2024-05-25 14:19:12] [INFO ] [Nat]Added 283 Read/Feed constraints in 87 ms returned sat
[2024-05-25 14:19:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 266 ms.
[2024-05-25 14:19:14] [INFO ] Deduced a trap composed of 96 places in 569 ms of which 0 ms to minimize.
[2024-05-25 14:19:15] [INFO ] Deduced a trap composed of 72 places in 549 ms of which 1 ms to minimize.
[2024-05-25 14:19:15] [INFO ] Deduced a trap composed of 53 places in 567 ms of which 1 ms to minimize.
[2024-05-25 14:19:16] [INFO ] Deduced a trap composed of 14 places in 511 ms of which 0 ms to minimize.
[2024-05-25 14:19:16] [INFO ] Deduced a trap composed of 94 places in 459 ms of which 0 ms to minimize.
[2024-05-25 14:19:17] [INFO ] Deduced a trap composed of 45 places in 472 ms of which 1 ms to minimize.
[2024-05-25 14:19:18] [INFO ] Deduced a trap composed of 35 places in 431 ms of which 1 ms to minimize.
[2024-05-25 14:19:18] [INFO ] Deduced a trap composed of 92 places in 436 ms of which 1 ms to minimize.
[2024-05-25 14:19:19] [INFO ] Deduced a trap composed of 90 places in 416 ms of which 0 ms to minimize.
[2024-05-25 14:19:19] [INFO ] Deduced a trap composed of 55 places in 386 ms of which 0 ms to minimize.
[2024-05-25 14:19:20] [INFO ] Deduced a trap composed of 48 places in 461 ms of which 1 ms to minimize.
[2024-05-25 14:19:20] [INFO ] Deduced a trap composed of 54 places in 474 ms of which 0 ms to minimize.
[2024-05-25 14:19:21] [INFO ] Deduced a trap composed of 35 places in 498 ms of which 1 ms to minimize.
[2024-05-25 14:19:21] [INFO ] Deduced a trap composed of 14 places in 355 ms of which 1 ms to minimize.
[2024-05-25 14:19:22] [INFO ] Deduced a trap composed of 41 places in 479 ms of which 1 ms to minimize.
[2024-05-25 14:19:23] [INFO ] Deduced a trap composed of 54 places in 541 ms of which 0 ms to minimize.
[2024-05-25 14:19:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9721 ms
[2024-05-25 14:19:23] [INFO ] Added : 9 causal constraints over 4 iterations in 11082 ms. Result :sat
[2024-05-25 14:19:23] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:24] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2024-05-25 14:19:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:19:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:25] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2024-05-25 14:19:25] [INFO ] [Nat]Added 283 Read/Feed constraints in 184 ms returned sat
[2024-05-25 14:19:25] [INFO ] Deduced a trap composed of 36 places in 527 ms of which 1 ms to minimize.
[2024-05-25 14:19:26] [INFO ] Deduced a trap composed of 23 places in 510 ms of which 1 ms to minimize.
[2024-05-25 14:19:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1346 ms
[2024-05-25 14:19:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 269 ms.
[2024-05-25 14:19:27] [INFO ] Added : 2 causal constraints over 1 iterations in 672 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, -1, -1] Max seen :[3, 0, 0, 0, 0]
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 79 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:19:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:19:28] [INFO ] Invariant cache hit.
[2024-05-25 14:19:28] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-25 14:19:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:19:28] [INFO ] Invariant cache hit.
[2024-05-25 14:19:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:19:30] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 2653 ms to find 0 implicit places.
[2024-05-25 14:19:31] [INFO ] Redundant transitions in 263 ms returned []
[2024-05-25 14:19:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:19:31] [INFO ] Invariant cache hit.
[2024-05-25 14:19:32] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4024 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:19:32] [INFO ] Computed 8 invariants in 12 ms
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 2915 ms. (steps per millisecond=343 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1928 ms. (steps per millisecond=518 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1922 ms. (steps per millisecond=520 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1923 ms. (steps per millisecond=520 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1893 ms. (steps per millisecond=528 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1888 ms. (steps per millisecond=529 ) properties (out of 5) seen :1
[2024-05-25 14:19:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:19:44] [INFO ] Computed 8 invariants in 26 ms
[2024-05-25 14:19:44] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:45] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2024-05-25 14:19:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:19:45] [INFO ] [Real]Added 283 Read/Feed constraints in 99 ms returned sat
[2024-05-25 14:19:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:19:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:19:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:46] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2024-05-25 14:19:46] [INFO ] [Nat]Added 283 Read/Feed constraints in 166 ms returned sat
[2024-05-25 14:19:46] [INFO ] Deduced a trap composed of 16 places in 360 ms of which 0 ms to minimize.
[2024-05-25 14:19:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 515 ms
[2024-05-25 14:19:46] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 230 ms.
[2024-05-25 14:19:47] [INFO ] Added : 4 causal constraints over 1 iterations in 578 ms. Result :sat
[2024-05-25 14:19:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:47] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2024-05-25 14:19:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:19:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:48] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-05-25 14:19:48] [INFO ] [Nat]Added 283 Read/Feed constraints in 267 ms returned sat
[2024-05-25 14:19:49] [INFO ] Deduced a trap composed of 60 places in 467 ms of which 1 ms to minimize.
[2024-05-25 14:19:50] [INFO ] Deduced a trap composed of 95 places in 499 ms of which 0 ms to minimize.
[2024-05-25 14:19:50] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2024-05-25 14:19:50] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 0 ms to minimize.
[2024-05-25 14:19:51] [INFO ] Deduced a trap composed of 16 places in 281 ms of which 0 ms to minimize.
[2024-05-25 14:19:51] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-05-25 14:19:51] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 1 ms to minimize.
[2024-05-25 14:19:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3081 ms
[2024-05-25 14:19:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 324 ms.
[2024-05-25 14:19:52] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 2 ms to minimize.
[2024-05-25 14:19:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2024-05-25 14:19:53] [INFO ] Added : 5 causal constraints over 2 iterations in 1644 ms. Result :sat
[2024-05-25 14:19:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:19:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:54] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2024-05-25 14:19:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:19:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:19:55] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2024-05-25 14:19:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 254 ms returned sat
[2024-05-25 14:19:55] [INFO ] Deduced a trap composed of 37 places in 471 ms of which 0 ms to minimize.
[2024-05-25 14:19:56] [INFO ] Deduced a trap composed of 69 places in 448 ms of which 2 ms to minimize.
[2024-05-25 14:19:56] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 5 ms to minimize.
[2024-05-25 14:19:57] [INFO ] Deduced a trap composed of 55 places in 491 ms of which 1 ms to minimize.
[2024-05-25 14:19:58] [INFO ] Deduced a trap composed of 24 places in 489 ms of which 1 ms to minimize.
[2024-05-25 14:19:58] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 0 ms to minimize.
[2024-05-25 14:19:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3170 ms
[2024-05-25 14:19:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 278 ms.
[2024-05-25 14:19:59] [INFO ] Added : 4 causal constraints over 1 iterations in 675 ms. Result :sat
[2024-05-25 14:19:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:00] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2024-05-25 14:20:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:20:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:00] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2024-05-25 14:20:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 65 ms returned sat
[2024-05-25 14:20:01] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 323 ms.
[2024-05-25 14:20:02] [INFO ] Deduced a trap composed of 96 places in 571 ms of which 0 ms to minimize.
[2024-05-25 14:20:03] [INFO ] Deduced a trap composed of 72 places in 512 ms of which 0 ms to minimize.
[2024-05-25 14:20:03] [INFO ] Deduced a trap composed of 53 places in 513 ms of which 0 ms to minimize.
[2024-05-25 14:20:04] [INFO ] Deduced a trap composed of 14 places in 544 ms of which 1 ms to minimize.
[2024-05-25 14:20:05] [INFO ] Deduced a trap composed of 94 places in 484 ms of which 0 ms to minimize.
[2024-05-25 14:20:05] [INFO ] Deduced a trap composed of 45 places in 487 ms of which 1 ms to minimize.
[2024-05-25 14:20:06] [INFO ] Deduced a trap composed of 35 places in 407 ms of which 1 ms to minimize.
[2024-05-25 14:20:06] [INFO ] Deduced a trap composed of 92 places in 457 ms of which 0 ms to minimize.
[2024-05-25 14:20:07] [INFO ] Deduced a trap composed of 90 places in 500 ms of which 1 ms to minimize.
[2024-05-25 14:20:07] [INFO ] Deduced a trap composed of 55 places in 437 ms of which 1 ms to minimize.
[2024-05-25 14:20:08] [INFO ] Deduced a trap composed of 48 places in 409 ms of which 1 ms to minimize.
[2024-05-25 14:20:09] [INFO ] Deduced a trap composed of 54 places in 462 ms of which 0 ms to minimize.
[2024-05-25 14:20:09] [INFO ] Deduced a trap composed of 35 places in 529 ms of which 0 ms to minimize.
[2024-05-25 14:20:10] [INFO ] Deduced a trap composed of 14 places in 368 ms of which 0 ms to minimize.
[2024-05-25 14:20:10] [INFO ] Deduced a trap composed of 41 places in 459 ms of which 1 ms to minimize.
[2024-05-25 14:20:11] [INFO ] Deduced a trap composed of 54 places in 524 ms of which 1 ms to minimize.
[2024-05-25 14:20:11] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9998 ms
[2024-05-25 14:20:12] [INFO ] Added : 9 causal constraints over 4 iterations in 11602 ms. Result :sat
[2024-05-25 14:20:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:13] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-25 14:20:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:20:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:20:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:14] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2024-05-25 14:20:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 176 ms returned sat
[2024-05-25 14:20:14] [INFO ] Deduced a trap composed of 36 places in 513 ms of which 1 ms to minimize.
[2024-05-25 14:20:15] [INFO ] Deduced a trap composed of 23 places in 465 ms of which 1 ms to minimize.
[2024-05-25 14:20:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1306 ms
[2024-05-25 14:20:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 303 ms.
[2024-05-25 14:20:16] [INFO ] Added : 2 causal constraints over 1 iterations in 759 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, -1, -1] Max seen :[3, 0, 0, 0, 0]
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:20:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:16] [INFO ] Invariant cache hit.
[2024-05-25 14:20:17] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-25 14:20:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:17] [INFO ] Invariant cache hit.
[2024-05-25 14:20:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:20:19] [INFO ] Implicit Places using invariants and state equation in 2479 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
[2024-05-25 14:20:20] [INFO ] Redundant transitions in 244 ms returned []
[2024-05-25 14:20:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:20] [INFO ] Invariant cache hit.
[2024-05-25 14:20:21] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4393 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-03
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:21] [INFO ] Computed 8 invariants in 14 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :1
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 :1
[2024-05-25 14:20:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:21] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 14:20:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:21] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2024-05-25 14:20:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:20:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:22] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-25 14:20:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:20:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 196 ms returned sat
[2024-05-25 14:20:23] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 1 ms to minimize.
[2024-05-25 14:20:23] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
[2024-05-25 14:20:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 826 ms
[2024-05-25 14:20:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 316 ms.
[2024-05-25 14:20:24] [INFO ] Added : 6 causal constraints over 2 iterations in 928 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 88 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:24] [INFO ] Computed 8 invariants in 25 ms
Incomplete random walk after 1000003 steps, including 3 resets, run finished after 3166 ms. (steps per millisecond=315 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1939 ms. (steps per millisecond=515 ) properties (out of 1) seen :1
[2024-05-25 14:20:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:30] [INFO ] Computed 8 invariants in 26 ms
[2024-05-25 14:20:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:30] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2024-05-25 14:20:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:20:30] [INFO ] [Real]Added 283 Read/Feed constraints in 68 ms returned sat
[2024-05-25 14:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:20:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:20:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:31] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2024-05-25 14:20:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 269 ms returned sat
[2024-05-25 14:20:32] [INFO ] Deduced a trap composed of 16 places in 446 ms of which 1 ms to minimize.
[2024-05-25 14:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 690 ms
[2024-05-25 14:20:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 331 ms.
[2024-05-25 14:20:33] [INFO ] Added : 4 causal constraints over 1 iterations in 811 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 89 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:20:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:33] [INFO ] Invariant cache hit.
[2024-05-25 14:20:34] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-25 14:20:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:34] [INFO ] Invariant cache hit.
[2024-05-25 14:20:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:20:37] [INFO ] Implicit Places using invariants and state equation in 2659 ms returned []
Implicit Place search using SMT with State Equation took 3165 ms to find 0 implicit places.
[2024-05-25 14:20:37] [INFO ] Redundant transitions in 208 ms returned []
[2024-05-25 14:20:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:37] [INFO ] Invariant cache hit.
[2024-05-25 14:20:38] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4734 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:38] [INFO ] Computed 8 invariants in 11 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2841 ms. (steps per millisecond=351 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties (out of 1) seen :2
[2024-05-25 14:20:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:43] [INFO ] Computed 8 invariants in 27 ms
[2024-05-25 14:20:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:44] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2024-05-25 14:20:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:20:44] [INFO ] [Real]Added 283 Read/Feed constraints in 93 ms returned sat
[2024-05-25 14:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:20:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:44] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-25 14:20:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 223 ms returned sat
[2024-05-25 14:20:45] [INFO ] Deduced a trap composed of 16 places in 444 ms of which 1 ms to minimize.
[2024-05-25 14:20:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 664 ms
[2024-05-25 14:20:46] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 299 ms.
[2024-05-25 14:20:46] [INFO ] Added : 4 causal constraints over 1 iterations in 743 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:20:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:46] [INFO ] Invariant cache hit.
[2024-05-25 14:20:47] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-25 14:20:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:47] [INFO ] Invariant cache hit.
[2024-05-25 14:20:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:20:49] [INFO ] Implicit Places using invariants and state equation in 2471 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
[2024-05-25 14:20:50] [INFO ] Redundant transitions in 177 ms returned []
[2024-05-25 14:20:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:20:50] [INFO ] Invariant cache hit.
[2024-05-25 14:20:51] [INFO ] Dead Transitions using invariants and state equation in 1314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4504 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-03 in 30061 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-04
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:51] [INFO ] Computed 8 invariants in 18 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
[2024-05-25 14:20:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:51] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 14:20:51] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:52] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2024-05-25 14:20:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:20:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:20:52] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2024-05-25 14:20:52] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:20:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 228 ms returned sat
[2024-05-25 14:20:53] [INFO ] Deduced a trap composed of 60 places in 509 ms of which 1 ms to minimize.
[2024-05-25 14:20:54] [INFO ] Deduced a trap composed of 95 places in 452 ms of which 0 ms to minimize.
[2024-05-25 14:20:54] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 1 ms to minimize.
[2024-05-25 14:20:54] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 0 ms to minimize.
[2024-05-25 14:20:55] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 0 ms to minimize.
[2024-05-25 14:20:55] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 0 ms to minimize.
[2024-05-25 14:20:56] [INFO ] Deduced a trap composed of 41 places in 347 ms of which 1 ms to minimize.
[2024-05-25 14:20:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3281 ms
[2024-05-25 14:20:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 345 ms.
[2024-05-25 14:20:57] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2024-05-25 14:20:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:20:57] [INFO ] Computed 8 invariants in 12 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 3002 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2070 ms. (steps per millisecond=483 ) properties (out of 1) seen :0
[2024-05-25 14:21:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:02] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 14:21:02] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:03] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2024-05-25 14:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:21:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:03] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2024-05-25 14:21:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:21:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 249 ms returned sat
[2024-05-25 14:21:04] [INFO ] Deduced a trap composed of 60 places in 351 ms of which 1 ms to minimize.
[2024-05-25 14:21:05] [INFO ] Deduced a trap composed of 95 places in 522 ms of which 0 ms to minimize.
[2024-05-25 14:21:05] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 0 ms to minimize.
[2024-05-25 14:21:05] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 1 ms to minimize.
[2024-05-25 14:21:06] [INFO ] Deduced a trap composed of 16 places in 272 ms of which 0 ms to minimize.
[2024-05-25 14:21:06] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 0 ms to minimize.
[2024-05-25 14:21:07] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 0 ms to minimize.
[2024-05-25 14:21:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3076 ms
[2024-05-25 14:21:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 310 ms.
[2024-05-25 14:21:08] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 0 ms to minimize.
[2024-05-25 14:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2024-05-25 14:21:08] [INFO ] Added : 5 causal constraints over 2 iterations in 1552 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:21:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:21:09] [INFO ] Invariant cache hit.
[2024-05-25 14:21:09] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-25 14:21:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:21:09] [INFO ] Invariant cache hit.
[2024-05-25 14:21:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:21:12] [INFO ] Implicit Places using invariants and state equation in 2962 ms returned []
Implicit Place search using SMT with State Equation took 3453 ms to find 0 implicit places.
[2024-05-25 14:21:12] [INFO ] Redundant transitions in 170 ms returned []
[2024-05-25 14:21:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:21:12] [INFO ] Invariant cache hit.
[2024-05-25 14:21:13] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4879 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-04 in 22569 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-05
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:13] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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
[2024-05-25 14:21:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:14] [INFO ] Computed 8 invariants in 14 ms
[2024-05-25 14:21:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:14] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2024-05-25 14:21:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:21:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:15] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2024-05-25 14:21:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:21:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 252 ms returned sat
[2024-05-25 14:21:16] [INFO ] Deduced a trap composed of 37 places in 493 ms of which 0 ms to minimize.
[2024-05-25 14:21:16] [INFO ] Deduced a trap composed of 69 places in 468 ms of which 1 ms to minimize.
[2024-05-25 14:21:17] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 1 ms to minimize.
[2024-05-25 14:21:17] [INFO ] Deduced a trap composed of 55 places in 526 ms of which 1 ms to minimize.
[2024-05-25 14:21:18] [INFO ] Deduced a trap composed of 24 places in 541 ms of which 0 ms to minimize.
[2024-05-25 14:21:18] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2024-05-25 14:21:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3404 ms
[2024-05-25 14:21:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 309 ms.
[2024-05-25 14:21:19] [INFO ] Added : 4 causal constraints over 1 iterations in 723 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:19] [INFO ] Computed 8 invariants in 23 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 2715 ms. (steps per millisecond=368 ) properties (out of 1) seen :0
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 :0
[2024-05-25 14:21:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:24] [INFO ] Computed 8 invariants in 24 ms
[2024-05-25 14:21:24] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:25] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2024-05-25 14:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:21:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:25] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2024-05-25 14:21:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:21:26] [INFO ] [Nat]Added 283 Read/Feed constraints in 327 ms returned sat
[2024-05-25 14:21:26] [INFO ] Deduced a trap composed of 37 places in 526 ms of which 1 ms to minimize.
[2024-05-25 14:21:27] [INFO ] Deduced a trap composed of 69 places in 500 ms of which 0 ms to minimize.
[2024-05-25 14:21:27] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 1 ms to minimize.
[2024-05-25 14:21:28] [INFO ] Deduced a trap composed of 55 places in 471 ms of which 1 ms to minimize.
[2024-05-25 14:21:29] [INFO ] Deduced a trap composed of 24 places in 503 ms of which 0 ms to minimize.
[2024-05-25 14:21:29] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 0 ms to minimize.
[2024-05-25 14:21:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3353 ms
[2024-05-25 14:21:29] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 269 ms.
[2024-05-25 14:21:30] [INFO ] Added : 4 causal constraints over 1 iterations in 694 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 55 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:21:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:21:30] [INFO ] Invariant cache hit.
[2024-05-25 14:21:31] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-25 14:21:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:21:31] [INFO ] Invariant cache hit.
[2024-05-25 14:21:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:21:33] [INFO ] Implicit Places using invariants and state equation in 2445 ms returned []
Implicit Place search using SMT with State Equation took 2900 ms to find 0 implicit places.
[2024-05-25 14:21:33] [INFO ] Redundant transitions in 166 ms returned []
[2024-05-25 14:21:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:21:33] [INFO ] Invariant cache hit.
[2024-05-25 14:21:34] [INFO ] Dead Transitions using invariants and state equation in 1267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4400 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-05 in 20994 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:34] [INFO ] Computed 8 invariants in 19 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
[2024-05-25 14:21:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:35] [INFO ] Computed 8 invariants in 21 ms
[2024-05-25 14:21:35] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:35] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2024-05-25 14:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:21:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:36] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-25 14:21:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:21:36] [INFO ] [Nat]Added 283 Read/Feed constraints in 90 ms returned sat
[2024-05-25 14:21:37] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 313 ms.
[2024-05-25 14:21:38] [INFO ] Deduced a trap composed of 96 places in 599 ms of which 0 ms to minimize.
[2024-05-25 14:21:39] [INFO ] Deduced a trap composed of 72 places in 582 ms of which 1 ms to minimize.
[2024-05-25 14:21:39] [INFO ] Deduced a trap composed of 53 places in 602 ms of which 1 ms to minimize.
[2024-05-25 14:21:40] [INFO ] Deduced a trap composed of 14 places in 589 ms of which 1 ms to minimize.
[2024-05-25 14:21:41] [INFO ] Deduced a trap composed of 94 places in 545 ms of which 0 ms to minimize.
[2024-05-25 14:21:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 98 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:41] [INFO ] Computed 8 invariants in 13 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 2840 ms. (steps per millisecond=352 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1886 ms. (steps per millisecond=530 ) properties (out of 1) seen :0
[2024-05-25 14:21:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:21:46] [INFO ] Computed 8 invariants in 24 ms
[2024-05-25 14:21:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:46] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2024-05-25 14:21:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:21:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:21:47] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-25 14:21:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:21:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 85 ms returned sat
[2024-05-25 14:21:48] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 315 ms.
[2024-05-25 14:21:49] [INFO ] Deduced a trap composed of 96 places in 533 ms of which 1 ms to minimize.
[2024-05-25 14:21:50] [INFO ] Deduced a trap composed of 72 places in 525 ms of which 0 ms to minimize.
[2024-05-25 14:21:50] [INFO ] Deduced a trap composed of 53 places in 568 ms of which 0 ms to minimize.
[2024-05-25 14:21:51] [INFO ] Deduced a trap composed of 14 places in 566 ms of which 0 ms to minimize.
[2024-05-25 14:21:52] [INFO ] Deduced a trap composed of 94 places in 479 ms of which 0 ms to minimize.
[2024-05-25 14:21:52] [INFO ] Deduced a trap composed of 45 places in 472 ms of which 0 ms to minimize.
[2024-05-25 14:21:53] [INFO ] Deduced a trap composed of 35 places in 468 ms of which 1 ms to minimize.
[2024-05-25 14:21:54] [INFO ] Deduced a trap composed of 92 places in 467 ms of which 0 ms to minimize.
[2024-05-25 14:21:54] [INFO ] Deduced a trap composed of 90 places in 500 ms of which 1 ms to minimize.
[2024-05-25 14:21:55] [INFO ] Deduced a trap composed of 55 places in 442 ms of which 0 ms to minimize.
[2024-05-25 14:21:56] [INFO ] Deduced a trap composed of 48 places in 482 ms of which 0 ms to minimize.
[2024-05-25 14:21:56] [INFO ] Deduced a trap composed of 54 places in 460 ms of which 0 ms to minimize.
[2024-05-25 14:21:57] [INFO ] Deduced a trap composed of 35 places in 458 ms of which 1 ms to minimize.
[2024-05-25 14:21:57] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 1 ms to minimize.
[2024-05-25 14:21:58] [INFO ] Deduced a trap composed of 41 places in 434 ms of which 1 ms to minimize.
[2024-05-25 14:21:59] [INFO ] Deduced a trap composed of 54 places in 460 ms of which 1 ms to minimize.
[2024-05-25 14:21:59] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 10422 ms
[2024-05-25 14:21:59] [INFO ] Added : 9 causal constraints over 4 iterations in 12088 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 101 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:22:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:22:00] [INFO ] Invariant cache hit.
[2024-05-25 14:22:00] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-25 14:22:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:22:00] [INFO ] Invariant cache hit.
[2024-05-25 14:22:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:22:03] [INFO ] Implicit Places using invariants and state equation in 2407 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
[2024-05-25 14:22:03] [INFO ] Redundant transitions in 153 ms returned []
[2024-05-25 14:22:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:22:03] [INFO ] Invariant cache hit.
[2024-05-25 14:22:04] [INFO ] Dead Transitions using invariants and state equation in 1207 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4367 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-11 in 29637 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:22:04] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2024-05-25 14:22:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:22:04] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 14:22:04] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:22:05] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2024-05-25 14:22:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:22:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:22:05] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2024-05-25 14:22:05] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:22:06] [INFO ] [Nat]Added 283 Read/Feed constraints in 142 ms returned sat
[2024-05-25 14:22:06] [INFO ] Deduced a trap composed of 36 places in 487 ms of which 2 ms to minimize.
[2024-05-25 14:22:07] [INFO ] Deduced a trap composed of 23 places in 491 ms of which 0 ms to minimize.
[2024-05-25 14:22:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1325 ms
[2024-05-25 14:22:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 306 ms.
[2024-05-25 14:22:08] [INFO ] Added : 2 causal constraints over 1 iterations in 740 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:22:08] [INFO ] Computed 8 invariants in 14 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2886 ms. (steps per millisecond=346 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
[2024-05-25 14:22:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:22:13] [INFO ] Computed 8 invariants in 22 ms
[2024-05-25 14:22:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:22:13] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2024-05-25 14:22:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:22:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:22:14] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-25 14:22:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:22:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 182 ms returned sat
[2024-05-25 14:22:15] [INFO ] Deduced a trap composed of 36 places in 489 ms of which 0 ms to minimize.
[2024-05-25 14:22:15] [INFO ] Deduced a trap composed of 23 places in 436 ms of which 0 ms to minimize.
[2024-05-25 14:22:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1236 ms
[2024-05-25 14:22:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 301 ms.
[2024-05-25 14:22:16] [INFO ] Added : 2 causal constraints over 1 iterations in 760 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:22:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:22:17] [INFO ] Invariant cache hit.
[2024-05-25 14:22:17] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-25 14:22:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:22:17] [INFO ] Invariant cache hit.
[2024-05-25 14:22:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:22:18] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2024-05-25 14:22:19] [INFO ] Redundant transitions in 107 ms returned []
[2024-05-25 14:22:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:22:19] [INFO ] Invariant cache hit.
[2024-05-25 14:22:20] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3087 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-12 in 15562 ms.
[2024-05-25 14:22:20] [INFO ] Flatten gal took : 402 ms
[2024-05-25 14:22:20] [INFO ] Applying decomposition
[2024-05-25 14:22:21] [INFO ] Flatten gal took : 242 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12170130979691496625.txt' '-o' '/tmp/graph12170130979691496625.bin' '-w' '/tmp/graph12170130979691496625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12170130979691496625.bin' '-l' '-1' '-v' '-w' '/tmp/graph12170130979691496625.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:22:21] [INFO ] Decomposing Gal with order
[2024-05-25 14:22:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:22:22] [INFO ] Removed a total of 424 redundant transitions.
[2024-05-25 14:22:22] [INFO ] Flatten gal took : 494 ms
[2024-05-25 14:22:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 32 ms.
[2024-05-25 14:22:22] [INFO ] Time to serialize gal into /tmp/UpperBounds4786216806376458386.gal : 61 ms
[2024-05-25 14:22:22] [INFO ] Time to serialize properties into /tmp/UpperBounds15216915474175314548.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4786216806376458386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15216915474175314548.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds15216915474175314548.prop.
Detected timeout of ITS tools.
[2024-05-25 14:43:49] [INFO ] Flatten gal took : 927 ms
[2024-05-25 14:43:50] [INFO ] Time to serialize gal into /tmp/UpperBounds16524118883156463843.gal : 87 ms
[2024-05-25 14:43:50] [INFO ] Time to serialize properties into /tmp/UpperBounds3325147732508217555.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16524118883156463843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3325147732508217555.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds3325147732508217555.prop.
Detected timeout of ITS tools.
[2024-05-25 15:05:13] [INFO ] Flatten gal took : 817 ms
[2024-05-25 15:05:17] [INFO ] Input system was already deterministic with 3871 transitions.
[2024-05-25 15:05:17] [INFO ] Transformed 269 places.
[2024-05-25 15:05:17] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 15:05:17] [INFO ] Time to serialize gal into /tmp/UpperBounds2318235972286082192.gal : 23 ms
[2024-05-25 15:05:17] [INFO ] Time to serialize properties into /tmp/UpperBounds10826818724096747734.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2318235972286082192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10826818724096747734.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10826818724096747734.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5163584 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16160076 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-q8m016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BugTracking-PT-q8m016, 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 r065-tajo-171620414700256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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