Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910400201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FireWire-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910400201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 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 FireWire-PT-20-UpperBounds-00
FORMULA_NAME FireWire-PT-20-UpperBounds-01
FORMULA_NAME FireWire-PT-20-UpperBounds-02
FORMULA_NAME FireWire-PT-20-UpperBounds-03
FORMULA_NAME FireWire-PT-20-UpperBounds-04
FORMULA_NAME FireWire-PT-20-UpperBounds-05
FORMULA_NAME FireWire-PT-20-UpperBounds-06
FORMULA_NAME FireWire-PT-20-UpperBounds-07
FORMULA_NAME FireWire-PT-20-UpperBounds-08
FORMULA_NAME FireWire-PT-20-UpperBounds-09
FORMULA_NAME FireWire-PT-20-UpperBounds-10
FORMULA_NAME FireWire-PT-20-UpperBounds-11
FORMULA_NAME FireWire-PT-20-UpperBounds-12
FORMULA_NAME FireWire-PT-20-UpperBounds-13
FORMULA_NAME FireWire-PT-20-UpperBounds-14
FORMULA_NAME FireWire-PT-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717371728888

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=FireWire-PT-20
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 23:42:10] [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-06-02 23:42:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:42:10] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 23:42:10] [INFO ] Transformed 626 places.
[2024-06-02 23:42:10] [INFO ] Transformed 1031 transitions.
[2024-06-02 23:42:10] [INFO ] Found NUPN structural information;
[2024-06-02 23:42:10] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1031 rows 626 cols
[2024-06-02 23:42:10] [INFO ] Computed 13 invariants in 31 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :6
FORMULA FireWire-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :1
FORMULA FireWire-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
[2024-06-02 23:42:11] [INFO ] Invariant cache hit.
[2024-06-02 23:42:11] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2024-06-02 23:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:11] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2024-06-02 23:42:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 23:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:12] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-06-02 23:42:12] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 3 ms to minimize.
[2024-06-02 23:42:13] [INFO ] Deduced a trap composed of 65 places in 335 ms of which 1 ms to minimize.
[2024-06-02 23:42:13] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 1 ms to minimize.
[2024-06-02 23:42:13] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-06-02 23:42:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1486 ms
[2024-06-02 23:42:14] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 107 ms.
[2024-06-02 23:42:17] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 2 ms to minimize.
[2024-06-02 23:42:17] [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-06-02 23:42:17] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:17] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2024-06-02 23:42:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 23:42:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:18] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2024-06-02 23:42:18] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 1 ms to minimize.
[2024-06-02 23:42:18] [INFO ] Deduced a trap composed of 180 places in 272 ms of which 1 ms to minimize.
[2024-06-02 23:42:18] [INFO ] Deduced a trap composed of 128 places in 240 ms of which 1 ms to minimize.
[2024-06-02 23:42:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 886 ms
[2024-06-02 23:42:19] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 110 ms.
[2024-06-02 23:42: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 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.refineWithCausalOrder(DeadlockTester.java:1189)
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-06-02 23:42:22] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:23] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2024-06-02 23:42:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:23] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2024-06-02 23:42:23] [INFO ] Deduced a trap composed of 65 places in 437 ms of which 1 ms to minimize.
[2024-06-02 23:42:24] [INFO ] Deduced a trap composed of 118 places in 208 ms of which 0 ms to minimize.
[2024-06-02 23:42:24] [INFO ] Deduced a trap composed of 114 places in 86 ms of which 0 ms to minimize.
[2024-06-02 23:42:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 869 ms
[2024-06-02 23:42:24] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 64 ms.
[2024-06-02 23:42:28] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 0 ms to minimize.
[2024-06-02 23:42: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-06-02 23:42:28] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-06-02 23:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:28] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-06-02 23:42:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-02 23:42:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:28] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-06-02 23:42:29] [INFO ] Deduced a trap composed of 98 places in 226 ms of which 1 ms to minimize.
[2024-06-02 23:42:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2024-06-02 23:42:29] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 56 ms.
[2024-06-02 23:42:33] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 0 ms to minimize.
[2024-06-02 23:42:33] [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-06-02 23:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:34] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-06-02 23:42:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-06-02 23:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:34] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-06-02 23:42:34] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 1 ms to minimize.
[2024-06-02 23:42:35] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:42:35] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 1 ms to minimize.
[2024-06-02 23:42:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 557 ms
[2024-06-02 23:42:35] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 65 ms.
[2024-06-02 23:42:39] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2024-06-02 23:42:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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-06-02 23:42:39] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-02 23:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:39] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2024-06-02 23:42:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:40] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-06-02 23:42:40] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 0 ms to minimize.
[2024-06-02 23:42:40] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 0 ms to minimize.
[2024-06-02 23:42:40] [INFO ] Deduced a trap composed of 114 places in 106 ms of which 0 ms to minimize.
[2024-06-02 23:42:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 542 ms
[2024-06-02 23:42:40] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 53 ms.
[2024-06-02 23:42:45] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 1 ms to minimize.
[2024-06-02 23:42:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-06-02 23:42:45] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-06-02 23:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:45] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-06-02 23:42:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:46] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2024-06-02 23:42:46] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 0 ms to minimize.
[2024-06-02 23:42:46] [INFO ] Deduced a trap composed of 29 places in 215 ms of which 1 ms to minimize.
[2024-06-02 23:42:46] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 0 ms to minimize.
[2024-06-02 23:42:46] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 1 ms to minimize.
[2024-06-02 23:42:47] [INFO ] Deduced a trap composed of 118 places in 220 ms of which 0 ms to minimize.
[2024-06-02 23:42:47] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 0 ms to minimize.
[2024-06-02 23:42:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1357 ms
[2024-06-02 23:42:47] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 52 ms.
[2024-06-02 23:42:50] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 0 ms to minimize.
[2024-06-02 23:42:50] [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 6
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-06-02 23:42:50] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:51] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2024-06-02 23:42:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:51] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-06-02 23:42:51] [INFO ] Deduced a trap composed of 210 places in 225 ms of which 1 ms to minimize.
[2024-06-02 23:42:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2024-06-02 23:42:52] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 50 ms.
[2024-06-02 23:42:56] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2024-06-02 23:42:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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-06-02 23:42:56] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-06-02 23:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:56] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-06-02 23:42:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:42:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-06-02 23:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:42:57] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2024-06-02 23:42:57] [INFO ] Deduced a trap composed of 106 places in 207 ms of which 0 ms to minimize.
[2024-06-02 23:42:57] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 0 ms to minimize.
[2024-06-02 23:42:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 580 ms
[2024-06-02 23:42:57] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 55 ms.
[2024-06-02 23:43:02] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 1 ms to minimize.
[2024-06-02 23:43:02] [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 8
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Graph (trivial) has 446 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 8 ms
Free SCC test removed 9 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 603 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.3 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 603 transition count 899
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 240 place count 486 transition count 897
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 485 transition count 896
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 484 transition count 896
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 243 place count 484 transition count 880
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 275 place count 468 transition count 880
Discarding 88 places :
Symmetric choice reduction at 4 with 88 rule applications. Total rules 363 place count 380 transition count 786
Iterating global reduction 4 with 88 rules applied. Total rules applied 451 place count 380 transition count 786
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 454 place count 380 transition count 783
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 454 place count 380 transition count 775
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 470 place count 372 transition count 775
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 499 place count 343 transition count 648
Iterating global reduction 5 with 29 rules applied. Total rules applied 528 place count 343 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 530 place count 343 transition count 646
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 537 place count 336 transition count 635
Iterating global reduction 6 with 7 rules applied. Total rules applied 544 place count 336 transition count 635
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 550 place count 336 transition count 629
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 553 place count 333 transition count 629
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 554 place count 332 transition count 626
Iterating global reduction 8 with 1 rules applied. Total rules applied 555 place count 332 transition count 626
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 556 place count 331 transition count 624
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 331 transition count 624
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 558 place count 330 transition count 621
Iterating global reduction 8 with 1 rules applied. Total rules applied 559 place count 330 transition count 621
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 560 place count 329 transition count 619
Iterating global reduction 8 with 1 rules applied. Total rules applied 561 place count 329 transition count 619
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 562 place count 328 transition count 616
Iterating global reduction 8 with 1 rules applied. Total rules applied 563 place count 328 transition count 616
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 564 place count 327 transition count 614
Iterating global reduction 8 with 1 rules applied. Total rules applied 565 place count 327 transition count 614
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 566 place count 326 transition count 611
Iterating global reduction 8 with 1 rules applied. Total rules applied 567 place count 326 transition count 611
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 568 place count 325 transition count 609
Iterating global reduction 8 with 1 rules applied. Total rules applied 569 place count 325 transition count 609
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 570 place count 324 transition count 606
Iterating global reduction 8 with 1 rules applied. Total rules applied 571 place count 324 transition count 606
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 572 place count 323 transition count 604
Iterating global reduction 8 with 1 rules applied. Total rules applied 573 place count 323 transition count 604
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 574 place count 322 transition count 602
Iterating global reduction 8 with 1 rules applied. Total rules applied 575 place count 322 transition count 602
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 576 place count 321 transition count 600
Iterating global reduction 8 with 1 rules applied. Total rules applied 577 place count 321 transition count 600
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 8 with 96 rules applied. Total rules applied 673 place count 273 transition count 552
Performed 43 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 759 place count 230 transition count 645
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 762 place count 230 transition count 642
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 785 place count 230 transition count 619
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 816 place count 207 transition count 611
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 822 place count 201 transition count 605
Iterating global reduction 9 with 6 rules applied. Total rules applied 828 place count 201 transition count 605
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 837 place count 201 transition count 596
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 863 place count 201 transition count 570
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 867 place count 201 transition count 570
Applied a total of 867 rules in 358 ms. Remains 201 /626 variables (removed 425) and now considering 570/1031 (removed 461) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 358 ms. Remains : 201/626 places, 570/1031 transitions.
Normalized transition count is 560 out of 570 initially.
// Phase 1: matrix 560 rows 201 cols
[2024-06-02 23:43:02] [INFO ] Computed 10 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 33436 resets, run finished after 2019 ms. (steps per millisecond=495 ) properties (out of 9) seen :7
FORMULA FireWire-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6522 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6442 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 2) seen :0
[2024-06-02 23:43:05] [INFO ] Flow matrix only has 560 transitions (discarded 10 similar events)
// Phase 1: matrix 560 rows 201 cols
[2024-06-02 23:43:05] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:43:05] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:05] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-02 23:43:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:05] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-02 23:43:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-02 23:43:05] [INFO ] [Nat]Added 100 Read/Feed constraints in 50 ms returned sat
[2024-06-02 23:43:05] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2024-06-02 23:43:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-06-02 23:43:06] [INFO ] Computed and/alt/rep : 177/758/177 causal constraints (skipped 375 transitions) in 33 ms.
[2024-06-02 23:43:06] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:43:06] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:43:06] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:43:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2024-06-02 23:43:06] [INFO ] Added : 42 causal constraints over 10 iterations in 652 ms. Result :sat
Minimization took 80 ms.
[2024-06-02 23:43:06] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:06] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-02 23:43:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:06] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-02 23:43:07] [INFO ] [Nat]Added 100 Read/Feed constraints in 37 ms returned sat
[2024-06-02 23:43:07] [INFO ] Computed and/alt/rep : 177/758/177 causal constraints (skipped 375 transitions) in 38 ms.
[2024-06-02 23:43:07] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:43:07] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:43:07] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:43:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 389 ms
[2024-06-02 23:43:07] [INFO ] Added : 27 causal constraints over 7 iterations in 677 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 570/570 transitions.
Graph (complete) has 1007 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 200 transition count 566
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 197 transition count 566
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 196 transition count 565
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 194 transition count 567
Applied a total of 14 rules in 25 ms. Remains 194 /201 variables (removed 7) and now considering 567/570 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 194/201 places, 567/570 transitions.
Normalized transition count is 557 out of 567 initially.
// Phase 1: matrix 557 rows 194 cols
[2024-06-02 23:43:07] [INFO ] Computed 10 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 33370 resets, run finished after 1889 ms. (steps per millisecond=529 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6581 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6440 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 2) seen :0
[2024-06-02 23:43:10] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 194 cols
[2024-06-02 23:43:10] [INFO ] Computed 10 invariants in 12 ms
[2024-06-02 23:43:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:10] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-02 23:43:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:11] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-02 23:43:11] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 23:43:11] [INFO ] [Nat]Added 103 Read/Feed constraints in 52 ms returned sat
[2024-06-02 23:43:11] [INFO ] Computed and/alt/rep : 169/754/169 causal constraints (skipped 380 transitions) in 36 ms.
[2024-06-02 23:43:11] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:43:11] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:43:11] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2024-06-02 23:43:11] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2024-06-02 23:43:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 496 ms
[2024-06-02 23:43:11] [INFO ] Added : 17 causal constraints over 6 iterations in 741 ms. Result :sat
Minimization took 89 ms.
[2024-06-02 23:43:12] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:12] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 23:43:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:12] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-02 23:43:12] [INFO ] [Nat]Added 103 Read/Feed constraints in 23 ms returned sat
[2024-06-02 23:43:12] [INFO ] Computed and/alt/rep : 169/754/169 causal constraints (skipped 380 transitions) in 35 ms.
[2024-06-02 23:43:12] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2024-06-02 23:43:12] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2024-06-02 23:43:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2024-06-02 23:43:12] [INFO ] Added : 20 causal constraints over 5 iterations in 526 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 567/567 transitions.
Applied a total of 0 rules in 10 ms. Remains 194 /194 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 194/194 places, 567/567 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 567/567 transitions.
Applied a total of 0 rules in 9 ms. Remains 194 /194 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2024-06-02 23:43:13] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-06-02 23:43:13] [INFO ] Invariant cache hit.
[2024-06-02 23:43:13] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-02 23:43:13] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-06-02 23:43:13] [INFO ] Invariant cache hit.
[2024-06-02 23:43:13] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 23:43:13] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2024-06-02 23:43:13] [INFO ] Redundant transitions in 33 ms returned []
[2024-06-02 23:43:13] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
[2024-06-02 23:43:13] [INFO ] Invariant cache hit.
[2024-06-02 23:43:13] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 965 ms. Remains : 194/194 places, 567/567 transitions.
Starting property specific reduction for FireWire-PT-20-UpperBounds-06
Normalized transition count is 557 out of 567 initially.
// Phase 1: matrix 557 rows 194 cols
[2024-06-02 23:43:14] [INFO ] Computed 10 invariants in 2 ms
Incomplete random walk after 10000 steps, including 329 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-06-02 23:43:14] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 194 cols
[2024-06-02 23:43:14] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 23:43:14] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:14] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-06-02 23:43:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:14] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-02 23:43:14] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 23:43:14] [INFO ] [Nat]Added 103 Read/Feed constraints in 48 ms returned sat
[2024-06-02 23:43:14] [INFO ] Computed and/alt/rep : 169/754/169 causal constraints (skipped 380 transitions) in 33 ms.
[2024-06-02 23:43:14] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-06-02 23:43:14] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2024-06-02 23:43:14] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:43:15] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:43:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 564 ms
[2024-06-02 23:43:15] [INFO ] Added : 17 causal constraints over 6 iterations in 811 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 567/567 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 192 transition count 564
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 192 transition count 564
Applied a total of 4 rules in 14 ms. Remains 192 /194 variables (removed 2) and now considering 564/567 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 192/194 places, 564/567 transitions.
Normalized transition count is 554 out of 564 initially.
// Phase 1: matrix 554 rows 192 cols
[2024-06-02 23:43:15] [INFO ] Computed 10 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 33413 resets, run finished after 1840 ms. (steps per millisecond=543 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6642 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 1) seen :0
[2024-06-02 23:43:17] [INFO ] Flow matrix only has 554 transitions (discarded 10 similar events)
// Phase 1: matrix 554 rows 192 cols
[2024-06-02 23:43:17] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 23:43:17] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:17] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-02 23:43:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:18] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-06-02 23:43:18] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 23:43:18] [INFO ] [Nat]Added 103 Read/Feed constraints in 40 ms returned sat
[2024-06-02 23:43:18] [INFO ] Computed and/alt/rep : 167/750/167 causal constraints (skipped 379 transitions) in 37 ms.
[2024-06-02 23:43:18] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:43:18] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-06-02 23:43:18] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 0 ms to minimize.
[2024-06-02 23:43:18] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 0 ms to minimize.
[2024-06-02 23:43:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 476 ms
[2024-06-02 23:43:18] [INFO ] Added : 18 causal constraints over 6 iterations in 731 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 564/564 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 192/192 places, 564/564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 564/564 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2024-06-02 23:43:18] [INFO ] Flow matrix only has 554 transitions (discarded 10 similar events)
[2024-06-02 23:43:18] [INFO ] Invariant cache hit.
[2024-06-02 23:43:19] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-02 23:43:19] [INFO ] Flow matrix only has 554 transitions (discarded 10 similar events)
[2024-06-02 23:43:19] [INFO ] Invariant cache hit.
[2024-06-02 23:43:19] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 23:43:19] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-06-02 23:43:19] [INFO ] Redundant transitions in 12 ms returned []
[2024-06-02 23:43:19] [INFO ] Flow matrix only has 554 transitions (discarded 10 similar events)
[2024-06-02 23:43:19] [INFO ] Invariant cache hit.
[2024-06-02 23:43:19] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 921 ms. Remains : 192/192 places, 564/564 transitions.
Ending property specific reduction for FireWire-PT-20-UpperBounds-06 in 5863 ms.
Starting property specific reduction for FireWire-PT-20-UpperBounds-08
Normalized transition count is 557 out of 567 initially.
// Phase 1: matrix 557 rows 194 cols
[2024-06-02 23:43:19] [INFO ] Computed 10 invariants in 2 ms
Incomplete random walk after 10000 steps, including 329 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-06-02 23:43:19] [INFO ] Flow matrix only has 557 transitions (discarded 10 similar events)
// Phase 1: matrix 557 rows 194 cols
[2024-06-02 23:43:19] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:43:19] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:20] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-02 23:43:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:20] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-02 23:43:20] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 23:43:20] [INFO ] [Nat]Added 103 Read/Feed constraints in 22 ms returned sat
[2024-06-02 23:43:20] [INFO ] Computed and/alt/rep : 169/754/169 causal constraints (skipped 380 transitions) in 39 ms.
[2024-06-02 23:43:20] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:43:20] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:43:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2024-06-02 23:43:20] [INFO ] Added : 20 causal constraints over 5 iterations in 486 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 567/567 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 561
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 561
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 192 transition count 559
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 192 transition count 559
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 191 transition count 556
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 191 transition count 556
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 190 transition count 554
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 190 transition count 554
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 189 transition count 551
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 189 transition count 551
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 188 transition count 549
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 188 transition count 549
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 187 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 187 transition count 546
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 186 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 186 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 185 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 185 transition count 541
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 184 transition count 539
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 184 transition count 539
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 183 transition count 537
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 183 transition count 537
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 182 transition count 535
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 182 transition count 535
Applied a total of 24 rules in 44 ms. Remains 182 /194 variables (removed 12) and now considering 535/567 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 182/194 places, 535/567 transitions.
Normalized transition count is 525 out of 535 initially.
// Phase 1: matrix 525 rows 182 cols
[2024-06-02 23:43:20] [INFO ] Computed 10 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 33514 resets, run finished after 1800 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6553 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 1) seen :0
[2024-06-02 23:43:23] [INFO ] Flow matrix only has 525 transitions (discarded 10 similar events)
// Phase 1: matrix 525 rows 182 cols
[2024-06-02 23:43:23] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:43:23] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:23] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-02 23:43:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 23:43:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 23:43:23] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-06-02 23:43:23] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-02 23:43:23] [INFO ] [Nat]Added 97 Read/Feed constraints in 17 ms returned sat
[2024-06-02 23:43:23] [INFO ] Computed and/alt/rep : 156/712/156 causal constraints (skipped 361 transitions) in 36 ms.
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:43:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 342 ms
[2024-06-02 23:43:24] [INFO ] Added : 12 causal constraints over 6 iterations in 579 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 535/535 transitions.
Applied a total of 0 rules in 6 ms. Remains 182 /182 variables (removed 0) and now considering 535/535 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 182/182 places, 535/535 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 535/535 transitions.
Applied a total of 0 rules in 7 ms. Remains 182 /182 variables (removed 0) and now considering 535/535 (removed 0) transitions.
[2024-06-02 23:43:24] [INFO ] Flow matrix only has 525 transitions (discarded 10 similar events)
[2024-06-02 23:43:24] [INFO ] Invariant cache hit.
[2024-06-02 23:43:24] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:43:24] [INFO ] Flow matrix only has 525 transitions (discarded 10 similar events)
[2024-06-02 23:43:24] [INFO ] Invariant cache hit.
[2024-06-02 23:43:24] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-02 23:43:24] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-06-02 23:43:24] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 23:43:24] [INFO ] Flow matrix only has 525 transitions (discarded 10 similar events)
[2024-06-02 23:43:24] [INFO ] Invariant cache hit.
[2024-06-02 23:43:24] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 768 ms. Remains : 182/182 places, 535/535 transitions.
Ending property specific reduction for FireWire-PT-20-UpperBounds-08 in 5057 ms.
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 70 ms
[2024-06-02 23:43:25] [INFO ] Applying decomposition
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 33 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/graph3643458475744441035.txt' '-o' '/tmp/graph3643458475744441035.bin' '-w' '/tmp/graph3643458475744441035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3643458475744441035.bin' '-l' '-1' '-v' '-w' '/tmp/graph3643458475744441035.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:43:25] [INFO ] Decomposing Gal with order
[2024-06-02 23:43:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:43:25] [INFO ] Removed a total of 930 redundant transitions.
[2024-06-02 23:43:25] [INFO ] Flatten gal took : 92 ms
[2024-06-02 23:43:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 256 labels/synchronizations in 20 ms.
[2024-06-02 23:43:25] [INFO ] Time to serialize gal into /tmp/UpperBounds2155688097516064655.gal : 7 ms
[2024-06-02 23:43:25] [INFO ] Time to serialize properties into /tmp/UpperBounds1186270655347635679.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/UpperBounds2155688097516064655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1186270655347635679.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 ...283
Loading property file /tmp/UpperBounds1186270655347635679.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.54144e+10,72.4364,1403336,5808,283,1.66829e+06,7785,1132,5.3843e+06,209,69248,0
Total reachable state count : 55414419270

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-20-UpperBounds-06 :0 <= i3.u8.p137 <= 1
FORMULA FireWire-PT-20-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-20-UpperBounds-06,0,73.2257,1403336,1,0,1.66829e+06,7785,1431,5.3843e+06,232,69248,1983
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property FireWire-PT-20-UpperBounds-08 :0 <= i1.u48.p529 <= 1
FORMULA FireWire-PT-20-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-20-UpperBounds-08,0,73.2321,1403336,1,0,1.66829e+06,7785,1464,5.3843e+06,237,69248,2235
Total runtime 148541 ms.

BK_STOP 1717371879892

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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="FireWire-PT-20"
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 FireWire-PT-20, 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 r571-tall-171734910400201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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